problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03212 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SORT(vector) sort(vector.begin(), vector.end())
const ll MOD = 1e9 + 7;
int n;
int func(int s7, int s5, int s3, int num) {
int ret = 0;
if (num > n)
return 0;
if (s7 && s5 && s3)
ret++;
int ret1 = func(s7 + 1, s5, s3, num + 7 * pow(10, s7 + s5 + s3));
int ret2 = func(s7, s5 + 1, s3, num + 5 * pow(10, s7 + s5 + s3));
int ret3 = func(s7, s5, s3 + 1, num + 3 * pow(10, s7 + s5 + s3));
return ret + ret1 + ret2 + ret3;
}
void solve(istream &cin, ostream &cout) {
cin >> n;
cout << func(0, 0, 0, 0) << endl;
}
#ifndef TEST
int main() { solve(cin, cout); }
#endif
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SORT(vector) sort(vector.begin(), vector.end())
const ll MOD = 1e9 + 7;
int n;
int func(int s7, int s5, int s3, ll num) {
int ret = 0;
if (num > n)
return 0;
if (s7 && s5 && s3)
ret++;
int ret1 = func(s7 + 1, s5, s3, num + 7 * pow(10, s7 + s5 + s3));
int ret2 = func(s7, s5 + 1, s3, num + 5 * pow(10, s7 + s5 + s3));
int ret3 = func(s7, s5, s3 + 1, num + 3 * pow(10, s7 + s5 + s3));
return ret + ret1 + ret2 + ret3;
}
void solve(istream &cin, ostream &cout) {
cin >> n;
cout << func(0, 0, 0, 0) << endl;
}
#ifndef TEST
int main() { solve(cin, cout); }
#endif
| replace | 13 | 14 | 13 | 14 | 0 | |
p03212 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 0;
long i, j;
int chk[4] = {0, 0, 0, 0};
long tmp = 0;
int logi;
int tmpi;
int chk7;
for (i = 357; i <= N; i += 2) {
tmp = i;
logi = 1;
chk[0] = 0;
chk[1] = 0;
chk[2] = 0;
chk[3] = 0;
tmpi = 14;
chk7 = 0;
while (tmp > 0) {
switch (tmp % 10) {
case 3:
chk[0]++;
break;
case 5:
chk[1]++;
break;
case 7:
chk[2]++;
if (chk[2] == logi)
chk7++;
break;
default:
chk[3]++;
break;
}
tmp = (tmp - tmp % 10) / 10;
logi++;
}
if (chk[0] > 0 && chk[1] > 0 && chk[2] > 0 && chk[3] == 0)
ans++;
// cout <<i<<" "<<chk[0] <<" "<<chk[1]<<" "<<chk[2]<<" "<<chk[3]<<endl;
for (j = 1; j < chk7; j++) {
tmpi *= 10;
}
if (chk7 > 0 && chk[3] == 0)
i += tmpi;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 0;
long i, j;
int chk[4] = {0, 0, 0, 0};
long tmp = 0;
int logi;
int tmpi;
int chk7;
for (i = 357; i <= N; i += 2) {
tmp = i;
logi = 1;
chk[0] = 0;
chk[1] = 0;
chk[2] = 0;
chk[3] = 0;
tmpi = 14;
chk7 = 0;
while (tmp > 0 && chk[3] == 0) {
switch (tmp % 10) {
case 3:
chk[0]++;
break;
case 5:
chk[1]++;
break;
case 7:
chk[2]++;
if (chk[2] == logi)
chk7++;
break;
default:
chk[3]++;
break;
}
tmp = (tmp - tmp % 10) / 10;
logi++;
}
if (chk[0] > 0 && chk[1] > 0 && chk[2] > 0 && chk[3] == 0)
ans++;
// cout <<i<<" "<<chk[0] <<" "<<chk[1]<<" "<<chk[2]<<" "<<chk[3]<<endl;
for (j = 1; j < chk7; j++) {
tmpi *= 10;
}
if (chk7 > 0 && chk[3] == 0)
i += tmpi;
}
cout << ans;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p03212 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int ans = 0;
void cnt(int n, string s, char add) {
int a, b, c;
a = b = c = 0;
s += add;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '3')
a++;
else if (s[i] == '5')
b++;
else if (s[i] == '7')
c++;
}
if (a && b && c)
ans++;
int ab = stoi(s);
if (ab * 10 + 3 <= n)
cnt(n, s, '3');
if (ab * 10 + 5 <= n)
cnt(n, s, '5');
if (ab * 10 + 7 <= n)
cnt(n, s, '7');
}
int main() {
int n;
string s;
cin >> n;
cnt(n, s, '3');
cnt(n, s, '5');
cnt(n, s, '7');
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int ans = 0;
void cnt(int n, string s, char add) {
int a, b, c;
a = b = c = 0;
s += add;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '3')
a++;
else if (s[i] == '5')
b++;
else if (s[i] == '7')
c++;
}
if (a && b && c)
ans++;
double ab = stoi(s);
if (ab * 10 + 3 <= n)
cnt(n, s, '3');
if (ab * 10 + 5 <= n)
cnt(n, s, '5');
if (ab * 10 + 7 <= n)
cnt(n, s, '7');
}
int main() {
int n;
string s;
cin >> n;
cnt(n, s, '3');
cnt(n, s, '5');
cnt(n, s, '7');
cout << ans << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03212 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef set<int> S;
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
n = min(n, 777777753);
int cnt = 0;
for (int i = 357; i <= n; i++) {
bool is_used[10] = {};
int t = i;
bool flag = true;
while (t > 0) {
int r = t % 10;
if (r != 3 && r != 5 && r != 7) {
flag = false;
break;
}
is_used[r] = true;
t /= 10;
}
if (!flag) {
continue;
}
if (is_used[3] && is_used[5] && is_used[7]) {
cnt++;
}
if (i == 377777775) {
i = 533333337 - 1;
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef set<int> S;
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
n = min(n, 777777753);
int cnt = 0;
for (int i = 357; i <= n; i++) {
bool is_used[10] = {};
int t = i;
bool flag = true;
while (t > 0) {
int r = t % 10;
if (r != 3 && r != 5 && r != 7) {
flag = false;
break;
}
is_used[r] = true;
t /= 10;
}
if (!flag) {
continue;
}
if (is_used[3] && is_used[5] && is_used[7]) {
cnt++;
}
if (i == 377777775) {
i = 533333337 - 1;
}
if (i == 77777753) {
i = 333333357 - 1;
}
if (i == 577777773) {
i = 733333335 - 1;
}
}
cout << cnt << endl;
return 0;
}
| insert | 50 | 50 | 50 | 56 | TLE | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using plll = pair<ll, pll>;
using graph = vector<vector<int>>;
const ll MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll pow1(ll a, ll b, ll p = LLONG_MAX) {
ll ret = 1;
while (b != 0) {
if ((b & 1) == 1) {
ret *= a;
}
a *= a;
if (a >= p)
a %= p;
b = b >> 1;
}
return ret;
}
int digit(ll a, ll b) {
int i = 0;
while (a != 0) {
a /= b;
i++;
}
return i;
}
ll gcd1(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
ll n;
while (a % b != 0) {
n = a % b;
a = b;
b = n;
}
return b;
}
ll solveLinear(ll n, ll m, ll c) {
if (n == 0 && m == 0)
return 0;
ll a[100], b[100];
a[0] = n;
b[0] = m;
int i = 1;
while (b[i - 1] != 0) {
a[i] = b[i - 1];
b[i] = a[i - 1] % b[i - 1];
i++;
}
n = i;
if (c % a[n - 1] != 0) {
return 0;
}
ll x = c / a[n - 1], y = 0;
for (i = 1; i < n; i++) {
ll cnt = x;
x = y;
y = cnt - (a[n - i - 1] / b[n - i - 1]) * y;
}
return x;
}
ll modRev(ll a, ll p = MOD) {
a %= p;
ll n = solveLinear(a, p, 1);
n %= p;
if (n < 0)
return n + p;
return n;
}
ll fact(ll n, ll p = MOD) {
if (n < 0)
return 0;
int i;
ll ret = 1;
for (i = 0; i < n; i++) {
ret = ret * (i + 1);
if (ret >= p)
ret %= p;
}
return ret;
}
ll perm(ll n, ll k, ll p = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
int i;
ll ret = 1;
for (i = 0; i < k; i++) {
ret = ret * (n - i);
if (ret >= p)
ret %= p;
}
return ret;
}
ll binom(ll n, ll k, ll p = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
int i;
ll ret = 1, fact = 1;
for (i = 0; i < k; i++) {
ret = ret * (n - i);
fact *= i + 1;
if (ret >= p)
ret %= p;
if (fact >= p)
fact %= p;
}
return (ret * modRev(fact)) % p;
}
void pushHeap(vector<int> &h, int n) {
int i = h.size();
h.push_back(n);
while (i != 0 && h[(i - 1) / 2] < h[i]) {
swap(h[i], h[(i - 1) / 2]);
i = (i - 1) / 2;
}
h[i] = n;
}
int popHeap(vector<int> &h) {
int n = h.size() - 1;
if (n == -1)
return 0;
int i, ret = h[0];
swap(h[0], h[n]);
h.pop_back();
for (i = 0; i < n;) {
int j = 2 * i + 1;
if (j >= n)
break;
if (j != n - 1 && h[j] < h[j + 1])
j++;
if (h[i] < h[j]) {
swap(h[i], h[j]);
}
i = j;
}
return ret;
}
vector<int> ver;
void dfs(const graph &g, int v) {
ver[v] = 1;
for (auto i : g[v]) {
if (ver[i] != 1)
continue;
dfs(g, i);
}
}
int bis(vector<int> v, int key) {
int left = -1, right = v.size();
while (abs1(right - left) > 1) {
int mid = left + (right - left) / 2;
if (v[mid] <= key)
left = mid;
else
right = mid;
}
return left;
}
int ordfact(int n, int p) {
int ret = 0;
while (n != 0) {
n /= p;
ret += n;
}
return ret;
}
int main() {
int i, j, k, cnt = 0;
int n;
cin >> n;
vector<int> p;
for (i = 2; i <= n; i++) {
for (j = 2; j < i; j++) {
if (i % j == 0)
break;
}
if (j == i)
p.push_back(i);
}
vector<int> d;
for (i = 0; i < p.size(); i++) {
d.push_back(ordfact(n, p[i]));
}
if (d[0] >= 74)
cnt++;
int c[25];
for (i = 0; i < 25; i++)
c[i] = 0;
for (i = 0; i < d.size(); i++) {
if (d[i] >= 24)
c[24]++;
if (d[i] >= 14)
c[14]++;
if (d[i] >= 4)
c[4]++;
if (d[i] >= 2)
c[2]++;
}
cnt += c[24] * (c[2] - 1);
cnt += c[14] * (c[4] - 1);
cnt += (c[4] * (c[4] - 1) / 2) * (c[2] - 2);
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using plll = pair<ll, pll>;
using graph = vector<vector<int>>;
const ll MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll pow1(ll a, ll b, ll p = LLONG_MAX) {
ll ret = 1;
while (b != 0) {
if ((b & 1) == 1) {
ret *= a;
}
a *= a;
if (a >= p)
a %= p;
b = b >> 1;
}
return ret;
}
int digit(ll a, ll b) {
int i = 0;
while (a != 0) {
a /= b;
i++;
}
return i;
}
ll gcd1(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
ll n;
while (a % b != 0) {
n = a % b;
a = b;
b = n;
}
return b;
}
ll solveLinear(ll n, ll m, ll c) {
if (n == 0 && m == 0)
return 0;
ll a[100], b[100];
a[0] = n;
b[0] = m;
int i = 1;
while (b[i - 1] != 0) {
a[i] = b[i - 1];
b[i] = a[i - 1] % b[i - 1];
i++;
}
n = i;
if (c % a[n - 1] != 0) {
return 0;
}
ll x = c / a[n - 1], y = 0;
for (i = 1; i < n; i++) {
ll cnt = x;
x = y;
y = cnt - (a[n - i - 1] / b[n - i - 1]) * y;
}
return x;
}
ll modRev(ll a, ll p = MOD) {
a %= p;
ll n = solveLinear(a, p, 1);
n %= p;
if (n < 0)
return n + p;
return n;
}
ll fact(ll n, ll p = MOD) {
if (n < 0)
return 0;
int i;
ll ret = 1;
for (i = 0; i < n; i++) {
ret = ret * (i + 1);
if (ret >= p)
ret %= p;
}
return ret;
}
ll perm(ll n, ll k, ll p = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
int i;
ll ret = 1;
for (i = 0; i < k; i++) {
ret = ret * (n - i);
if (ret >= p)
ret %= p;
}
return ret;
}
ll binom(ll n, ll k, ll p = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
int i;
ll ret = 1, fact = 1;
for (i = 0; i < k; i++) {
ret = ret * (n - i);
fact *= i + 1;
if (ret >= p)
ret %= p;
if (fact >= p)
fact %= p;
}
return (ret * modRev(fact)) % p;
}
void pushHeap(vector<int> &h, int n) {
int i = h.size();
h.push_back(n);
while (i != 0 && h[(i - 1) / 2] < h[i]) {
swap(h[i], h[(i - 1) / 2]);
i = (i - 1) / 2;
}
h[i] = n;
}
int popHeap(vector<int> &h) {
int n = h.size() - 1;
if (n == -1)
return 0;
int i, ret = h[0];
swap(h[0], h[n]);
h.pop_back();
for (i = 0; i < n;) {
int j = 2 * i + 1;
if (j >= n)
break;
if (j != n - 1 && h[j] < h[j + 1])
j++;
if (h[i] < h[j]) {
swap(h[i], h[j]);
}
i = j;
}
return ret;
}
vector<int> ver;
void dfs(const graph &g, int v) {
ver[v] = 1;
for (auto i : g[v]) {
if (ver[i] != 1)
continue;
dfs(g, i);
}
}
int bis(vector<int> v, int key) {
int left = -1, right = v.size();
while (abs1(right - left) > 1) {
int mid = left + (right - left) / 2;
if (v[mid] <= key)
left = mid;
else
right = mid;
}
return left;
}
int ordfact(int n, int p) {
int ret = 0;
while (n != 0) {
n /= p;
ret += n;
}
return ret;
}
int main() {
int i, j, k, cnt = 0;
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<int> p;
for (i = 2; i <= n; i++) {
for (j = 2; j < i; j++) {
if (i % j == 0)
break;
}
if (j == i)
p.push_back(i);
}
vector<int> d;
for (i = 0; i < p.size(); i++) {
d.push_back(ordfact(n, p[i]));
}
if (d[0] >= 74)
cnt++;
int c[25];
for (i = 0; i < 25; i++)
c[i] = 0;
for (i = 0; i < d.size(); i++) {
if (d[i] >= 24)
c[24]++;
if (d[i] >= 14)
c[14]++;
if (d[i] >= 4)
c[4]++;
if (d[i] >= 2)
c[2]++;
}
cnt += c[24] * (c[2] - 1);
cnt += c[14] * (c[4] - 1);
cnt += (c[4] * (c[4] - 1) / 2) * (c[2] - 2);
cout << cnt << endl;
}
| insert | 196 | 196 | 196 | 200 | 0 | |
p03213 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
vector<pair<ll, int>> prime_factorization(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
int n;
cin >> n;
map<int, int> fac;
for (int i = 1; i <= n; i++) {
auto now = prime_factorization(i);
rep(j, now.size()) {
int key = now[j].first;
int val = now[j].second;
fac[key] += val;
}
}
// for(auto t: fac) cout << t.first << " " << t.second << endl;
// auto div75 = divisor(75);
// for(auto t: div75) cout << t << endl;
int ans = 0;
vector<int> cnt;
for (auto t : fac) {
cnt.push_back(t.second);
}
sort(all(cnt));
for (int i = 0; i < cnt.size() - 2; i++) {
for (int j = i + 1; j < cnt.size() - 1; j++) {
for (int k = j + 1; k < cnt.size(); k++) {
if (cnt[i] >= 2 && cnt[j] >= 4 && cnt[k] >= 4)
ans++;
if (cnt[i] >= 4 && cnt[j] >= 2 && cnt[k] >= 4)
ans++;
if (cnt[i] >= 4 && cnt[j] >= 4 && cnt[k] >= 2)
ans++;
}
}
}
for (int i = 0; i < cnt.size() - 1; i++) {
for (int j = i + 1; j < cnt.size(); j++) {
if (cnt[i] >= 4 && cnt[j] >= 14)
ans++;
if (cnt[i] >= 14 && cnt[j] >= 4)
ans++;
}
}
for (int i = 0; i < cnt.size() - 1; i++) {
for (int j = i + 1; j < cnt.size(); j++) {
if (cnt[i] >= 2 && cnt[j] >= 24)
ans++;
if (cnt[i] >= 24 && cnt[j] >= 2)
ans++;
}
}
for (int i = 0; i < cnt.size(); i++) {
if (cnt[i] >= 74)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
vector<pair<ll, int>> prime_factorization(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
map<int, int> fac;
for (int i = 1; i <= n; i++) {
auto now = prime_factorization(i);
rep(j, now.size()) {
int key = now[j].first;
int val = now[j].second;
fac[key] += val;
}
}
// for(auto t: fac) cout << t.first << " " << t.second << endl;
// auto div75 = divisor(75);
// for(auto t: div75) cout << t << endl;
int ans = 0;
vector<int> cnt;
for (auto t : fac) {
cnt.push_back(t.second);
}
sort(all(cnt));
for (int i = 0; i < cnt.size() - 2; i++) {
for (int j = i + 1; j < cnt.size() - 1; j++) {
for (int k = j + 1; k < cnt.size(); k++) {
if (cnt[i] >= 2 && cnt[j] >= 4 && cnt[k] >= 4)
ans++;
if (cnt[i] >= 4 && cnt[j] >= 2 && cnt[k] >= 4)
ans++;
if (cnt[i] >= 4 && cnt[j] >= 4 && cnt[k] >= 2)
ans++;
}
}
}
for (int i = 0; i < cnt.size() - 1; i++) {
for (int j = i + 1; j < cnt.size(); j++) {
if (cnt[i] >= 4 && cnt[j] >= 14)
ans++;
if (cnt[i] >= 14 && cnt[j] >= 4)
ans++;
}
}
for (int i = 0; i < cnt.size() - 1; i++) {
for (int j = i + 1; j < cnt.size(); j++) {
if (cnt[i] >= 2 && cnt[j] >= 24)
ans++;
if (cnt[i] >= 24 && cnt[j] >= 2)
ans++;
}
}
for (int i = 0; i < cnt.size(); i++) {
if (cnt[i] >= 74)
ans++;
}
cout << ans << endl;
return 0;
} | insert | 38 | 38 | 38 | 42 | TLE | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
void test_case() {
int n;
cin >> n;
map<int, int> cnt;
for (int i = 1; i <= n; ++i) {
int x = i;
for (int f = 2; f * f <= x; ++f) {
while (x % f == 0) {
++cnt[f];
x /= f;
}
}
if (x != 1) {
++cnt[x];
}
}
debug(cnt);
vector<pair<int, int>> v_cnt;
for (auto i : cnt) {
v_cnt.push_back(i);
}
set<long long> unq;
function<void(int, int, long long)> solve = [&](int ind, int num,
long long x) {
if (num == 1) {
unq.insert(x);
return;
} else if (ind == v_cnt.size() + 1) {
return;
}
long long p = 1;
for (int take = 0; take <= v_cnt[ind].second; ++take) {
if (num % (take + 1) == 0) {
solve(ind + 1, num / (take + 1), x * p);
}
p *= v_cnt[ind].first;
}
};
solve(0, 75, 1);
cout << unq.size() << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
test_case();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
void test_case() {
int n;
cin >> n;
map<int, int> cnt;
for (int i = 1; i <= n; ++i) {
int x = i;
for (int f = 2; f * f <= x; ++f) {
while (x % f == 0) {
++cnt[f];
x /= f;
}
}
if (x != 1) {
++cnt[x];
}
}
debug(cnt);
vector<pair<int, int>> v_cnt;
for (auto i : cnt) {
v_cnt.push_back(i);
}
set<long long> unq;
function<void(int, int, long long)> solve = [&](int ind, int num,
long long x) {
if (num == 1) {
unq.insert(x);
return;
} else if (ind == v_cnt.size()) {
return;
}
long long p = 1;
for (int take = 0; take <= v_cnt[ind].second; ++take) {
if (num % (take + 1) == 0) {
solve(ind + 1, num / (take + 1), x * p);
}
p *= v_cnt[ind].first;
}
};
solve(0, 75, 1);
cout << unq.size() << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
test_case();
return 0;
} | replace | 65 | 66 | 65 | 66 | 0 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int N, n, ans;
map<int, int> x;
vector<int> w;
const int MOD = 1e9 + 7;
const int MAX = 100;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 素因数分解
void prime_factor(int n) {
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
x[i]++;
n /= i;
}
}
if (n != 1)
x[n]++;
}
void solve_25_3() {
int n25 = 0, n3 = 0;
for (int x : w) {
if (3 <= x)
n3++;
if (25 <= x)
n25++;
}
ans += n25 * (n3 - 1);
}
void solve_15_5() {
int n15 = 0, n5 = 0;
for (int x : w) {
if (5 <= x)
n5++;
if (15 <= x)
n15++;
}
ans += n15 * (n5 - 1);
}
void solve_5_5_3() {
int n5 = 0, n3 = 0;
for (int x : w) {
if (5 <= x)
n5++;
if (3 <= x)
n3++;
}
ans += comb(n5, 2) * (n3 - 2);
}
int main() {
comb_init();
cin >> N;
for (int i = 1; i <= N; i++)
prime_factor(i);
for (auto p : x) {
if (p.second > 1)
w.push_back(p.second + 1);
}
n = w.size();
ans = 0;
if (75 <= w[0])
ans++;
solve_25_3();
solve_15_5();
solve_5_5_3();
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int N, n, ans;
map<int, int> x;
vector<int> w;
const int MOD = 1e9 + 7;
const int MAX = 100;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 素因数分解
void prime_factor(int n) {
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
x[i]++;
n /= i;
}
}
if (n != 1)
x[n]++;
}
void solve_25_3() {
int n25 = 0, n3 = 0;
for (int x : w) {
if (3 <= x)
n3++;
if (25 <= x)
n25++;
}
ans += n25 * (n3 - 1);
}
void solve_15_5() {
int n15 = 0, n5 = 0;
for (int x : w) {
if (5 <= x)
n5++;
if (15 <= x)
n15++;
}
ans += n15 * (n5 - 1);
}
void solve_5_5_3() {
int n5 = 0, n3 = 0;
for (int x : w) {
if (5 <= x)
n5++;
if (3 <= x)
n3++;
}
ans += comb(n5, 2) * (n3 - 2);
}
int main() {
comb_init();
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= N; i++)
prime_factor(i);
for (auto p : x) {
if (p.second > 1)
w.push_back(p.second + 1);
}
n = w.size();
ans = 0;
if (75 <= w[0])
ans++;
solve_25_3();
solve_15_5();
solve_5_5_3();
cout << ans << endl;
}
| insert | 81 | 81 | 81 | 85 | 0 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
map<ll, ll> prime_decomposition(ll n) {
map<ll, ll> mp;
FOR(i, 2, n + 1) {
ll t = i;
for (ll p = 2; p * p <= t; p++) {
if (t % p != 0)
continue;
ll cnt = 0;
while (t % p == 0) {
cnt++;
t /= p;
}
mp[p] += cnt;
}
if (t != 1)
mp[t] += 1;
}
return mp;
}
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
map<ll, ll> mp = prime_decomposition(n);
// for (auto& x : mp) {
// cout << x.first << " " << x.second << endl;
// }
ll m = SZ(mp);
vector<vector<ll>> dp(m + 1, vector<ll>(75, 0));
dp[0][1] = 1;
ll i = 0;
for (auto &x : mp) {
FOR(j, 1, 76) {
REP(k, x.second + 1) {
ll nj = (k + 1) * j;
if (nj > 75) {
continue;
}
dp[i + 1][nj] += dp[i][j];
}
}
i++;
}
// REP(i, m + 1) {
// REP(j, 76) {
// if (dp[i][j]) {
// DUMP(i);
// DUMP(j);
// DUMP(dp[i][j]);
// }
// }
// }
cout << dp[m][75] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
map<ll, ll> prime_decomposition(ll n) {
map<ll, ll> mp;
FOR(i, 2, n + 1) {
ll t = i;
for (ll p = 2; p * p <= t; p++) {
if (t % p != 0)
continue;
ll cnt = 0;
while (t % p == 0) {
cnt++;
t /= p;
}
mp[p] += cnt;
}
if (t != 1)
mp[t] += 1;
}
return mp;
}
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
map<ll, ll> mp = prime_decomposition(n);
// for (auto& x : mp) {
// cout << x.first << " " << x.second << endl;
// }
ll m = SZ(mp);
vector<vector<ll>> dp(m + 1, vector<ll>(76, 0));
dp[0][1] = 1;
ll i = 0;
for (auto &x : mp) {
FOR(j, 1, 76) {
REP(k, x.second + 1) {
ll nj = (k + 1) * j;
if (nj > 75) {
continue;
}
dp[i + 1][nj] += dp[i][j];
}
}
i++;
}
// REP(i, m + 1) {
// REP(j, 76) {
// if (dp[i][j]) {
// DUMP(i);
// DUMP(j);
// DUMP(dp[i][j]);
// }
// }
// }
cout << dp[m][75] << endl;
} | replace | 46 | 47 | 46 | 47 | -6 | munmap_chunk(): invalid pointer
|
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void primes(long N, vector<long> &p) {
long i = 2;
while (N != 1) {
if (0 == N % i) {
N /= i;
p.at(i)++;
} else
i++;
}
return;
}
long comb(long N, long P) {
long S = 1;
for (long i = 1; i <= P; i++) {
S *= N;
S /= i;
N--;
}
return S;
}
/*
long perm(long N, long P) {
long S=1;
for (long i=1; i<=P; i++) {
S *= N;
N--;
}
return S;
}
*/
long NofP(long N, vector<long> &p) {
N--;
long S = 0;
for (long i = 0; i < p.size(); i++) {
if (p.at(i) >= N)
S++;
}
return S;
}
int main() {
long N = 100;
cin >> N;
vector<long> p(N, 0);
for (long i = 2; i <= N; i++) {
primes(i, p);
}
long S = 0;
S += comb(NofP(75, p), 1);
S += comb(NofP(25, p), 1) * comb(NofP(3, p) - 1, 1);
S += comb(NofP(15, p), 1) * comb(NofP(5, p) - 1, 1);
S += comb(NofP(5, p), 2) * comb(NofP(3, p) - 2, 1);
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void primes(long N, vector<long> &p) {
long i = 2;
while (N != 1) {
if (0 == N % i) {
N /= i;
p.at(i)++;
} else
i++;
}
return;
}
long comb(long N, long P) {
long S = 1;
for (long i = 1; i <= P; i++) {
S *= N;
S /= i;
N--;
}
return S;
}
/*
long perm(long N, long P) {
long S=1;
for (long i=1; i<=P; i++) {
S *= N;
N--;
}
return S;
}
*/
long NofP(long N, vector<long> &p) {
N--;
long S = 0;
for (long i = 0; i < p.size(); i++) {
if (p.at(i) >= N)
S++;
}
return S;
}
int main() {
long N = 100;
cin >> N;
vector<long> p(N + 1, 0);
for (long i = 2; i <= N; i++) {
primes(i, p);
}
long S = 0;
S += comb(NofP(75, p), 1);
S += comb(NofP(25, p), 1) * comb(NofP(3, p) - 1, 1);
S += comb(NofP(15, p), 1) * comb(NofP(5, p) - 1, 1);
S += comb(NofP(5, p), 2) * comb(NofP(3, p) - 2, 1);
cout << S << endl;
return 0;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long kaijo(long n) {
long ret = 1;
for (int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
}
long com(long n, long r) {
long ans = kaijo(n) / kaijo(r) / kaijo(n - r);
return ans;
}
int main() {
int N;
cin >> N;
vector<long> a(N);
if (N <= 9) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i <= N; i++) {
int m = i;
for (int j = 2; j <= sqrt(i); j++) {
while (m % j == 0) {
a[j]++;
m /= j;
}
}
if (m > 1)
a[m]++;
}
for (int i = 1; i <= N; i++) {
// cout<<a[i]<<endl;
}
int f4 = 0, f2 = 0, f74 = 0, f24 = 0, f14 = 0;
for (int i = 0; i <= N; i++) {
if (a[i] >= 74)
f74++;
if (a[i] >= 24)
f24++;
if (a[i] >= 14)
f14++;
if (a[i] >= 4)
f4++;
if (a[i] < 4 && a[i] >= 2)
f2++;
}
long ans = 0;
// 1*75
ans += f74;
// 3*25
ans += f24 * (f4 + f2 - 1);
// 5*15
ans += f14 * (f4 - 1);
// 3*5*5
if (f4 >= 3)
ans += f4 * com(f4 - 1, 2);
ans += f2 * com(f4, 2);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long kaijo(long n) {
long ret = 1;
for (int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
}
long com(long n, long r) {
long ans = kaijo(n) / kaijo(r) / kaijo(n - r);
return ans;
}
int main() {
int N;
cin >> N;
vector<long> a(100);
if (N <= 9) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i <= N; i++) {
int m = i;
for (int j = 2; j <= sqrt(i); j++) {
while (m % j == 0) {
a[j]++;
m /= j;
}
}
if (m > 1)
a[m]++;
}
for (int i = 1; i <= N; i++) {
// cout<<a[i]<<endl;
}
int f4 = 0, f2 = 0, f74 = 0, f24 = 0, f14 = 0;
for (int i = 0; i <= N; i++) {
if (a[i] >= 74)
f74++;
if (a[i] >= 24)
f24++;
if (a[i] >= 14)
f14++;
if (a[i] >= 4)
f4++;
if (a[i] < 4 && a[i] >= 2)
f2++;
}
long ans = 0;
// 1*75
ans += f74;
// 3*25
ans += f24 * (f4 + f2 - 1);
// 5*15
ans += f14 * (f4 - 1);
// 3*5*5
if (f4 >= 3)
ans += f4 * com(f4 - 1, 2);
ans += f2 * com(f4, 2);
cout << ans << endl;
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p03213 | C++ | Runtime Error | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int t[101];
int pri[26];
int res = 0;
void p756() {
int N;
cin >> N;
pri[0] = 2;
int pi = 1;
for (size_t i = 3; i <= 100; i += 2) {
bool isp = true;
for (size_t j = 3; j < i; j++) {
if (i % j == 0) {
isp = false;
break;
}
}
if (isp)
pri[pi++] = i;
}
t[1] = 1;
for (size_t i = 2; i <= N; i++) {
int ti = i;
for (size_t j = 0; j < 25; j++) {
while (ti % pri[j] == 0) {
t[pri[j]]++;
ti /= pri[j];
}
}
}
int dp[26][101];
for (size_t i = 0; i < 101; i++) {
dp[0][i] = -1;
}
ll res = 0;
dp[0][1] = 1;
for (size_t i = 0; i < 26; i++) {
for (size_t j = 1; j < 101; j++) {
dp[i + 1][j] = -1;
}
dp[i + 1][0] = dp[i][0];
for (size_t j = 0; j <= t[pri[i]]; j++) {
for (size_t k = 1; k <= 75; k++) {
if (dp[i][k] == -1)
continue;
int next = dp[i][k];
if (k * (j + 1) < 101) {
if (dp[i + 1][k * (j + 1)] < 0) {
dp[i + 1][k * (j + 1)] = 0;
}
dp[i + 1][k * (j + 1)] += next;
}
}
}
}
if (dp[25][75] == -1) {
cout << 0 << endl;
} else
cout << dp[25][75] << endl;
}
int main() {
p756();
return 0;
}
| #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int t[101];
int pri[26];
int res = 0;
void p756() {
int N;
cin >> N;
pri[0] = 2;
int pi = 1;
for (size_t i = 3; i <= 100; i += 2) {
bool isp = true;
for (size_t j = 3; j < i; j++) {
if (i % j == 0) {
isp = false;
break;
}
}
if (isp)
pri[pi++] = i;
}
t[1] = 1;
for (size_t i = 2; i <= N; i++) {
int ti = i;
for (size_t j = 0; j < 25; j++) {
while (ti % pri[j] == 0) {
t[pri[j]]++;
ti /= pri[j];
}
}
}
int dp[27][101];
for (size_t i = 0; i < 101; i++) {
dp[0][i] = -1;
}
ll res = 0;
dp[0][1] = 1;
for (size_t i = 0; i < 26; i++) {
for (size_t j = 1; j < 101; j++) {
dp[i + 1][j] = -1;
}
dp[i + 1][0] = dp[i][0];
for (size_t j = 0; j <= t[pri[i]]; j++) {
for (size_t k = 1; k <= 75; k++) {
if (dp[i][k] == -1)
continue;
int next = dp[i][k];
if (k * (j + 1) < 101) {
if (dp[i + 1][k * (j + 1)] < 0) {
dp[i + 1][k * (j + 1)] = 0;
}
dp[i + 1][k * (j + 1)] += next;
}
}
}
}
if (dp[25][75] == -1) {
cout << 0 << endl;
} else
cout << dp[25][75] << endl;
}
int main() {
p756();
return 0;
}
| replace | 51 | 52 | 51 | 52 | -6 | *** stack smashing detected ***: terminated
|
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<int, int> Map;
template <class T> void fact(T n) {
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
Map[i]++;
n /= i;
}
}
if (n == 1)
return;
Map[n]++;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
fact(i);
int res = 0;
vector<int> num;
for (auto i : Map)
num.push_back(i.second);
int m = num.size();
for (int i = 0; i < m; i++) {
for (int j = i + 1; j < m; j++) {
for (int k = 0; k < m; k++) {
if (i == k || j == k)
continue;
if (num[i] >= 4 && num[j] >= 4 && num[k] >= 2)
res++;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j)
continue;
if (num[i] >= 14 && num[j] >= 4)
res++;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j)
continue;
if (num[i] >= 24 && num[j] >= 2)
res++;
}
}
if (num.front() >= 74)
res++;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<int, int> Map;
template <class T> void fact(T n) {
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
Map[i]++;
n /= i;
}
}
if (n == 1)
return;
Map[n]++;
}
int main() {
int n;
cin >> n;
if (n < 10) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++)
fact(i);
int res = 0;
vector<int> num;
for (auto i : Map)
num.push_back(i.second);
int m = num.size();
for (int i = 0; i < m; i++) {
for (int j = i + 1; j < m; j++) {
for (int k = 0; k < m; k++) {
if (i == k || j == k)
continue;
if (num[i] >= 4 && num[j] >= 4 && num[k] >= 2)
res++;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j)
continue;
if (num[i] >= 14 && num[j] >= 4)
res++;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j)
continue;
if (num[i] >= 24 && num[j] >= 2)
res++;
}
}
if (num.front() >= 74)
res++;
cout << res << endl;
} | insert | 21 | 21 | 21 | 25 | 0 | |
p03213 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int combi(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return combi(n - 1, k - 1) + combi(n - 1, k);
}
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll calc(int a, int b, int p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = calc(a, b / 2, p);
return (d * d) % p;
} else {
return (a * calc(a, b - 1, p)) % p;
}
}
int main() {
int primenumber[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
int divi[100] = {};
int N, count = 0;
cin >> N;
for (int i = 2; i <= N; i++) {
for (int j = 2; j <= N; j++) {
if (i % j != 0)
continue;
for (int k = 0; k < 25; k++) {
if (j == primenumber[k]) {
int curr = i, count = 0;
while (curr % j == 0) {
count++;
curr /= j;
}
divi[primenumber[k]] += count;
}
}
}
}
int count74 = 0, count24 = 0, count14 = 0, count4 = 0, count2 = 0;
for (int i = 0; i < 25; i++) {
if (divi[primenumber[i]] >= 74)
count74++;
if (divi[primenumber[i]] >= 24)
count24++;
if (divi[primenumber[i]] >= 14)
count14++;
if (divi[primenumber[i]] >= 4)
count4++;
if (divi[primenumber[i]] >= 2)
count2++;
}
count += combi(count4, 2) * (count2 - 2);
count += count14 * (count4 - 1);
count += count24 * (count2 - 1);
count += count74;
cout << count;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int combi(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return combi(n - 1, k - 1) + combi(n - 1, k);
}
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll calc(int a, int b, int p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = calc(a, b / 2, p);
return (d * d) % p;
} else {
return (a * calc(a, b - 1, p)) % p;
}
}
int main() {
int primenumber[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
int divi[100] = {};
int N, count = 0;
cin >> N;
for (int i = 2; i <= N; i++) {
for (int j = 2; j <= N; j++) {
if (i % j != 0)
continue;
for (int k = 0; k < 25; k++) {
if (j == primenumber[k]) {
int curr = i, count = 0;
while (curr % j == 0) {
count++;
curr /= j;
}
divi[primenumber[k]] += count;
}
}
}
}
int count74 = 0, count24 = 0, count14 = 0, count4 = 0, count2 = 0;
for (int i = 0; i < 25; i++) {
if (divi[primenumber[i]] >= 74)
count74++;
if (divi[primenumber[i]] >= 24)
count24++;
if (divi[primenumber[i]] >= 14)
count14++;
if (divi[primenumber[i]] >= 4)
count4++;
if (divi[primenumber[i]] >= 2)
count2++;
}
if (count4 != 0)
count += combi(count4, 2) * (count2 - 2);
count += count14 * (count4 - 1);
count += count24 * (count2 - 1);
count += count74;
cout << count;
}
| replace | 75 | 76 | 75 | 77 | TLE | |
p03213 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 2; i <= n; ++i) {
int tmp = i;
for (int j = 2; j * j <= i; ++j) {
while (1) {
if (tmp % j != 0)
break;
++mp[j];
tmp /= j;
}
}
// cout << i << " " << tmp << endl;
if (tmp != 1)
++mp[tmp];
}
// for (auto p : mp) {
// cout << p.first << " " << p.second << endl;
// }
vector<int> dp(n + 1, 0);
dp[1] = 1;
for (int i = 1; i <= 100; ++i) {
if (mp[i] != 0) {
for (int j = 75; j >= 1; --j) {
for (int x = 1; x <= mp[i]; ++x) {
if (j * (x + 1) <= 75) {
dp[j * (x + 1)] += dp[j];
}
}
}
}
}
cout << dp[75] << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 2; i <= n; ++i) {
int tmp = i;
for (int j = 2; j * j <= i; ++j) {
while (1) {
if (tmp % j != 0)
break;
++mp[j];
tmp /= j;
}
}
// cout << i << " " << tmp << endl;
if (tmp != 1)
++mp[tmp];
}
// for (auto p : mp) {
// cout << p.first << " " << p.second << endl;
// }
vector<int> dp(76, 0);
dp[1] = 1;
for (int i = 1; i <= 100; ++i) {
if (mp[i] != 0) {
for (int j = 75; j >= 1; --j) {
for (int x = 1; x <= mp[i]; ++x) {
if (j * (x + 1) <= 75) {
dp[j * (x + 1)] += dp[j];
}
}
}
}
}
cout << dp[75] << endl;
return 0;
} | replace | 39 | 40 | 39 | 40 | -11 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
const LL INF = 1 << 17;
vector<LL> fact;
vector<LL> inver(200001);
LL combi(int n, int r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact[n] % mod * inver[n - r] % mod * inver[r] % mod;
}
LL hcombi(int n, int r) { return combi(n + r - 1, r); }
LL fpow(LL a, LL n) {
LL x = 1;
while (n > 0) {
if (n & 1) {
x = x * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return x;
}
void set_combi() {
LL s = 1;
fact.push_back(1);
for (int i = 1; i <= 200000; i++) {
s *= i;
s %= mod;
fact.push_back(s);
}
inver[200000] = fpow(fact[200000], mod - 2);
for (int i = 199999; i >= 0; i--) {
inver[i] = inver[i + 1] * (i + 1) % mod;
}
}
LL dp[101][1000];
int main() {
LL N;
cin >> N;
vector<LL> v(101, 0);
for (int i = 2; i <= N; i++) {
int t = i;
for (int j = 2; j <= N; j++) {
while (t % j == 0) {
v[j]++;
t /= j;
}
}
}
dp[0][1] = 1;
for (int i = 0; i <= N; i++) {
for (int j = 1; j < 75; j++) {
for (int k = 0; k <= v[i]; k++) {
if (j * (k + 1) <= 75)
dp[i + 1][j * (k + 1)] += dp[i][j];
}
}
}
LL ans = 0;
for (int i = 0; i <= N; i++) {
ans += dp[i][75];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
const LL INF = 1 << 17;
LL dp[101][1000];
int main() {
LL N;
cin >> N;
vector<LL> v(101, 0);
for (int i = 2; i <= N; i++) {
int t = i;
for (int j = 2; j <= N; j++) {
while (t % j == 0) {
v[j]++;
t /= j;
}
}
}
dp[0][1] = 1;
for (int i = 0; i <= N; i++) {
for (int j = 1; j < 75; j++) {
for (int k = 0; k <= v[i]; k++) {
if (j * (k + 1) <= 75)
dp[i + 1][j * (k + 1)] += dp[i][j];
}
}
}
LL ans = 0;
for (int i = 0; i <= N; i++) {
ans += dp[i][75];
}
cout << ans << endl;
return 0;
}
| delete | 14 | 51 | 14 | 14 | 0 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(76, 0);
for (int i = 2; i <= n; i++) {
int X = i;
for (int div = 2; div <= i; div++) {
int cnt = 0;
while (X % div == 0) {
cnt++;
X /= div;
}
d[div] += cnt;
}
}
int d2 = 0, d4 = 0, d14 = 0, d24 = 0, d74 = 0;
for (int i = 0; i < 76; i++) {
if (d[i] >= 2)
d2++;
if (d[i] >= 4)
d4++;
if (d[i] >= 14)
d14++;
if (d[i] >= 24)
d24++;
if (d[i] >= 74)
d74++;
}
int ans = 0;
ans += max(0, d74);
ans += max(0, d24 * (d2 - 1));
ans += max(0, d14 * (d4 - 1));
ans += max(0, d4 * (d4 - 1) * (d2 - 2) / 2);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(101, 0);
for (int i = 2; i <= n; i++) {
int X = i;
for (int div = 2; div <= i; div++) {
int cnt = 0;
while (X % div == 0) {
cnt++;
X /= div;
}
d[div] += cnt;
}
}
int d2 = 0, d4 = 0, d14 = 0, d24 = 0, d74 = 0;
for (int i = 0; i < 76; i++) {
if (d[i] >= 2)
d2++;
if (d[i] >= 4)
d4++;
if (d[i] >= 14)
d14++;
if (d[i] >= 24)
d24++;
if (d[i] >= 74)
d74++;
}
int ans = 0;
ans += max(0, d74);
ans += max(0, d24 * (d2 - 1));
ans += max(0, d14 * (d4 - 1));
ans += max(0, d4 * (d4 - 1) * (d2 - 2) / 2);
cout << ans << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03213 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
const LL INF = 1 << 17;
LL dp[101][100];
int main() {
LL N;
cin >> N;
vector<LL> v(101, 0);
for (int i = 2; i <= N; i++) {
int t = i;
for (int j = 2; j <= N; j++) {
while (t % j == 0) {
v[j]++;
t /= j;
}
}
}
dp[0][1] = 1;
for (int i = 0; i <= N; i++) {
for (int j = 1; j <= 75; j++) {
for (int k = 0; k <= v[i]; k++) {
if (j * (k + 1) <= 75)
dp[i + 1][j * (k + 1)] += dp[i][j];
}
}
}
cout << dp[N + 1][75] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
const LL INF = 1 << 17;
LL dp[102][100];
int main() {
LL N;
cin >> N;
vector<LL> v(101, 0);
for (int i = 2; i <= N; i++) {
int t = i;
for (int j = 2; j <= N; j++) {
while (t % j == 0) {
v[j]++;
t /= j;
}
}
}
dp[0][1] = 1;
for (int i = 0; i <= N; i++) {
for (int j = 1; j <= 75; j++) {
for (int k = 0; k <= v[i]; k++) {
if (j * (k + 1) <= 75)
dp[i + 1][j * (k + 1)] += dp[i][j];
}
}
}
cout << dp[N + 1][75] << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03214 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (auto &e : v)
cin >> e;
double ave = 0;
for (auto &e : v)
ave += e;
ave = ave / n;
int argi = 0;
for (int i = 0; i < n; ++i) {
if (abs(v[i] - ave) < abs(v[argi] - ave))
i = argi;
}
cout << argi << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (auto &e : v)
cin >> e;
double ave = 0;
for (auto &e : v)
ave += e;
ave = ave / n;
int argi = 0;
for (int i = 0; i < n; ++i) {
if (abs(v[i] - ave) < abs(v[argi] - ave))
argi = i;
}
cout << argi << endl;
} | replace | 15 | 16 | 15 | 16 | TLE | |
p03215 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEBUG
#define debug prllf
#else
#define debug(...)
#endif
const ll maxn = 105;
ll b[maxn];
vector<ll> v;
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
for (ll i = 0; i < n; ++i) {
ll now = 0;
for (ll k = i; k < n; ++k) {
now += b[k];
v.push_back(now);
}
}
ll ans = 0;
for (ll i = 40; i >= 0; --i) {
ll now = ans | (1ll << i);
ll ret = 0;
for (ll j : v) {
if ((j & now) == now) {
ret++;
}
}
if (ret >= k) {
ans |= (1ll << i);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEBUG
#define debug prllf
#else
#define debug(...)
#endif
const ll maxn = 1005;
ll b[maxn];
vector<ll> v;
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
for (ll i = 0; i < n; ++i) {
ll now = 0;
for (ll k = i; k < n; ++k) {
now += b[k];
v.push_back(now);
}
}
ll ans = 0;
for (ll i = 40; i >= 0; --i) {
ll now = ans | (1ll << i);
ll ret = 0;
for (ll j : v) {
if ((j & now) == now) {
ret++;
}
}
if (ret >= k) {
ans |= (1ll << i);
}
}
cout << ans << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define rvc(i, S) for (int i = 0; i < (int)S.size(); ++i)
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define maxn 100020
#define ll long long
#define int long long
#define N 8000020
using namespace std;
int n, k;
int a[maxn];
int sum[maxn];
int cnt = 0;
int num[maxn];
bool tmp[maxn];
bool used[maxn];
signed main() {
cin >> n >> k;
rep(i, 1, n) {
scanf("%lld", &a[i]);
sum[i] += sum[i - 1] + a[i];
}
rep(i, 1, n) rep(j, i, n) num[++cnt] = sum[j] - sum[i - 1];
ll ans = 0;
rep(i, 1, cnt) used[i] = 1;
repd(i, 60, 0) {
ll tot = 0;
rep(j, 1, cnt) {
if ((num[j] & (1ll << i)) && (used[j]))
tot++;
}
if (tot >= k) {
ans += (1ll << i);
rep(j, 1, cnt) if (!(num[j] & (1ll << i))) used[j] = 0;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define rvc(i, S) for (int i = 0; i < (int)S.size(); ++i)
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define maxn 1000020
#define ll long long
#define int long long
#define N 8000020
using namespace std;
int n, k;
int a[maxn];
int sum[maxn];
int cnt = 0;
int num[maxn];
bool tmp[maxn];
bool used[maxn];
signed main() {
cin >> n >> k;
rep(i, 1, n) {
scanf("%lld", &a[i]);
sum[i] += sum[i - 1] + a[i];
}
rep(i, 1, n) rep(j, i, n) num[++cnt] = sum[j] - sum[i - 1];
ll ans = 0;
rep(i, 1, cnt) used[i] = 1;
repd(i, 60, 0) {
ll tot = 0;
rep(j, 1, cnt) {
if ((num[j] & (1ll << i)) && (used[j]))
tot++;
}
if (tot >= k) {
ans += (1ll << i);
rep(j, 1, cnt) if (!(num[j] & (1ll << i))) used[j] = 0;
}
}
cout << ans;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03215 | C++ | Runtime Error | #include <cstdio>
#define ll long long
using namespace std;
ll a[1010], sum[100010];
int n, m, cnt = 0;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 1; i <= n; i++) {
ll tot = 0;
for (int j = i; j <= n; j++)
tot += a[j], sum[++cnt] = tot;
}
ll ans = 0;
for (int j = 44; j >= 0; j--) {
int num = 0;
for (int i = 1; i <= cnt; i++)
if ((sum[i] >> j) & 1)
num++;
if (num >= m) {
ans |= (1ll << j);
for (int i = 1; i <= cnt; i++)
if (!((sum[i] >> j) & 1))
sum[i] = 0;
}
}
printf("%lld", ans);
return 0;
}
| #include <cstdio>
#define ll long long
using namespace std;
ll a[1010], sum[1000010];
int n, m, cnt = 0;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 1; i <= n; i++) {
ll tot = 0;
for (int j = i; j <= n; j++)
tot += a[j], sum[++cnt] = tot;
}
ll ans = 0;
for (int j = 44; j >= 0; j--) {
int num = 0;
for (int i = 1; i <= cnt; i++)
if ((sum[i] >> j) & 1)
num++;
if (num >= m) {
ans |= (1ll << j);
for (int i = 1; i <= cnt; i++)
if (!((sum[i] >> j) & 1))
sum[i] = 0;
}
}
printf("%lld", ans);
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> auto &operator<<(ostream &s, const vector<T> &v) {
s << "[";
bool a = 1;
for (auto e : v) {
s << (a ? "" : " ") << e;
a = 0;
}
s << "]";
return s;
}
template <typename T, typename U>
auto &operator<<(ostream &s, const pair<T, U> &p) {
s << "(" << p.first << "," << p.second << ")";
return s;
}
template <typename T> auto &operator<<(ostream &s, const set<T> &st) {
s << "{";
bool a = 1;
for (auto e : st) {
s << (a ? "" : " ") << e;
a = 0;
}
s << "}";
return s;
}
template <typename T, typename U>
auto &operator<<(ostream &s, const map<T, U> &m) {
s << "{";
bool a = 1;
for (auto e : m) {
s << (a ? "" : " ") << e.first << ":" << e.second;
a = 0;
}
s << "}";
return s;
}
#define DUMP(x) cout << #x << " = " << (x) << endl
#define COUT(x) \
cerr << #x << " = "; \
cout << (x) << endl
struct edge {
int to, cost;
};
const int INF = 1e18;
const int MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int K;
cin >> K;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> sum(n + 1);
for (int i = 0; i < n; i++) {
sum[i + 1] = sum[i] + a[i];
}
vector<int> b;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
b.push_back(sum[j + 1] - sum[i]);
}
}
int ans = 0;
for (int i = 12; i >= 0; i--) {
// DUMP(i);
sort(b.rbegin(), b.rend());
// DUMP(b);
if (b[K - 1] >> i & 1) {
ans |= 1LL << i;
// DUMP(ans);
vector<int> bn;
for (int j = 0; j < b.size() && b[j] >> i & 1; j++) {
bn.push_back(b[j]);
}
swap(bn, b);
} else {
for (int j = 0; b[j] >> i & 1; j++) {
b[j] &= ~(1LL << i);
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> auto &operator<<(ostream &s, const vector<T> &v) {
s << "[";
bool a = 1;
for (auto e : v) {
s << (a ? "" : " ") << e;
a = 0;
}
s << "]";
return s;
}
template <typename T, typename U>
auto &operator<<(ostream &s, const pair<T, U> &p) {
s << "(" << p.first << "," << p.second << ")";
return s;
}
template <typename T> auto &operator<<(ostream &s, const set<T> &st) {
s << "{";
bool a = 1;
for (auto e : st) {
s << (a ? "" : " ") << e;
a = 0;
}
s << "}";
return s;
}
template <typename T, typename U>
auto &operator<<(ostream &s, const map<T, U> &m) {
s << "{";
bool a = 1;
for (auto e : m) {
s << (a ? "" : " ") << e.first << ":" << e.second;
a = 0;
}
s << "}";
return s;
}
#define DUMP(x) cout << #x << " = " << (x) << endl
#define COUT(x) \
cerr << #x << " = "; \
cout << (x) << endl
struct edge {
int to, cost;
};
const int INF = 1e18;
const int MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int K;
cin >> K;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> sum(n + 1);
for (int i = 0; i < n; i++) {
sum[i + 1] = sum[i] + a[i];
}
vector<int> b;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
b.push_back(sum[j + 1] - sum[i]);
}
}
int ans = 0;
for (int i = 40; i >= 0; i--) {
// DUMP(i);
sort(b.rbegin(), b.rend());
// DUMP(b);
if (b[K - 1] >> i & 1) {
ans |= 1LL << i;
// DUMP(ans);
vector<int> bn;
for (int j = 0; j < b.size() && b[j] >> i & 1; j++) {
bn.push_back(b[j]);
}
swap(bn, b);
} else {
for (int j = 0; b[j] >> i & 1; j++) {
b[j] &= ~(1LL << i);
}
}
}
cout << ans << endl;
return 0;
}
| replace | 91 | 92 | 91 | 92 | 0 | |
p03215 | C++ | Runtime Error | #include <cstdio>
#define maxn 1010
typedef long long ll;
int a[maxn];
ll s[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
int t = 0;
for (int i = 1; i <= n; ++i) {
ll sum = 0;
for (int j = i; j <= n; ++j)
sum += a[j], s[++t] = sum;
}
ll ans = 0;
for (int i = 40; ~i; --i) {
int cnt = 0;
for (int j = 1; j <= t; ++j)
if (s[j] & (1ll << i))
++cnt;
if (cnt >= k) {
int nt = 0;
for (int j = 1; j <= t; ++j)
if (s[j] & (1ll << i))
s[++nt] = s[j];
t = nt;
ans |= 1ll << i;
}
}
printf("%lld\n", ans);
return 0;
} | #include <cstdio>
#define maxn 1010
typedef long long ll;
int a[maxn];
ll s[maxn * maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
int t = 0;
for (int i = 1; i <= n; ++i) {
ll sum = 0;
for (int j = i; j <= n; ++j)
sum += a[j], s[++t] = sum;
}
ll ans = 0;
for (int i = 40; ~i; --i) {
int cnt = 0;
for (int j = 1; j <= t; ++j)
if (s[j] & (1ll << i))
++cnt;
if (cnt >= k) {
int nt = 0;
for (int j = 1; j <= t; ++j)
if (s[j] & (1ll << i))
s[++nt] = s[j];
t = nt;
ans |= 1ll << i;
}
}
printf("%lld\n", ans);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
void judge(vector<ll> &p2, int exp, int K, ll ans) {
// cout << exp << " " << ans << endl;
vector<ll> p;
if (exp == 0) {
cout << ans << endl;
}
int x = 0;
int tmp = 0;
rep(j, p2.size()) {
if (p2[j] % (1ll << exp) >= (1ll << exp - 1)) {
tmp++;
p.push_back(p2[j]);
}
}
if (K <= tmp)
judge(p, exp - 1, K, ans + (1ll << exp - 1));
else
judge(p2, exp - 1, K, ans);
}
int main() {
cin.sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> p;
rep(i, N) {
ll tmp = 0;
rep(j, N) {
tmp += a[i + j];
p.push_back(tmp);
if (i + j == N - 1)
break;
}
}
judge(p, 40, K, 0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
void judge(vector<ll> &p2, int exp, int K, ll ans) {
// cout << exp << " " << ans << endl;
vector<ll> p;
if (exp == 0) {
cout << ans << endl;
return;
}
int x = 0;
int tmp = 0;
rep(j, p2.size()) {
if (p2[j] % (1ll << exp) >= (1ll << exp - 1)) {
tmp++;
p.push_back(p2[j]);
}
}
if (K <= tmp)
judge(p, exp - 1, K, ans + (1ll << exp - 1));
else
judge(p2, exp - 1, K, ans);
}
int main() {
cin.sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> p;
rep(i, N) {
ll tmp = 0;
rep(j, N) {
tmp += a[i + j];
p.push_back(tmp);
if (i + j == N - 1)
break;
}
}
judge(p, 40, K, 0);
return 0;
} | insert | 15 | 15 | 15 | 16 | -11 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const double PI = acos(-1.0);
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << setiosflags(ios::fixed);
ll n, k;
cin >> n >> k;
ll a[1010];
rep(i, n) cin >> a[i];
ll csum[1010];
csum[0] = 0;
rep(i, n) csum[i + 1] = csum[i] + a[i];
vector<ll> v;
rep(l, n + 1) REP(r, l + 1, n + 1) { v.push_back(csum[r] - csum[l]); }
bool usable[2010];
rep(i, 2010) usable[i] = true;
ll t = 1LL << 50;
ll ans = 0;
while (t != 0) {
ll cnt = 0;
vector<ll> unused;
rep(i, v.size()) {
if (!usable[i])
continue;
if ((v[i] % (t * 2)) / t == 1) {
cnt++;
} else {
unused.push_back(i);
}
}
if (cnt >= k) {
ans += t;
for (auto un : unused)
usable[un] = false;
}
t >>= 1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const double PI = acos(-1.0);
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << setiosflags(ios::fixed);
ll n, k;
cin >> n >> k;
ll a[1010];
rep(i, n) cin >> a[i];
ll csum[1010];
csum[0] = 0;
rep(i, n) csum[i + 1] = csum[i] + a[i];
vector<ll> v;
rep(l, n + 1) REP(r, l + 1, n + 1) { v.push_back(csum[r] - csum[l]); }
bool usable[1010 * 1010];
rep(i, 1010 * 1010) usable[i] = true;
ll t = 1LL << 50;
ll ans = 0;
while (t != 0) {
ll cnt = 0;
vector<ll> unused;
rep(i, v.size()) {
if (!usable[i])
continue;
if ((v[i] % (t * 2)) / t == 1) {
cnt++;
} else {
unused.push_back(i);
}
}
if (cnt >= k) {
ans += t;
for (auto un : unused)
usable[un] = false;
}
t >>= 1;
}
cout << ans << endl;
return 0;
}
| replace | 43 | 45 | 43 | 45 | 0 | |
p03215 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = (s); i < (t); ++i)
#define per(i, s, t) for (int i = ((t)-1); i >= s; --i)
#define repb(i, s, t) for (int i = (s); i <= (t); ++i)
#define lepb(i, s, t) for (int i = (s); i >= (t); --i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
#define mst(a, b) memset(a, b, sizeof(a))
#define dd(x) cout << #x << '=' << x << ' '
#define de(x) cout << #x << '=' << x << '\n'
#define fi first
#define se second
#define sq(x) ((x) * (x))
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const int inf = 0x3f3f3f3f;
const ll inff = 4557430888798830399ll;
const db eps = 1e-10;
const db pi = acos(-1.0);
const ll mod = 1e9 + 7;
#define maxn 1003
int a[maxn];
ll p[2][maxn * maxn];
int main() {
// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, k, z, c, cnt, dnt;
ll t, s;
scanf("%d%d", &n, &k);
repb(i, 1, n) scanf("%d", a + i);
cnt = 0;
repb(i, 1, n) {
t = 0;
repb(j, i, n) p[0][cnt++] = (t += a[j]);
}
for (z = 1, s = 0; (z << 1) <= p[0][n - 1]; z <<= 1)
;
for (int o = 0; z; z >>= 1, o ^= 1, cnt = dnt) {
dnt = 0;
c = 0;
rep(i, 0, cnt) if (p[o][i] & z) p[o ^ 1][dnt++] = p[o][i], c += 1;
if (c < k) {
rep(i, 0, cnt) if (!(p[o][i] & z)) p[o ^ 1][dnt++] = p[o][i];
} else
s |= z;
}
printf("%lld\n", s);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = (s); i < (t); ++i)
#define per(i, s, t) for (int i = ((t)-1); i >= s; --i)
#define repb(i, s, t) for (int i = (s); i <= (t); ++i)
#define lepb(i, s, t) for (int i = (s); i >= (t); --i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
#define mst(a, b) memset(a, b, sizeof(a))
#define dd(x) cout << #x << '=' << x << ' '
#define de(x) cout << #x << '=' << x << '\n'
#define fi first
#define se second
#define sq(x) ((x) * (x))
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const int inf = 0x3f3f3f3f;
const ll inff = 4557430888798830399ll;
const db eps = 1e-10;
const db pi = acos(-1.0);
const ll mod = 1e9 + 7;
#define maxn 1003
int a[maxn];
ll p[2][maxn * maxn];
int main() {
// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, k, c, cnt, dnt;
ll z, t, s;
scanf("%d%d", &n, &k);
repb(i, 1, n) scanf("%d", a + i);
cnt = 0;
repb(i, 1, n) {
t = 0;
repb(j, i, n) p[0][cnt++] = (t += a[j]);
}
for (z = 1, s = 0; (z << 1) <= p[0][n - 1]; z <<= 1)
;
for (int o = 0; z; z >>= 1, o ^= 1, cnt = dnt) {
dnt = 0;
c = 0;
rep(i, 0, cnt) if (p[o][i] & z) p[o ^ 1][dnt++] = p[o][i], c += 1;
if (c < k) {
rep(i, 0, cnt) if (!(p[o][i] & z)) p[o ^ 1][dnt++] = p[o][i];
} else
s |= z;
}
printf("%lld\n", s);
} | replace | 32 | 34 | 32 | 34 | TLE | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define INF 10000000000000009
#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, n) for (int i = 1; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define rollcall cout << "I'm Sucu." << endl;
#define YES(s) s ? cout << "YES" << endl : cout << "NO" << endl
#define Yes(s) s ? cout << "Yes" << endl : cout << "No" << endl
#define Taka(s) s ? cout << "Takahashi" << endl : cout << "Aoki" << endl
#define out(s, t, u) s ? cout << t << endl : cout << u << endl
#define int ll
#define Endl endl
signed main() {
int N, K;
int A[1004];
int B[1004];
int C[1004];
cin >> N >> K;
REP(i, N) {
cin >> A[i];
B[i + 1] = B[i] + A[i];
}
int c = 0;
REP(i, N + 1) {
REP(j, i) {
C[c] = B[i] - B[j];
c++;
}
}
sort(C, C + c, greater<>());
int L = (int)log2(C[K - 1]);
vector<int> D;
int E = (int)pow(2, L);
REP(i, c) {
if (E <= C[i]) {
D.push_back(C[i]);
} else {
break;
}
}
// cout << E << endl;
REP(j, L) {
E /= 2;
int cou = 0;
REP(i, D.size()) {
if ((D[i] / E) % 2 == 1)
cou++;
}
if (cou < K) {
continue;
}
REP(i, D.size()) {
if ((D[i] / E) % 2 == 0) {
D.erase(D.begin() + i);
i--;
}
}
}
int Ans = D[0];
REP(i, D.size()) { Ans = (Ans & D[i]); }
cout << Ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define INF 10000000000000009
#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, n) for (int i = 1; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define rollcall cout << "I'm Sucu." << endl;
#define YES(s) s ? cout << "YES" << endl : cout << "NO" << endl
#define Yes(s) s ? cout << "Yes" << endl : cout << "No" << endl
#define Taka(s) s ? cout << "Takahashi" << endl : cout << "Aoki" << endl
#define out(s, t, u) s ? cout << t << endl : cout << u << endl
#define int ll
#define Endl endl
signed main() {
int N, K;
int A[1004];
int B[1004];
int C[1114514];
cin >> N >> K;
REP(i, N) {
cin >> A[i];
B[i + 1] = B[i] + A[i];
}
int c = 0;
REP(i, N + 1) {
REP(j, i) {
C[c] = B[i] - B[j];
c++;
}
}
sort(C, C + c, greater<>());
int L = (int)log2(C[K - 1]);
vector<int> D;
int E = (int)pow(2, L);
REP(i, c) {
if (E <= C[i]) {
D.push_back(C[i]);
} else {
break;
}
}
// cout << E << endl;
REP(j, L) {
E /= 2;
int cou = 0;
REP(i, D.size()) {
if ((D[i] / E) % 2 == 1)
cou++;
}
if (cou < K) {
continue;
}
REP(i, D.size()) {
if ((D[i] / E) % 2 == 0) {
D.erase(D.begin() + i);
i--;
}
}
}
int Ans = D[0];
REP(i, D.size()) { Ans = (Ans & D[i]); }
cout << Ans << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p03215 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(10)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<int> sum(N);
REP(i, N) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<int> v;
REP(l, N) {
FOR(r, l + 1, N) { v.push_back(sum[r] - sum[l]); }
}
int ans = 0;
REV(i, 50, 0) {
int tmp = ans | (1LL << i);
int k = 0;
REP(j, v.size()) {
if ((v[j] & tmp) == tmp) {
k++;
}
}
if (k >= K) {
ans = tmp;
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(10)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<int> sum(N + 1);
REP(i, N) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<int> v;
REP(l, N) {
FOR(r, l + 1, N) { v.push_back(sum[r] - sum[l]); }
}
int ans = 0;
REV(i, 50, 0) {
int tmp = ans | (1LL << i);
int k = 0;
REP(j, v.size()) {
if ((v[j] & tmp) == tmp) {
k++;
}
}
if (k >= K) {
ans = tmp;
}
}
cout << ans << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n) \
cout << #a << ":"; \
rep(pachico, n) cout << " " << a[pachico]; \
cout << endl
#define svec(v) \
cout << #v << ":"; \
rep(pachico, v.size()) cout << " " << v[pachico]; \
cout << endl
#define svecp(v) \
cout << #v << ":"; \
each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second \
<< "}"; \
cout << endl
#define sset(s) \
cout << #s << ":"; \
each(pachico, s) cout << " " << pachico; \
cout << endl
#define smap(m) \
cout << #m << ":"; \
each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second \
<< "}"; \
cout << endl
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 1000005;
bool ok[MAX_N], nok[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
vl a(n), sm(n);
vl vec;
rep(i, n) {
cin >> a[i];
sm[i + 1] = sm[i] + a[i];
}
rep(i, n) {
srep(j, i + 1, n + 1) { vec.pb(sm[j] - sm[i]); }
}
rep(i, len(vec)) { ok[i] = true; }
ll ans = 0;
rrep(i, 60) {
rep(j, len(vec)) { nok[j] = false; }
int cnt = 0;
rep(j, len(vec)) {
if (ok[j]) {
if ((vec[j] >> i) & 1LL) {
cnt++;
nok[j] = true;
}
}
}
if (cnt >= K) {
// show(i);
rep(j, len(vec)) { ok[j] = nok[j]; }
ans += (1LL << i);
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n) \
cout << #a << ":"; \
rep(pachico, n) cout << " " << a[pachico]; \
cout << endl
#define svec(v) \
cout << #v << ":"; \
rep(pachico, v.size()) cout << " " << v[pachico]; \
cout << endl
#define svecp(v) \
cout << #v << ":"; \
each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second \
<< "}"; \
cout << endl
#define sset(s) \
cout << #s << ":"; \
each(pachico, s) cout << " " << pachico; \
cout << endl
#define smap(m) \
cout << #m << ":"; \
each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second \
<< "}"; \
cout << endl
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 1000005;
bool ok[MAX_N], nok[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
vl a(n), sm(n + 1);
vl vec;
rep(i, n) {
cin >> a[i];
sm[i + 1] = sm[i] + a[i];
}
rep(i, n) {
srep(j, i + 1, n + 1) { vec.pb(sm[j] - sm[i]); }
}
rep(i, len(vec)) { ok[i] = true; }
ll ans = 0;
rrep(i, 60) {
rep(j, len(vec)) { nok[j] = false; }
int cnt = 0;
rep(j, len(vec)) {
if (ok[j]) {
if ((vec[j] >> i) & 1LL) {
cnt++;
nok[j] = true;
}
}
}
if (cnt >= K) {
// show(i);
rep(j, len(vec)) { ok[j] = nok[j]; }
ans += (1LL << i);
}
}
cout << ans << "\n";
return 0;
} | replace | 63 | 64 | 63 | 64 | 0 | |
p03215 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
typedef long long int LL;
LL sum[1005];
LL t[100005];
bool con[100005]; // concern
int main() {
LL n, m, p;
int i, j, k;
LL s = 0;
LL a, b;
memset(con, true, sizeof(con));
cin >> n >> m;
p = n * (n + 1) / 2;
for (i = 0; i < n; i++) {
cin >> a;
sum[i + 1] = sum[i] + a;
}
for (i = 0, k = 0; i < n; i++) {
for (j = i; j < n; j++) {
t[k++] = sum[j + 1] - sum[i];
}
}
for (i = 40; i >= 0; i--) {
a = (LL)1 << i;
for (j = 0, k = 0; j < p; j++) {
if (con[j] && (t[j] & a)) {
k++;
}
}
if (k >= m) {
s += a;
for (j = 0; j < p; j++) {
if ((t[j] & a) == 0)
con[j] = false;
}
}
}
cout << s << endl;
}
| #include <cstring>
#include <iostream>
using namespace std;
typedef long long int LL;
LL sum[1005];
LL t[1000005];
bool con[1000005]; // concern
int main() {
LL n, m, p;
int i, j, k;
LL s = 0;
LL a, b;
memset(con, true, sizeof(con));
cin >> n >> m;
p = n * (n + 1) / 2;
for (i = 0; i < n; i++) {
cin >> a;
sum[i + 1] = sum[i] + a;
}
for (i = 0, k = 0; i < n; i++) {
for (j = i; j < n; j++) {
t[k++] = sum[j + 1] - sum[i];
}
}
for (i = 40; i >= 0; i--) {
a = (LL)1 << i;
for (j = 0, k = 0; j < p; j++) {
if (con[j] && (t[j] & a)) {
k++;
}
}
if (k >= m) {
s += a;
for (j = 0; j < p; j++) {
if ((t[j] & a) == 0)
con[j] = false;
}
}
}
cout << s << endl;
}
| replace | 5 | 7 | 5 | 7 | 0 | |
p03215 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
unsigned long sums[500050];
void solve() {
int N, K;
cin >> N >> K;
vector<unsigned long> imos(N + 1);
for (int i = 0; i < N; i++) {
long a;
cin >> a;
imos[i + 1] = a + imos[i];
}
unsigned long ans = 0;
for (int l = 0; l < N; l++)
for (int r = l + 1; r <= N; r++) {
sums[N * l + r - l] = imos[r] - imos[l];
}
unsigned long b = 1ULL << 60;
while (b > 0) {
int cnt = 0;
for (auto s : sums) {
cnt += ((ans + b) & s) == ans + b;
}
if (cnt >= K)
ans += b;
b >>= 1;
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
unsigned long sums[5000050];
void solve() {
int N, K;
cin >> N >> K;
vector<unsigned long> imos(N + 1);
for (int i = 0; i < N; i++) {
long a;
cin >> a;
imos[i + 1] = a + imos[i];
}
unsigned long ans = 0;
for (int l = 0; l < N; l++)
for (int r = l + 1; r <= N; r++) {
sums[N * l + r - l] = imos[r] - imos[l];
}
unsigned long b = 1ULL << 60;
while (b > 0) {
int cnt = 0;
for (auto s : sums) {
cnt += ((ans + b) & s) == ans + b;
}
if (cnt >= K)
ans += b;
b >>= 1;
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03215 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
signed main() {
int a, b;
cin >> a >> b;
V<int> c(a);
fo(i, a) { cin >> c[i]; }
V<int> d(a + 1);
d[0] = 0;
d[1] = c[0];
fo(i, a - 1) { d[i + 2] = d[i + 1] + c[i + 1]; }
V<int> e;
fo(i, a) {
for (int j = i + 1; j <= a; j++) {
e.pb(d[j] - d[i]);
}
}
Sort(e);
rev(e);
int g = e[0];
int h = 0;
while (g) {
g /= 2;
h++;
}
V<string> f(e.sz);
fo(i, e.sz) {
fo(j, h) {
f[i] += '0' + e[i] % 2;
e[i] /= 2;
}
}
int m = 0;
for (int i = h - 1; i >= 0; i--) {
int n = 0;
fo(j, f.sz) {
if (f[j][i] == '1')
n++;
}
if (n >= b) {
m += pow(2, i);
V<string> o;
fo(j, e.sz) {
if (f[j][i] == '1')
o.pb(f[j]);
}
f = o;
}
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
signed main() {
int a, b;
cin >> a >> b;
V<int> c(a);
fo(i, a) { cin >> c[i]; }
V<int> d(a + 1);
d[0] = 0;
d[1] = c[0];
fo(i, a - 1) { d[i + 2] = d[i + 1] + c[i + 1]; }
V<int> e;
fo(i, a) {
for (int j = i + 1; j <= a; j++) {
e.pb(d[j] - d[i]);
}
}
Sort(e);
rev(e);
int g = e[0];
int h = 0;
while (g) {
g /= 2;
h++;
}
V<string> f(e.sz);
fo(i, e.sz) {
fo(j, h) {
f[i] += '0' + e[i] % 2;
e[i] /= 2;
}
}
int m = 0;
for (int i = h - 1; i >= 0; i--) {
int n = 0;
fo(j, f.sz) {
if (f[j][i] == '1')
n++;
}
if (n >= b) {
m += pow(2, i);
V<string> o;
fo(j, f.sz) {
if (f[j][i] == '1')
o.pb(f[j]);
}
f = o;
}
}
cout << m << endl;
} | replace | 470 | 471 | 470 | 471 | 0 | |
p03215 | C++ | Runtime Error | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n, k;
cin >> n >> k;
vll csum(n, 0);
rep(i, n) {
ll a;
cin >> a;
csum[i + 1] = csum[i] + a;
}
vll bs;
repLRE(i, 0, n - 1) {
repLRE(j, i + 1, n) { bs.push_back(csum[j] - csum[i]); }
}
ll const blmax = 50;
rrepLRE(i, blmax, 0) {
vll nxt;
rep(j, (ll)bs.size()) {
if (bs[j] >> i & 1)
nxt.push_back(bs[j]);
}
if (k <= (ll)nxt.size())
bs = nxt;
}
ll ans = (1LL << blmax) - 1;
rep(i, (ll)bs.size()) ans &= bs[i];
cout << ans << endl;
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n, k;
cin >> n >> k;
vll csum(n + 1, 0);
rep(i, n) {
ll a;
cin >> a;
csum[i + 1] = csum[i] + a;
}
vll bs;
repLRE(i, 0, n - 1) {
repLRE(j, i + 1, n) { bs.push_back(csum[j] - csum[i]); }
}
ll const blmax = 50;
rrepLRE(i, blmax, 0) {
vll nxt;
rep(j, (ll)bs.size()) {
if (bs[j] >> i & 1)
nxt.push_back(bs[j]);
}
if (k <= (ll)nxt.size())
bs = nxt;
}
ll ans = (1LL << blmax) - 1;
rep(i, (ll)bs.size()) ans &= bs[i];
cout << ans << endl;
return 0;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p03215 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932; // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod
bool unused[252525];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<ll> val;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= n - i; ++j) {
val.push_back(sum[i + j] - sum[i]);
}
}
ll ans = 0;
int sz = val.size();
for (int d = 40; d >= 0; --d) {
int cnt = 0;
for (int i = 0; i < sz; ++i) {
if (unused[i])
continue;
if ((val[i] >> d) & 1)
++cnt;
}
if (cnt < k)
continue;
ans += (1ll << d);
for (int i = 0; i < sz; ++i) {
if (unused[i])
continue;
if ((val[i] >> d) & 1)
continue;
unused[i] = true;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932; // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod
bool unused[2525252];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<ll> val;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= n - i; ++j) {
val.push_back(sum[i + j] - sum[i]);
}
}
ll ans = 0;
int sz = val.size();
for (int d = 40; d >= 0; --d) {
int cnt = 0;
for (int i = 0; i < sz; ++i) {
if (unused[i])
continue;
if ((val[i] >> d) & 1)
++cnt;
}
if (cnt < k)
continue;
ans += (1ll << d);
for (int i = 0; i < sz; ++i) {
if (unused[i])
continue;
if ((val[i] >> d) & 1)
continue;
unused[i] = true;
}
}
cout << ans << endl;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define endl '\n'
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.end()
#define show(x) cout << (#x) << " is " << (x) << endl
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef vector<vector<int>> matrix;
const ll INF = 1e18 + 123;
const ld EPS = 1e-9;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 5e5 + 123;
const int M = 1e6 + 123;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
char s[N];
int main() {
int n, q, k;
scanf("%d", &n);
scanf("%s", s);
scanf("%d", &q);
while (q--) {
scanf("%d", &k);
ll ans = 0;
ll d = 0, m = 0, cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'D') {
d++;
}
if (s[i] == 'M') {
m += d;
cnt++;
}
if (s[i] == 'C') {
ans += m;
}
}
for (int i = k; i < n; i++) {
if (s[i - k] == 'D') {
m -= cnt;
d--;
}
if (s[i - k] == 'M') {
cnt--;
}
if (s[i] == 'D') {
d++;
}
if (s[i] == 'M') {
m += d;
cnt++;
}
if (s[i] == 'C') {
ans += m;
}
}
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define endl '\n'
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.end()
#define show(x) cout << (#x) << " is " << (x) << endl
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef vector<vector<int>> matrix;
const ll INF = 1e18 + 123;
const ld EPS = 1e-9;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 5e5 + 123;
const int M = 1e6 + 123;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
char s[M];
int main() {
int n, q, k;
scanf("%d", &n);
scanf("%s", s);
scanf("%d", &q);
while (q--) {
scanf("%d", &k);
ll ans = 0;
ll d = 0, m = 0, cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'D') {
d++;
}
if (s[i] == 'M') {
m += d;
cnt++;
}
if (s[i] == 'C') {
ans += m;
}
}
for (int i = k; i < n; i++) {
if (s[i - k] == 'D') {
m -= cnt;
d--;
}
if (s[i - k] == 'M') {
cnt--;
}
if (s[i] == 'D') {
d++;
}
if (s[i] == 'M') {
m += d;
cnt++;
}
if (s[i] == 'C') {
ans += m;
}
}
printf("%lld\n", ans);
}
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define rrep1(i, n) for (int i = n; i >= 1; --i)
#define range(i, l, r) for (int i = l; i < (int)r; ++i)
#define rrange(i, l, r) for (int i = (int)r - 1; i >= (int)l; --i)
#define unless(a) if (!(a))
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using ld = long double;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int mod = TEN(9) + 7;
const int inf = TEN(18) * 3 + 10;
int N, Q;
string S;
int calc(int k) {
int ans = 0;
int cur = 0;
int m = 0, c = 0;
range(i, 0, k - 1) {
if (S[i] == 'M') {
m++;
}
if (S[i] == 'C') {
c++;
cur += m;
}
}
/*
printf("initial: cur = %lld\n", cur);
printf("[0, %lld]: m = %lld, c = %lld\n", k - 2, m, c);
*/
range(i, 1, N) {
if (S[i - 1] == 'C') {
c--;
}
if (S[i - 1] == 'M') {
cur -= c;
m--;
}
if (S[i + k - 2] == 'C') {
cur += m;
c++;
}
if (S[i + k - 2] == 'M') {
m++;
}
if (S[i - 1] == 'D') {
ans += cur;
// printf("i = %lld, ans += %lld\n", i, cur);
}
// printf("[%lld, %lld]: m = %lld, c = %lld\n", i, i + k - 2, m, c);
}
// puts("");
return ans;
}
signed main() {
cin >> N >> S >> Q;
rep(i, 200000) S += ' ';
rep(_, Q) {
int k;
cin >> k;
cout << calc(k) << endl;
// calc(k);
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define rrep1(i, n) for (int i = n; i >= 1; --i)
#define range(i, l, r) for (int i = l; i < (int)r; ++i)
#define rrange(i, l, r) for (int i = (int)r - 1; i >= (int)l; --i)
#define unless(a) if (!(a))
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using ld = long double;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int mod = TEN(9) + 7;
const int inf = TEN(18) * 3 + 10;
int N, Q;
string S;
int calc(int k) {
int ans = 0;
int cur = 0;
int m = 0, c = 0;
range(i, 0, k - 1) {
if (S[i] == 'M') {
m++;
}
if (S[i] == 'C') {
c++;
cur += m;
}
}
/*
printf("initial: cur = %lld\n", cur);
printf("[0, %lld]: m = %lld, c = %lld\n", k - 2, m, c);
*/
range(i, 1, N) {
if (S[i - 1] == 'C') {
c--;
}
if (S[i - 1] == 'M') {
cur -= c;
m--;
}
if (S[i + k - 2] == 'C') {
cur += m;
c++;
}
if (S[i + k - 2] == 'M') {
m++;
}
if (S[i - 1] == 'D') {
ans += cur;
// printf("i = %lld, ans += %lld\n", i, cur);
}
// printf("[%lld, %lld]: m = %lld, c = %lld\n", i, i + k - 2, m, c);
}
// puts("");
return ans;
}
signed main() {
cin >> N >> S >> Q;
rep(i, N + 5) S += ' ';
rep(_, Q) {
int k;
cin >> k;
cout << calc(k) << endl;
// calc(k);
}
}
| replace | 100 | 101 | 100 | 101 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll mod = 1e9 + 7;
const double PI = acos(-1.0);
vector<ll> dm(100001);
vector<ll> d(100001);
vector<ll> m(100001);
// return dm (s, e]
ll dm2(int s, int e) { return dm[e] - dm[s] - (d[s] * (m[e] - m[s])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
rep(i, n) {
dm[i + 1] = dm[i];
d[i + 1] = d[i];
m[i + 1] = m[i];
if (s[i] == 'D') {
d[i + 1] += 1;
} else if (s[i] == 'M') {
dm[i + 1] += d[i];
m[i + 1] += 1;
}
// debug(d[i]);debug(m[i]);debugln(dm[i]);
}
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0;
for (int i = 2; i <= n; i++) {
if (s[i - 1] == 'C') {
int s = max(0, i - k);
// debug(s);debug(i-1);debugln(dm2(s,i-1));
ans += dm2(s, i - 1);
}
}
cout << ans << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll mod = 1e9 + 7;
const double PI = acos(-1.0);
vector<ll> dm(1000001);
vector<ll> d(1000001);
vector<ll> m(1000001);
// return dm (s, e]
ll dm2(int s, int e) { return dm[e] - dm[s] - (d[s] * (m[e] - m[s])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
rep(i, n) {
dm[i + 1] = dm[i];
d[i + 1] = d[i];
m[i + 1] = m[i];
if (s[i] == 'D') {
d[i + 1] += 1;
} else if (s[i] == 'M') {
dm[i + 1] += d[i];
m[i + 1] += 1;
}
// debug(d[i]);debug(m[i]);debugln(dm[i]);
}
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0;
for (int i = 2; i <= n; i++) {
if (s[i - 1] == 'C') {
int s = max(0, i - k);
// debug(s);debug(i-1);debugln(dm2(s,i-1));
ans += dm2(s, i - 1);
}
}
cout << ans << endl;
}
}
| replace | 45 | 48 | 45 | 48 | 0 | |
p03216 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
int n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i < n; ++i)
s = s + "*";
n *= 2;
vector<ll> prefM(n), prefC(n);
for (int i = 0; i < n; ++i) {
prefM[i] = 0;
if (s[i] == 'M')
++prefM[i];
if (i - 1 >= 0)
prefM[i] += prefM[i - 1];
}
for (int i = 0; i < n; ++i) {
prefC[i] = 0;
if (s[i] == 'C')
++prefC[i];
if (i - 1 >= 0)
prefC[i] += prefC[i - 1];
}
for (int i = 0; i < q; ++i) {
int k;
cin >> k;
--k;
ll odp = 0;
vector<ll> ilMC(n);
ilMC[0] = 0;
for (int j = 0; j < k - 1; ++j)
if (s[j] == 'M')
ilMC[0] += prefC[k - 1] - prefC[j];
for (int j = 1; j + k - 1 < n; ++j) {
if (s[j] == '*')
break;
ilMC[j] = ilMC[j - 1];
if (s[j - 1] == 'M')
ilMC[j] -= prefC[j + k - 2] - prefC[j - 1];
if (s[j + k - 1] == 'C')
ilMC[j] += prefM[j + k - 2] - prefM[j - 1];
}
++k;
for (int j = 0; j + k - 1 < n; ++j) {
if (s[j] == '*')
break;
if (s[j] == 'D')
odp += ilMC[j + 1];
}
cout << odp << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
int n, q;
string s;
cin >> n >> s >> q;
string g(n, '*');
s = s + g;
n *= 2;
vector<ll> prefM(n), prefC(n);
for (int i = 0; i < n; ++i) {
prefM[i] = 0;
if (s[i] == 'M')
++prefM[i];
if (i - 1 >= 0)
prefM[i] += prefM[i - 1];
}
for (int i = 0; i < n; ++i) {
prefC[i] = 0;
if (s[i] == 'C')
++prefC[i];
if (i - 1 >= 0)
prefC[i] += prefC[i - 1];
}
for (int i = 0; i < q; ++i) {
int k;
cin >> k;
--k;
ll odp = 0;
vector<ll> ilMC(n);
ilMC[0] = 0;
for (int j = 0; j < k - 1; ++j)
if (s[j] == 'M')
ilMC[0] += prefC[k - 1] - prefC[j];
for (int j = 1; j + k - 1 < n; ++j) {
if (s[j] == '*')
break;
ilMC[j] = ilMC[j - 1];
if (s[j - 1] == 'M')
ilMC[j] -= prefC[j + k - 2] - prefC[j - 1];
if (s[j + k - 1] == 'C')
ilMC[j] += prefM[j + k - 2] - prefM[j - 1];
}
++k;
for (int j = 0; j + k - 1 < n; ++j) {
if (s[j] == '*')
break;
if (s[j] == 'D')
odp += ilMC[j + 1];
}
cout << odp << endl;
}
return 0;
}
| replace | 12 | 14 | 12 | 14 | TLE | |
p03216 | C++ | Runtime Error | #include "bits/stdc++.h"
#define int long long
#define fi first
#define se second
using namespace std;
const long long INF = 1e18;
const long long MD = 1e9 + 7;
int n;
string s;
int a[1000006], pref[100006][4], dp[100006][4];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
cin >> s;
cin >> n;
vector<int> k;
for (int i = 0; i < n; i++) {
int n1;
cin >> n1;
k.push_back(n1);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'D') {
a[i] = 1;
} else if (s[i] == 'M') {
a[i] = 2;
} else if (s[i] == 'C') {
a[i] = 3;
} else
a[i] = 0;
}
/*cout<<"OK"<<endl;
cout<<s.size()<<endl;
*/
for (int i = 0; i < s.size(); i++) {
if (a[i] == 0 && i != 0) {
pref[i][1] += pref[i - 1][1];
pref[i][2] += pref[i - 1][2];
continue;
}
pref[i][a[i]]++;
if (i != 0) {
pref[i][1] += pref[i - 1][1];
pref[i][2] += pref[i - 1][2];
}
}
for (int i = 0; i < s.size(); i++) {
if (a[i] == 1)
dp[i][1]++;
if (a[i] == 2 && i != 0)
dp[i][2] += dp[i - 1][1];
if (a[i] == 3 && i != 0)
dp[i][3] += dp[i - 1][2];
if (i != 0) {
dp[i][1] += dp[i - 1][1];
dp[i][2] += dp[i - 1][2];
dp[i][3] += dp[i - 1][3];
}
}
for (auto kk : k) {
int ans = 0;
for (int i = kk; i < s.size(); i++) {
if (a[i] == 3 && i != 0) {
int p1 = pref[i - 1][2] - pref[i - kk][2];
int D = pref[i - kk][1];
// cout << p1 << " " << D << endl;
ans += dp[i - kk][2] + D * p1;
}
}
// cout<<ans<<endl;
cout << dp[s.size() - 1][3] - ans << endl;
}
} | #include "bits/stdc++.h"
#define int long long
#define fi first
#define se second
using namespace std;
const long long INF = 1e18;
const long long MD = 1e9 + 7;
int n;
string s;
int a[1000006], pref[1000006][4], dp[1000006][4];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
cin >> s;
cin >> n;
vector<int> k;
for (int i = 0; i < n; i++) {
int n1;
cin >> n1;
k.push_back(n1);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'D') {
a[i] = 1;
} else if (s[i] == 'M') {
a[i] = 2;
} else if (s[i] == 'C') {
a[i] = 3;
} else
a[i] = 0;
}
/*cout<<"OK"<<endl;
cout<<s.size()<<endl;
*/
for (int i = 0; i < s.size(); i++) {
if (a[i] == 0 && i != 0) {
pref[i][1] += pref[i - 1][1];
pref[i][2] += pref[i - 1][2];
continue;
}
pref[i][a[i]]++;
if (i != 0) {
pref[i][1] += pref[i - 1][1];
pref[i][2] += pref[i - 1][2];
}
}
for (int i = 0; i < s.size(); i++) {
if (a[i] == 1)
dp[i][1]++;
if (a[i] == 2 && i != 0)
dp[i][2] += dp[i - 1][1];
if (a[i] == 3 && i != 0)
dp[i][3] += dp[i - 1][2];
if (i != 0) {
dp[i][1] += dp[i - 1][1];
dp[i][2] += dp[i - 1][2];
dp[i][3] += dp[i - 1][3];
}
}
for (auto kk : k) {
int ans = 0;
for (int i = kk; i < s.size(); i++) {
if (a[i] == 3 && i != 0) {
int p1 = pref[i - 1][2] - pref[i - kk][2];
int D = pref[i - kk][1];
// cout << p1 << " " << D << endl;
ans += dp[i - kk][2] + D * p1;
}
}
// cout<<ans<<endl;
cout << dp[s.size() - 1][3] - ans << endl;
}
} | replace | 9 | 10 | 9 | 10 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
lin n;
string s;
lin q;
void solve(lin k) {
queue<lin> d;
queue<lin> m;
lin ad = 0;
lin res = 0;
rep(i, s.length()) {
if (d.size() > 0) {
if (i - d.front() >= k) {
d.pop();
ad -= m.size();
if (d.size() > 0) {
while (m.size() >= 0 && d.front() > m.front()) {
m.pop();
}
} else {
while (m.size() > 0) {
m.pop();
}
}
}
}
if (s[i] == 'D') {
d.push(i);
} else if (s[i] == 'M') {
if (d.size() > 0) {
m.push(i);
ad += d.size();
}
} else if (s[i] == 'C') {
res += ad;
}
}
cout << res << endl;
}
int main(void) {
lin k[76];
cin >> n >> s >> q;
rep(i, q) {
cin >> k[i];
solve(k[i]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
lin n;
string s;
lin q;
void solve(lin k) {
queue<lin> d;
queue<lin> m;
lin ad = 0;
lin res = 0;
rep(i, s.length()) {
if (d.size() > 0) {
if (i - d.front() >= k) {
d.pop();
ad -= m.size();
if (d.size() > 0) {
while (m.size() > 0 && d.front() > m.front()) {
m.pop();
}
} else {
while (m.size() > 0) {
m.pop();
}
}
}
}
if (s[i] == 'D') {
d.push(i);
} else if (s[i] == 'M') {
if (d.size() > 0) {
m.push(i);
ad += d.size();
}
} else if (s[i] == 'C') {
res += ad;
}
}
cout << res << endl;
}
int main(void) {
lin k[76];
cin >> n >> s >> q;
rep(i, q) {
cin >> k[i];
solve(k[i]);
}
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
// 参考: http://kmjp.hatenablog.jp/entry/2018/11/26/0900
ll m[123456];
ll c[123456];
ll mc[123456];
int main() {
int n;
string s;
int q;
cin >> n >> s >> q;
rep(i, n) {
if (s[i] == 'M')
m[i]++;
if (s[i] == 'C')
c[i]++;
}
rep(i, n) {
m[i + 1] += m[i];
c[i + 1] += c[i];
}
rep(i, n) {
if (s[i] == 'C') {
mc[i] = m[i];
}
}
rep(i, n) { mc[i + 1] += mc[i]; }
while (q--) {
int k;
cin >> k;
k--;
ll ans = 0;
rep(i, n) {
if (s[i] == 'D') {
int pos = min(n, i + k);
ans += mc[pos] - mc[i] - m[i] * (c[pos] - c[i]);
}
}
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
// 参考: http://kmjp.hatenablog.jp/entry/2018/11/26/0900
ll m[1234567];
ll c[1234567];
ll mc[1234567];
int main() {
int n;
string s;
int q;
cin >> n >> s >> q;
rep(i, n) {
if (s[i] == 'M')
m[i]++;
if (s[i] == 'C')
c[i]++;
}
rep(i, n) {
m[i + 1] += m[i];
c[i + 1] += c[i];
}
rep(i, n) {
if (s[i] == 'C') {
mc[i] = m[i];
}
}
rep(i, n) { mc[i + 1] += mc[i]; }
while (q--) {
int k;
cin >> k;
k--;
ll ans = 0;
rep(i, n) {
if (s[i] == 'D') {
int pos = min(n, i + k);
ans += mc[pos] - mc[i] - m[i] * (c[pos] - c[i]);
}
}
cout << ans << endl;
}
return 0;
} | replace | 29 | 32 | 29 | 32 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long i64;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::string s;
cin >> s;
int q;
scanf("%d", &q);
std::vector<i64> sum(n + 1, 0);
std::vector<int> latte;
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + (s[i] == 'M');
for (int i = 0; i < n; i++)
if (s[i] == 'D')
latte.push_back(i);
while (q--) {
int k;
scanf("%d", &k);
i64 ans = 0, tmp = 0, c = 0, size = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'D') {
tmp += sum[i + 1];
size++;
} else if (s[i] == 'C') {
while (latte[c] < i and i - latte[c] >= k) {
tmp -= sum[latte[c++] + 1];
size--;
}
ans += size * sum[i + 1] - tmp;
}
}
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
typedef long long i64;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::string s;
cin >> s;
int q;
scanf("%d", &q);
std::vector<i64> sum(n + 1, 0);
std::vector<int> latte;
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + (s[i] == 'M');
for (int i = 0; i < n; i++)
if (s[i] == 'D')
latte.push_back(i);
while (q--) {
int k;
scanf("%d", &k);
i64 ans = 0, tmp = 0, c = 0, size = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'D') {
tmp += sum[i + 1];
size++;
} else if (s[i] == 'C') {
while (c < latte.size() and latte[c] < i and i - latte[c] >= k) {
tmp -= sum[latte[c++] + 1];
size--;
}
ans += size * sum[i + 1] - tmp;
}
}
printf("%lld\n", ans);
}
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
template <typename T> struct bit1 {
T add(T x, T y) { return x + y; }
int n;
vector<T> t;
void init(int n) {
this->n = n;
t.resize(n + 10);
}
T qry(int i) {
T res = 0;
for (; i > 0; i -= i & -i)
res = add(res, t[i]);
return res;
}
void upd(int i, T dx) {
assert(i >= 1 && i <= n);
for (; i <= n; i += i & -i)
t[i] = add(t[i], dx);
}
T get(int i) { return qry(i) - qry(i - 1); }
};
int n; // 1e6
string s;
ll brute(int k) {
ll res = 0;
for (int a = 1; a <= n; a++) {
for (int b = a + 1; b <= n; b++) {
for (int c = b + 1; c <= n; c++) {
if (c - a < k && s[a] == 'D' && s[b] == 'M' && s[c] == 'C') {
res++;
}
}
}
}
return res;
}
ll solve(int k) {
bit1<ll> bit;
bit.init(n);
ll res = 0;
auto inc = [&](int i) {
bit.upd(1, 1);
bit.upd(i + 1, -1);
};
auto get = [&](int i) { return bit.qry(i); };
deque<int> D;
ll sum = 0;
for (int i = 1; i <= n; i++) {
while (!D.empty() && i - D.front() >= k) {
sum -= get(D.front());
D.pop_front();
}
if (s[i] == 'D') {
D.push_back(i);
}
if (s[i] == 'M') {
inc(i);
sum += D.size();
}
if (s[i] == 'C') {
res += sum;
}
}
return res;
}
int q; // 75
vector<int> k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
cin >> s;
s = "*" + s;
cin >> q;
k.resize(q);
for (int i = 0; i < q; i++) {
cin >> k[i];
}
for (int i : k) {
// assert(solve(i) == brute(i));
cout << solve(i) << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
template <typename T> struct bit1 {
T add(T x, T y) { return x + y; }
int n;
vector<T> t;
void init(int n) {
this->n = n;
t.resize(n + 10);
}
T qry(int i) {
T res = 0;
for (; i > 0; i -= i & -i)
res = add(res, t[i]);
return res;
}
void upd(int i, T dx) {
assert(i >= 1 && i <= n);
for (; i <= n; i += i & -i)
t[i] = add(t[i], dx);
}
T get(int i) { return qry(i) - qry(i - 1); }
};
int n; // 1e6
string s;
ll brute(int k) {
ll res = 0;
for (int a = 1; a <= n; a++) {
for (int b = a + 1; b <= n; b++) {
for (int c = b + 1; c <= n; c++) {
if (c - a < k && s[a] == 'D' && s[b] == 'M' && s[c] == 'C') {
res++;
}
}
}
}
return res;
}
ll solve(int k) {
bit1<ll> bit;
bit.init(n + 10);
ll res = 0;
auto inc = [&](int i) {
bit.upd(1, 1);
bit.upd(i + 1, -1);
};
auto get = [&](int i) { return bit.qry(i); };
deque<int> D;
ll sum = 0;
for (int i = 1; i <= n; i++) {
while (!D.empty() && i - D.front() >= k) {
sum -= get(D.front());
D.pop_front();
}
if (s[i] == 'D') {
D.push_back(i);
}
if (s[i] == 'M') {
inc(i);
sum += D.size();
}
if (s[i] == 'C') {
res += sum;
}
}
return res;
}
int q; // 75
vector<int> k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
cin >> s;
s = "*" + s;
cin >> q;
k.resize(q);
for (int i = 0; i < q; i++) {
cin >> k[i];
}
for (int i : k) {
// assert(solve(i) == brute(i));
cout << solve(i) << "\n";
}
return 0;
}
| replace | 56 | 57 | 56 | 57 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll d = 0, m = 0, dm = 0, dmc = 0;
rep(i, n) {
if (i < k) {
if (s[i - k] == 'D') {
d--;
dm -= m;
} else if (s[i - k] == 'M')
m--;
}
if (s[i] == 'D')
d++;
else if (s[i] == 'M') {
dm += d;
m++;
} else if (s[i] == 'C')
dmc += dm;
}
cout << dmc << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll d = 0, m = 0, dm = 0, dmc = 0;
rep(i, n) {
if (i >= k) {
if (s[i - k] == 'D') {
d--;
dm -= m;
} else if (s[i - k] == 'M')
m--;
}
if (s[i] == 'D')
d++;
else if (s[i] == 'M') {
dm += d;
m++;
} else if (s[i] == 'C')
dmc += dm;
}
cout << dmc << endl;
}
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
#define x first
#define y second
#define mp make_pair
// everything goes according to my plan
#define pb push_back
#define sz(a) (int)(a.size())
#define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
#define y1 Y_U_NO_y1
#define left Y_U_NO_left
#define right Y_U_NO_right
#ifdef Local
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr \
if (0) \
cout
#endif
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
const int Mod = (int)1e9 + 7;
const int MX = 1073741822;
const ll MXLL = 4e18;
// a pinch of soul
inline void Read_rap() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline void randomizer3000() {
unsigned int seed;
asm("rdtsc" : "=A"(seed));
srand(seed);
}
void files(string problem) {
if (fopen((problem + ".in").c_str(), "r")) {
freopen((problem + ".in").c_str(), "r", stdin);
freopen((problem + ".out").c_str(), "w", stdout);
}
}
void localInput(const char in[] = "s") {
if (fopen(in, "r")) {
freopen(in, "r", stdin);
} else
cerr << "Warning: Input file not found" << endl;
}
const int N = 1e6 + 1;
int n;
char s[N];
ll cp[2 * N];
ll pp[N];
ll dp[N];
ll solve(int k) {
memset(dp, 0, sizeof dp);
memset(cp, 0, sizeof cp);
memset(pp, 0, sizeof pp);
for (int i = 1; i <= 2 * n; i++)
cp[i] = cp[i - 1] + (s[i] == 'C');
for (int i = 1; i <= n; i++)
pp[i] = pp[i - 1] + (s[i] == 'D') * 1ll * cp[i + k - 1];
for (int i = 1; i <= n; i++)
dp[i] = dp[i - 1] + (s[i] == 'D');
ll ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'M') {
int l = max(0, i - k + 1);
ll x = pp[i] - pp[l];
x -= (dp[i] - dp[l]) * cp[i - 1];
ans += x;
}
}
return ans;
}
int main() {
#ifdef Local
// localInput();
#endif
Read_rap();
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
cout << solve(k) << endl;
}
return 0;
}
// Coded by Z.. | #include <bits/stdc++.h>
#define x first
#define y second
#define mp make_pair
// everything goes according to my plan
#define pb push_back
#define sz(a) (int)(a.size())
#define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
#define y1 Y_U_NO_y1
#define left Y_U_NO_left
#define right Y_U_NO_right
#ifdef Local
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr \
if (0) \
cout
#endif
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
const int Mod = (int)1e9 + 7;
const int MX = 1073741822;
const ll MXLL = 4e18;
// a pinch of soul
inline void Read_rap() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline void randomizer3000() {
unsigned int seed;
asm("rdtsc" : "=A"(seed));
srand(seed);
}
void files(string problem) {
if (fopen((problem + ".in").c_str(), "r")) {
freopen((problem + ".in").c_str(), "r", stdin);
freopen((problem + ".out").c_str(), "w", stdout);
}
}
void localInput(const char in[] = "s") {
if (fopen(in, "r")) {
freopen(in, "r", stdin);
} else
cerr << "Warning: Input file not found" << endl;
}
const int N = 1e6 + 1;
int n;
char s[2 * N];
ll cp[2 * N];
ll pp[N];
ll dp[N];
ll solve(int k) {
memset(dp, 0, sizeof dp);
memset(cp, 0, sizeof cp);
memset(pp, 0, sizeof pp);
for (int i = 1; i <= 2 * n; i++)
cp[i] = cp[i - 1] + (s[i] == 'C');
for (int i = 1; i <= n; i++)
pp[i] = pp[i - 1] + (s[i] == 'D') * 1ll * cp[i + k - 1];
for (int i = 1; i <= n; i++)
dp[i] = dp[i - 1] + (s[i] == 'D');
ll ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'M') {
int l = max(0, i - k + 1);
ll x = pp[i] - pp[l];
x -= (dp[i] - dp[l]) * cp[i - 1];
ans += x;
}
}
return ans;
}
int main() {
#ifdef Local
// localInput();
#endif
Read_rap();
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
cout << solve(k) << endl;
}
return 0;
}
// Coded by Z.. | replace | 59 | 60 | 59 | 60 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
#define pb push_back
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
if (x == 0 || y == 0)
return x + y;
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool prime(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
string minst(string s, string t) {
int n = s.size();
int m = t.size();
if (n < m)
return s;
else if (n > m)
return t;
else {
rep(0, i, n) {
if (s[i] < t[i])
return s;
if (s[i] > t[i])
return t;
}
return s;
}
}
string string_reverse(string s) {
int n = s.size();
string t;
rep(0, i, n) t += s[n - i - 1];
return t;
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 80) {
if (minpow(sinsuu, i) > x) {
return sum;
}
sum += (x % minpow(sinsuu, i + 1)) / (minpow(sinsuu, i));
}
return sum;
}
double distance(double a, double b, double c, double d) {
return sqrt((b - a) * (b - a) + (c - d) * (c - d));
}
int sankaku(int a) { return a * (a + 1) / 2; }
int sames(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
using Graph = vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v] = p;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1); // d を 1 増やして子ノードへ
}
}
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
if (a == 0 || b == 0) {
return a + b;
}
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int m[1114514], c[1114514];
signed main() {
ic(n) sc(s) m[0] = 0;
c[0] = 0;
rep(0, i, n) {
if (s[i] == 'M')
m[i + 1] = m[i] + 1;
else
m[i + 1] = m[i];
if (s[i] == 'C')
c[i + 1] = c[i] + 1;
else
c[i + 1] = c[i];
}
ic(q) while (q > 0) {
q -= 1;
ic(a) int k = 0;
rep(0, i, a - 1) if (s[i] == 'C') k += m[i];
int mc[1114514];
rep(0, i, n) mc[i] = 0;
mc[0] = k;
rep(0, i, n) {
mc[i + 1] = mc[i];
if (s[i] == 'M')
mc[i + 1] -= (c[min(i + a - 1, n)] - c[i]);
if (s[i + a - 1] == 'C')
mc[i + 1] += (m[min(n, i + a - 1)] - m[i + 1]);
}
int ans = 0;
rep(0, i, n) if (s[i] == 'D') ans += mc[i + 1];
c(ans)
}
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
#define pb push_back
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
if (x == 0 || y == 0)
return x + y;
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool prime(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
string minst(string s, string t) {
int n = s.size();
int m = t.size();
if (n < m)
return s;
else if (n > m)
return t;
else {
rep(0, i, n) {
if (s[i] < t[i])
return s;
if (s[i] > t[i])
return t;
}
return s;
}
}
string string_reverse(string s) {
int n = s.size();
string t;
rep(0, i, n) t += s[n - i - 1];
return t;
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 80) {
if (minpow(sinsuu, i) > x) {
return sum;
}
sum += (x % minpow(sinsuu, i + 1)) / (minpow(sinsuu, i));
}
return sum;
}
double distance(double a, double b, double c, double d) {
return sqrt((b - a) * (b - a) + (c - d) * (c - d));
}
int sankaku(int a) { return a * (a + 1) / 2; }
int sames(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
using Graph = vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v] = p;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1); // d を 1 増やして子ノードへ
}
}
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
if (a == 0 || b == 0) {
return a + b;
}
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int m[1114514], c[1114514];
signed main() {
ic(n) sc(s) m[0] = 0;
c[0] = 0;
rep(0, i, n) {
if (s[i] == 'M')
m[i + 1] = m[i] + 1;
else
m[i + 1] = m[i];
if (s[i] == 'C')
c[i + 1] = c[i] + 1;
else
c[i + 1] = c[i];
}
ic(q) while (q > 0) {
q -= 1;
ic(a) int k = 0;
rep(0, i, a - 1) if (s[i] == 'C') k += m[i];
int mc[1114514];
rep(0, i, n) mc[i] = 0;
mc[0] = k;
rep(0, i, n) {
mc[i + 1] = mc[i];
if (s[i] == 'M')
mc[i + 1] -= (c[min(i + a - 1, n)] - c[i]);
if (i <= n - a) {
if (s[i + a - 1] == 'C')
mc[i + 1] += (m[min(n, i + a - 1)] - m[i + 1]);
}
}
int ans = 0;
rep(0, i, n) if (s[i] == 'D') ans += mc[i + 1];
c(ans)
}
} | replace | 378 | 380 | 378 | 382 | -11 | |
p03216 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define N 1000010
char getc() {
char c = getchar();
while ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') && (c < '0' || c > '9'))
c = getchar();
return c;
}
int gcd(int n, int m) { return m == 0 ? n : gcd(m, n % m); }
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
int n, q, m, a[N], b[N], c[N];
char s[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("a.in", "r", stdin);
freopen("a.out", "w", stdout);
const char LL[] = "%I64d\n";
#else
const char LL[] = "%lld\n";
#endif
n = read();
scanf("%s", s + 1);
for (int i = 1; i <= n; i++)
if (s[i] == 'D')
a[i] = 0;
else if (s[i] == 'M')
a[i] = 1;
else if (s[i] == 'C')
a[i] = 2;
else
a[i] = -1;
q = read();
while (q--) {
m = read();
int hb = 1, tb = 0, hc = 1, t = 0, tc = 0;
ll ans = 0, cur = 0;
for (int i = 1; i <= n; i++)
if (a[i] == 2)
b[++tb] = i;
for (int i = 1; i <= n; i++)
if (a[i] == 1)
ans += cur;
else if (a[i] == 0) {
c[++tc] = i;
while (t < tb && b[t + 1] - i + 1 <= m)
t++;
cur += t - hb + 1;
} else if (a[i] == 2) {
while (hc <= tc && i - c[hc] + 1 > m)
hc++;
cur -= tc - hc + 1;
hb++;
}
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define N 1000010
char getc() {
char c = getchar();
while ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') && (c < '0' || c > '9'))
c = getchar();
return c;
}
int gcd(int n, int m) { return m == 0 ? n : gcd(m, n % m); }
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
int n, q, m, a[N], b[N], c[N];
char s[N];
int main() {
n = read();
scanf("%s", s + 1);
for (int i = 1; i <= n; i++)
if (s[i] == 'D')
a[i] = 0;
else if (s[i] == 'M')
a[i] = 1;
else if (s[i] == 'C')
a[i] = 2;
else
a[i] = -1;
q = read();
while (q--) {
m = read();
int hb = 1, tb = 0, hc = 1, t = 0, tc = 0;
ll ans = 0, cur = 0;
for (int i = 1; i <= n; i++)
if (a[i] == 2)
b[++tb] = i;
for (int i = 1; i <= n; i++)
if (a[i] == 1)
ans += cur;
else if (a[i] == 0) {
c[++tc] = i;
while (t < tb && b[t + 1] - i + 1 <= m)
t++;
cur += t - hb + 1;
} else if (a[i] == 2) {
while (hc <= tc && i - c[hc] + 1 > m)
hc++;
cur -= tc - hc + 1;
hb++;
}
cout << ans << endl;
}
return 0;
} | delete | 31 | 38 | 31 | 31 | TLE | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Int long long
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int U;
cin >> U;
while (U--) {
Int ans = 0, res = 0, add = 0;
int tmp;
cin >> tmp;
tmp--;
queue<Int> q;
for (int i = 0; i < n; i++) {
if (s[i] == 'D') {
q.push(add);
} else if (s[i] == 'M') {
res += q.size();
add++;
} else if (s[i] == 'C') {
ans += res;
}
if (i >= 1) {
int k = i - tmp;
if (s[k] == 'D') {
res -= (add - q.front());
q.pop();
}
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define Int long long
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int U;
cin >> U;
while (U--) {
Int ans = 0, res = 0, add = 0;
int tmp;
cin >> tmp;
tmp--;
queue<Int> q;
for (int i = 0; i < n; i++) {
if (s[i] == 'D') {
q.push(add);
} else if (s[i] == 'M') {
res += q.size();
add++;
} else if (s[i] == 'C') {
ans += res;
}
if (i >= tmp) {
int k = i - tmp;
if (s[k] == 'D') {
res -= (add - q.front());
q.pop();
}
}
}
cout << ans << endl;
}
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N;
cin >> N;
string S;
cin >> S;
vector<int> cumb(2 * N + 1, 0), cumc(2 * N + 1, 0), cumbb(2 * N + 1, 0);
for (int i = 0; i < 2 * N + 1; i++) {
if (i) {
cumb[i] = cumb[i - 1];
cumc[i] = cumc[i - 1];
cumbb[i] = cumbb[i - 1];
}
if (S[i] == 'M') {
cumb[i]++;
}
if (S[i] == 'C') {
cumc[i]++;
cumbb[i] += cumb[i];
}
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int k;
cin >> k;
int ans = 0;
for (int j = 0; j < N; j++) {
if (S[j] == 'D') {
ans +=
cumbb[j + k - 1] - (cumc[j + k - 1] - cumc[j]) * cumb[j] - cumbb[j];
// cout << cumbb[j+k] << endl;
}
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N;
cin >> N;
string S;
cin >> S;
vector<int> cumb(2 * N + 1, 0), cumc(2 * N + 1, 0), cumbb(2 * N + 1, 0);
for (int i = 0; i < 2 * N + 1; i++) {
if (i) {
cumb[i] = cumb[i - 1];
cumc[i] = cumc[i - 1];
cumbb[i] = cumbb[i - 1];
}
if (i >= N)
continue;
if (S[i] == 'M') {
cumb[i]++;
}
if (S[i] == 'C') {
cumc[i]++;
cumbb[i] += cumb[i];
}
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int k;
cin >> k;
int ans = 0;
for (int j = 0; j < N; j++) {
if (S[j] == 'D') {
ans +=
cumbb[j + k - 1] - (cumc[j + k - 1] - cumc[j]) * cumb[j] - cumbb[j];
// cout << cumbb[j+k] << endl;
}
}
cout << ans << endl;
}
return 0;
}
| insert | 23 | 23 | 23 | 25 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long d[1111111], m[1111111], dm[1111111];
int main() {
int n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i < n; i++)
d[i + 1] = d[i] + (s[i] == 'D'), m[i + 1] = m[i] + (s[i] == 'M'),
dm[i + 1] = dm[i] + d[i] * (s[i] == 'M');
for (int i = 0; i < q; i++) {
int k;
cin >> k;
k--;
long r = 0;
for (int j = 2; j < n; j++) {
if (s[j] != 'C')
continue;
r += dm[j] - dm[j - k] - d[j - k] * (m[j] - m[j - k]);
}
cout << r << '\n';
}
cout << flush;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long d[1111111], m[1111111], dm[1111111];
int main() {
int n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i < n; i++)
d[i + 1] = d[i] + (s[i] == 'D'), m[i + 1] = m[i] + (s[i] == 'M'),
dm[i + 1] = dm[i] + d[i] * (s[i] == 'M');
for (int i = 0; i < q; i++) {
int k;
cin >> k;
k--;
long r = 0;
for (int j = 2; j < n; j++) {
if (s[j] != 'C')
continue;
int l = max(0, j - k);
r += dm[j] - dm[l] - d[l] * (m[j] - m[l]);
}
cout << r << '\n';
}
cout << flush;
return 0;
}
| replace | 20 | 21 | 20 | 22 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll q;
cin >> q;
vector<ll> d, m, c;
for (ll i = 0; i < n; i++) {
if (s[i] == 'D')
d.push_back(i);
if (s[i] == 'M')
m.push_back(i);
if (s[i] == 'C')
c.push_back(i);
}
ll sum[n + 1];
sum[0] = 0;
for (ll i = 0; i < c.size(); i++) {
ll y = lower_bound(m.begin(), m.end(), c[i]) - m.begin();
sum[i + 1] = sum[i] + y;
}
ll dm[200010], dc[200010];
for (ll i = 0; i < 200001; i++) {
ll mm = lower_bound(m.begin(), m.end(), i) - m.begin();
ll cc = lower_bound(c.begin(), c.end(), i) - c.begin();
dm[i] = mm;
dc[i] = cc;
}
for (ll i = 0; i < q; i++) {
ll k;
cin >> k;
ll ans = 0;
for (ll j = 0; j < d.size(); j++) {
ll rc = dc[d[j] + k], lc = dc[d[j]], lm = dm[d[j]];
ans += (sum[rc] - sum[lc]) - (rc - lc) * lm;
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll q;
cin >> q;
vector<ll> d, m, c;
for (ll i = 0; i < n; i++) {
if (s[i] == 'D')
d.push_back(i);
if (s[i] == 'M')
m.push_back(i);
if (s[i] == 'C')
c.push_back(i);
}
ll sum[n + 1];
sum[0] = 0;
for (ll i = 0; i < c.size(); i++) {
ll y = lower_bound(m.begin(), m.end(), c[i]) - m.begin();
sum[i + 1] = sum[i] + y;
}
ll dm[2000010], dc[2000010];
for (ll i = 0; i < 2000001; i++) {
ll mm = lower_bound(m.begin(), m.end(), i) - m.begin();
ll cc = lower_bound(c.begin(), c.end(), i) - c.begin();
dm[i] = mm;
dc[i] = cc;
}
for (ll i = 0; i < q; i++) {
ll k;
cin >> k;
ll ans = 0;
for (ll j = 0; j < d.size(); j++) {
ll rc = dc[d[j] + k], lc = dc[d[j]], lm = dm[d[j]];
ans += (sum[rc] - sum[lc]) - (rc - lc) * lm;
}
cout << ans << endl;
}
}
| replace | 25 | 27 | 25 | 27 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
struct BIT {
int n;
VL bit;
BIT() {}
BIT(int x) {
n = x;
bit.assign(n + 1, 0);
}
void init(int x) {
n = x;
bit.assign(n + 1, 0);
}
void add(int i, ll x) {
i++;
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
// [0, i]
ll sum(int i) {
i++;
ll ret = 0;
while (i > 0) {
ret += bit[i];
i -= i & -i;
}
return ret;
}
// [l, r)
ll sum(int l, int r) {
if (l >= r)
return 0;
return sum(r - 1) - sum(l - 1);
}
};
int main() {
int n;
string s;
cin >> n >> s;
VI d, c(n);
REP(i, n) if (s[i] == 'D') d.push_back(i);
int cnt = 0;
REP(i, n) {
if (s[i] == 'D')
cnt++;
c[i] = cnt;
}
int m = d.size();
int q;
cin >> q;
while (q--) {
int k = in();
ll ans = 0, sum = 0;
BIT bit(m + 1);
int j = 0;
REP(i, n) {
if (s[i] == 'M') {
bit.add(0, 1);
bit.add(c[i], -1);
sum += c[i] - j;
} else if (s[i] == 'C') {
while (i - d[j] >= k) {
sum -= bit.sum(j);
j++;
}
ans += sum;
}
}
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
struct BIT {
int n;
VL bit;
BIT() {}
BIT(int x) {
n = x;
bit.assign(n + 1, 0);
}
void init(int x) {
n = x;
bit.assign(n + 1, 0);
}
void add(int i, ll x) {
i++;
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
// [0, i]
ll sum(int i) {
i++;
ll ret = 0;
while (i > 0) {
ret += bit[i];
i -= i & -i;
}
return ret;
}
// [l, r)
ll sum(int l, int r) {
if (l >= r)
return 0;
return sum(r - 1) - sum(l - 1);
}
};
int main() {
int n;
string s;
cin >> n >> s;
VI d, c(n);
REP(i, n) if (s[i] == 'D') d.push_back(i);
int cnt = 0;
REP(i, n) {
if (s[i] == 'D')
cnt++;
c[i] = cnt;
}
int m = d.size();
int q;
cin >> q;
while (q--) {
int k = in();
ll ans = 0, sum = 0;
BIT bit(m + 1);
int j = 0;
REP(i, n) {
if (s[i] == 'M') {
bit.add(0, 1);
bit.add(c[i], -1);
sum += c[i] - j;
} else if (s[i] == 'C') {
while (j < m && i - d[j] >= k) {
sum -= bit.sum(j);
j++;
}
ans += sum;
}
}
cout << ans << endl;
}
return 0;
}
| replace | 109 | 110 | 109 | 110 | 0 | |
p03216 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
string S;
cin >> N >> S >> Q;
while (Q--) {
ll k;
cin >> k;
ll d = 0, dm = 0, m = 0, ans = 0;
Rep(i, k) {
if (S[i] == 'D')
d++;
if (S[i] == 'M') {
dm += d;
m++;
}
if (S[i] == 'C') {
ans += dm;
}
cerr << i << " " << d << " " << m << " " << dm << "\n";
}
Rep(i, N - k) {
if (S[i] == 'D') {
d--;
dm -= m;
}
if (S[i] == 'M') {
m--;
}
if (S[i + k] == 'D')
d++;
if (S[i + k] == 'M') {
dm += d;
m++;
}
if (S[i + k] == 'C') {
ans += dm;
}
// cout << i << " " << d << " " << m << " " << dm << "\n";
}
cout << ans << "\n";
}
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
string S;
cin >> N >> S >> Q;
while (Q--) {
ll k;
cin >> k;
ll d = 0, dm = 0, m = 0, ans = 0;
Rep(i, k) {
if (S[i] == 'D')
d++;
if (S[i] == 'M') {
dm += d;
m++;
}
if (S[i] == 'C') {
ans += dm;
}
// cerr << i << " " << d << " " << m << " " << dm << "\n";
}
Rep(i, N - k) {
if (S[i] == 'D') {
d--;
dm -= m;
}
if (S[i] == 'M') {
m--;
}
if (S[i + k] == 'D')
d++;
if (S[i + k] == 'M') {
dm += d;
m++;
}
if (S[i + k] == 'C') {
ans += dm;
}
// cout << i << " " << d << " " << m << " " << dm << "\n";
}
cout << ans << "\n";
}
} | replace | 59 | 60 | 59 | 60 | TLE | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(x)>::type i = (x), _##i = (y); i > _##i; --i)
#ifdef zerol
#define dbg(args...) \
do { \
cout << "DEBUG: " << #args << " -> "; \
err(args); \
} while (0)
#else
#define dbg(...)
#endif
void err() { cout << endl; }
template <template <typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
for (auto x : a)
cout << x << ' ';
err(args...);
}
template <typename T, typename... Args> void err(T a, Args... args) {
cout << a << ' ';
err(args...);
}
// -----------------------------------------------------------------------------
const int N = 1E6 + 100;
int n;
char s[N];
LL solve(int K) {
int l = 0, r = 1, mp = 0, cp = 0;
LL pcount = 0, ans = 0;
while (l < n) {
while (r - l < K) {
// add r
if (s[r] == 'M')
mp++;
else if (s[r] == 'C') {
cp++;
pcount += 1 * mp;
}
r++;
}
if (s[l] == 'D')
ans += pcount;
l++;
if (s[l] == 'M') {
mp--;
pcount -= 1 * cp;
} else if (s[l] == 'C')
cp--;
}
return ans;
}
int main() {
int q;
cin >> n >> s >> q;
while (q--) {
int k;
cin >> k;
cout << solve(k) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(x)>::type i = (x), _##i = (y); i > _##i; --i)
#ifdef zerol
#define dbg(args...) \
do { \
cout << "DEBUG: " << #args << " -> "; \
err(args); \
} while (0)
#else
#define dbg(...)
#endif
void err() { cout << endl; }
template <template <typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
for (auto x : a)
cout << x << ' ';
err(args...);
}
template <typename T, typename... Args> void err(T a, Args... args) {
cout << a << ' ';
err(args...);
}
// -----------------------------------------------------------------------------
const int N = 1E6 + 100;
int n;
char s[N];
LL solve(int K) {
int l = 0, r = 1, mp = 0, cp = 0;
LL pcount = 0, ans = 0;
while (l < n) {
while (r < n && r - l < K) {
// add r
if (s[r] == 'M')
mp++;
else if (s[r] == 'C') {
cp++;
pcount += 1 * mp;
}
r++;
}
if (s[l] == 'D')
ans += pcount;
l++;
if (s[l] == 'M') {
mp--;
pcount -= 1 * cp;
} else if (s[l] == 'C')
cp--;
}
return ans;
}
int main() {
int q;
cin >> n >> s >> q;
while (q--) {
int k;
cin >> k;
cout << solve(k) << endl;
}
} | replace | 37 | 38 | 37 | 38 | 0 | |
p03216 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
template <typename T> struct BIT {
int n;
vector<T> d;
BIT(int n = 0) : n(n), d(n + 1) {}
void add(int i, T x = 1) {
for (i++; i <= n; i += i & -i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i & -i) {
x += d[i];
}
return x;
}
T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};
int main() {
int N;
string S;
cin >> N >> S;
// f : 場所
// s : その場所より前にある'M'の個数
vector<int> Df;
vector<int> Cf;
vector<int> Ds;
vector<int> Cs;
int Mcnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'D') {
Df.push_back(i);
Ds.push_back(Mcnt);
} else if (S[i] == 'C') {
Cf.push_back(i);
Cs.push_back(Mcnt);
} else if (S[i] == 'M') {
Mcnt++;
}
}
int Dsz = Df.size();
int Csz = Cf.size();
BIT<ll> bit(Csz);
for (int i = 0; i < Csz; i++) {
bit.add(i, Cs[i]);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int k;
cin >> k;
ll ans = 0;
for (int i = 0; i < Dsz; i++) {
ll l = lower_bound(Cf.begin(), Cf.end(), Df[i]) - Cf.begin();
ll r = lower_bound(Cf.begin(), Cf.end(), Df[i] + k) - Cf.begin() - 1;
ll res = bit.sum(l, r + 1);
res -= Ds[i] * (r - l + 1);
ans += res;
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
template <typename T> struct BIT {
int n;
vector<T> d;
BIT(int n = 0) : n(n), d(n + 1) {}
void add(int i, T x = 1) {
for (i++; i <= n; i += i & -i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i & -i) {
x += d[i];
}
return x;
}
T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};
int main() {
int N;
string S;
cin >> N >> S;
// f : 場所
// s : その場所より前にある'M'の個数
vector<int> Df;
vector<int> Cf;
vector<int> Ds;
vector<int> Cs;
int Mcnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'D') {
Df.push_back(i);
Ds.push_back(Mcnt);
} else if (S[i] == 'C') {
Cf.push_back(i);
Cs.push_back(Mcnt);
} else if (S[i] == 'M') {
Mcnt++;
}
}
int Dsz = Df.size();
int Csz = Cf.size();
BIT<ll> bit(Csz);
for (int i = 0; i < Csz; i++) {
bit.add(i, Cs[i]);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int k;
cin >> k;
ll ans = 0;
for (int i = 0; i < Dsz; i++) {
ll l = lower_bound(Cf.begin(), Cf.end(), Df[i]) - Cf.begin();
ll r = lower_bound(Cf.begin(), Cf.end(), Df[i] + k) - Cf.begin() - 1;
ll res = bit.sum(l, r + 1);
res -= Ds[i] * (r - l + 1);
ans += res;
}
cout << ans << endl;
}
return 0;
} | insert | 1 | 1 | 1 | 3 | TLE | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll MOD = 1e9 + 7;
int main() {
ll n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i < 100; i++)
s += '.';
for (int cn = 0; cn < q; cn++) {
ll k, ans = 0;
cin >> k;
ll cntc = 0, sumn = 0, cntm = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'M')
cntm++;
if (s[i] == 'C') {
sumn += cntm;
cntc++;
}
}
for (int i = 0; s[i] != '.'; i++) {
if (s[i] == 'D')
ans += sumn;
if (s[i] == 'M') {
cntm--;
sumn -= cntc;
}
if (s[i] == 'C') {
cntc--;
}
if (s[i + k] == 'M')
cntm++;
if (s[i + k] == 'C') {
cntc++;
sumn += cntm;
}
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll MOD = 1e9 + 7;
int main() {
ll n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i <= n; i++)
s += '.';
for (int cn = 0; cn < q; cn++) {
ll k, ans = 0;
cin >> k;
ll cntc = 0, sumn = 0, cntm = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'M')
cntm++;
if (s[i] == 'C') {
sumn += cntm;
cntc++;
}
}
for (int i = 0; s[i] != '.'; i++) {
if (s[i] == 'D')
ans += sumn;
if (s[i] == 'M') {
cntm--;
sumn -= cntc;
}
if (s[i] == 'C') {
cntc--;
}
if (s[i + k] == 'M')
cntm++;
if (s[i + k] == 'C') {
cntc++;
sumn += cntm;
}
}
cout << ans << endl;
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03216 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const long double PI = acos(-1.0L);
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
signed main() {
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0LL, d = 0LL, m = 0LL, dm = 0LL;
cerr << "i s[i] ans D M DM" << endl;
rep(i, n) {
if (s[i] == 'D')
d++;
if (s[i] == 'M')
m++, dm += d;
if (s[i] == 'C')
ans += dm;
if (i >= k - 1) {
if (s[i - k + 1] == 'D')
d--, dm -= m;
if (s[i - k + 1] == 'M')
m--;
}
cerr << i SP s[i] SP ans SP d SP m SP dm << endl;
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const long double PI = acos(-1.0L);
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
signed main() {
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0LL, d = 0LL, m = 0LL, dm = 0LL;
cerr << "i s[i] ans D M DM" << endl;
rep(i, n) {
if (s[i] == 'D')
d++;
if (s[i] == 'M')
m++, dm += d;
if (s[i] == 'C')
ans += dm;
if (i >= k - 1) {
if (s[i - k + 1] == 'D')
d--, dm -= m;
if (s[i - k + 1] == 'M')
m--;
}
// cerr<< i SP s[i] SP ans SP d SP m SP dm<<endl;
}
cout << ans << endl;
}
return 0;
}
| replace | 59 | 60 | 59 | 60 | TLE | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) begin(v), end(v)
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename A, typename B> inline bool chmin(A &a, B b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll << 30;
constexpr ll longINF = 1ll << 60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//
int main() {
int N;
string S;
cin >> N >> S;
int Q;
cin >> Q;
while (Q--) {
int K;
scanf("%d", &K);
ll ans = 0;
ll cntm = 0, cntc = 0, cur = 0, pos = 0;
REP(i, N) {
while (pos < i + K) {
if (S[pos] == 'M')
++cntm;
else if (S[pos] == 'C') {
++cntc;
cur += cntm;
}
++pos;
}
if (S[i] == 'D')
ans += cur;
else if (S[i] == 'M') {
--cntm;
cur -= cntc;
} else if (S[i] == 'C') {
--cntc;
}
}
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) begin(v), end(v)
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename A, typename B> inline bool chmin(A &a, B b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll << 30;
constexpr ll longINF = 1ll << 60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//
int main() {
int N;
string S;
cin >> N >> S;
int Q;
cin >> Q;
while (Q--) {
int K;
scanf("%d", &K);
ll ans = 0;
ll cntm = 0, cntc = 0, cur = 0, pos = 0;
REP(i, N) {
while (pos < N && pos < i + K) {
if (S[pos] == 'M')
++cntm;
else if (S[pos] == 'C') {
++cntc;
cur += cntm;
}
++pos;
}
if (S[i] == 'D')
ans += cur;
else if (S[i] == 'M') {
--cntm;
cur -= cntc;
} else if (S[i] == 'C') {
--cntc;
}
}
printf("%lld\n", ans);
}
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum[3][1000000], sum2[1000000],
ans, dp, a[400000], nxt[400000];
string str, ss;
bool f[200][200];
char c;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<int>> vec;
vector<edge> ed;
vector<LL> v[3];
map<Pll, LL> ma;
set<LL> st;
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
cin >> n;
cin >> str;
rep(i, 3) { v[i].push_back(-1); }
rep(i, 3) {
rep(j, n) {
LL cur = 0;
if (i == 0 && str[j] == 'D') {
cur++;
}
if (i == 1 && str[j] == 'M') {
cur++;
}
if (i == 2 && str[j] == 'C') {
cur++;
}
if (cur == 1)
v[i].push_back(j);
sum[i][j + 1] += sum[i][j] + cur;
}
}
rep(i, 3) { v[i].push_back(INF); }
cin >> q;
rep(i, q) {
LL x;
ans = 0;
cin >> x;
rep(i, n) {
sum2[i] = 0;
nxt[i] = 0;
}
rep(j, v[0].size()) {
if (j == 0 || j == v[0].size() - 1)
continue;
LL it =
upper_bound(v[2].begin(), v[2].end(), v[0][j] + x - 1) - v[2].begin();
sum2[v[2][it - 1]]++;
sum2[v[0][j]]--;
nxt[v[0][j]] = v[2][it - 1];
}
LL cur = 0;
Rrep(j, n) {
sum2[j] += sum2[j + 1];
if (str[j] == 'M') {
ans += cur;
}
if (str[j] == 'C') {
cur += sum2[j];
}
if (str[j] == 'D') {
cur -= sum[2][nxt[j] + 1] - sum[2][j];
}
}
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum[3][1100000], sum2[1100000],
ans, dp, a[1100000], nxt[1100000];
string str, ss;
bool f[200][200];
char c;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<int>> vec;
vector<edge> ed;
vector<LL> v[3];
map<Pll, LL> ma;
set<LL> st;
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
cin >> n;
cin >> str;
rep(i, 3) { v[i].push_back(-1); }
rep(i, 3) {
rep(j, n) {
LL cur = 0;
if (i == 0 && str[j] == 'D') {
cur++;
}
if (i == 1 && str[j] == 'M') {
cur++;
}
if (i == 2 && str[j] == 'C') {
cur++;
}
if (cur == 1)
v[i].push_back(j);
sum[i][j + 1] += sum[i][j] + cur;
}
}
rep(i, 3) { v[i].push_back(INF); }
cin >> q;
rep(i, q) {
LL x;
ans = 0;
cin >> x;
rep(i, n) {
sum2[i] = 0;
nxt[i] = 0;
}
rep(j, v[0].size()) {
if (j == 0 || j == v[0].size() - 1)
continue;
LL it =
upper_bound(v[2].begin(), v[2].end(), v[0][j] + x - 1) - v[2].begin();
sum2[v[2][it - 1]]++;
sum2[v[0][j]]--;
nxt[v[0][j]] = v[2][it - 1];
}
LL cur = 0;
Rrep(j, n) {
sum2[j] += sum2[j + 1];
if (str[j] == 'M') {
ans += cur;
}
if (str[j] == 'C') {
cur += sum2[j];
}
if (str[j] == 'D') {
cur -= sum[2][nxt[j] + 1] - sum[2][j];
}
}
cout << ans << endl;
}
return 0;
} | replace | 61 | 63 | 61 | 63 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1 << 30;
const ll linf = 1LL << 62;
const int MAX = 510000;
ll dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const double pi = acos(-1);
const double eps = 1e-7;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> inline void print2(T1 a, T2 b) {
cout << a << " " << b << endl;
}
template <typename T1, typename T2, typename T3>
inline void print3(T1 a, T2 b, T3 c) {
cout << a << " " << b << " " << c << endl;
}
const int mod = 1e9 + 7;
int main() {
ll n;
string s;
cin >> n >> s;
ll q;
cin >> q;
while (q--) {
ll k;
cin >> k;
ll m = 0, c = 0, cnt = 0;
ll ans = 0;
rep(i, k - 1) {
if (s[i] == 'M')
m++;
if (s[i] == 'C')
cnt += m, c++;
}
rep(i, n) {
if (s[i + k - 1] == 'C')
c++, cnt += m;
if (s[i + k - 1] == 'M')
m++;
if (s[i] == 'D')
ans += cnt;
if (s[i] == 'M')
m--, cnt -= c;
if (s[i] == 'C')
c--;
}
cout << ans << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1 << 30;
const ll linf = 1LL << 62;
const int MAX = 510000;
ll dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const double pi = acos(-1);
const double eps = 1e-7;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> inline void print2(T1 a, T2 b) {
cout << a << " " << b << endl;
}
template <typename T1, typename T2, typename T3>
inline void print3(T1 a, T2 b, T3 c) {
cout << a << " " << b << " " << c << endl;
}
const int mod = 1e9 + 7;
int main() {
ll n;
string s;
cin >> n >> s;
ll q;
cin >> q;
while (q--) {
ll k;
cin >> k;
ll m = 0, c = 0, cnt = 0;
ll ans = 0;
rep(i, k - 1) {
if (s[i] == 'M')
m++;
if (s[i] == 'C')
cnt += m, c++;
}
rep(i, n) {
if (i + k <= n)
if (s[i + k - 1] == 'C')
c++, cnt += m;
if (i + k <= n)
if (s[i + k - 1] == 'M')
m++;
if (s[i] == 'D')
ans += cnt;
if (s[i] == 'M')
m--, cnt -= c;
if (s[i] == 'C')
c--;
}
cout << ans << endl;
}
} | replace | 73 | 77 | 73 | 79 | 0 | |
p03216 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define maxn 1000005
#define ll long long
#define ld double
#define mod 998244353
using namespace std;
char inp[maxn];
struct th {
ll a[maxn];
th() { memset(a, 0, sizeof(a)); }
void add(int pl, int num) { a[pl] += num; }
void build() {
for (int i = 1; i < maxn; i++)
a[i] += a[i - 1];
}
ll q(int l, int r) { return a[r] - a[l - 1]; }
} q1, q2;
int k[maxn];
int sum[maxn];
int main() {
int n;
scanf("%d", &n);
scanf("%s", inp + 1);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1];
if (inp[i] == 'M')
sum[i]++;
if (inp[i] == 'C')
q1.add(i, 1), q2.add(i, sum[i]);
}
q1.build(), q2.build();
int q;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int k;
scanf("%d", &k);
ll ans = 0;
for (int j = 1; j <= n; j++)
if (inp[j] == 'D')
ans += q2.q(j, j + k - 1) - sum[j] * q1.q(j, j + k - 1);
printf("%lld\n", ans);
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define maxn 2000005
#define ll long long
#define ld double
#define mod 998244353
using namespace std;
char inp[maxn];
struct th {
ll a[maxn];
th() { memset(a, 0, sizeof(a)); }
void add(int pl, int num) { a[pl] += num; }
void build() {
for (int i = 1; i < maxn; i++)
a[i] += a[i - 1];
}
ll q(int l, int r) { return a[r] - a[l - 1]; }
} q1, q2;
int k[maxn];
int sum[maxn];
int main() {
int n;
scanf("%d", &n);
scanf("%s", inp + 1);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1];
if (inp[i] == 'M')
sum[i]++;
if (inp[i] == 'C')
q1.add(i, 1), q2.add(i, sum[i]);
}
q1.build(), q2.build();
int q;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int k;
scanf("%d", &k);
ll ans = 0;
for (int j = 1; j <= n; j++)
if (inp[j] == 'D')
ans += q2.q(j, j + k - 1) - sum[j] * q1.q(j, j + k - 1);
printf("%lld\n", ans);
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03216 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 1001000
int n, q, m;
char s[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (scanf("%d", &q); q; q--) {
scanf("%d", &m);
int l = 1, r = 0, sm = 0, sc = 0;
long long res = 0, ans = 0;
for (; r < m; r++) {
if (s[r + 1] == 'C')
res += sm, sc++;
if (s[r + 1] == 'M')
sm++;
}
for (; l <= n; l++, r++) {
if (s[l] == 'D')
ans += res;
if (s[l] == 'M')
res -= sc, sm--;
if (s[l] == 'C')
sc--;
if (s[r + 1] == 'M')
sm++;
if (s[r + 1] == 'C')
res += sm, sc++;
}
printf("%lld\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 2001000
int n, q, m;
char s[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (scanf("%d", &q); q; q--) {
scanf("%d", &m);
int l = 1, r = 0, sm = 0, sc = 0;
long long res = 0, ans = 0;
for (; r < m; r++) {
if (s[r + 1] == 'C')
res += sm, sc++;
if (s[r + 1] == 'M')
sm++;
}
for (; l <= n; l++, r++) {
if (s[l] == 'D')
ans += res;
if (s[l] == 'M')
res -= sc, sm--;
if (s[l] == 'C')
sc--;
if (s[r + 1] == 'M')
sm++;
if (s[r + 1] == 'C')
res += sm, sc++;
}
printf("%lld\n", ans);
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03216 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long int lli;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
lli gcd(lli a, lli b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
lli lcm(lli a, lli b) { return a * b / gcd(a, b); }
#define N_MAX 200000
#define MOD 1000000007
int N, Q;
char S[N_MAX + 10];
int num[3][N_MAX + 10];
void solv2(int k) {
lli ret = 0;
int left = -1, right = -1;
for (int i = 0; i < N; i++) {
if ('D' == S[i]) {
left = i;
break;
}
}
if (-1 == left) {
printf("0\n");
return;
}
lli sum = 0;
for (right = left; right < min(N, left + k); right++) {
if ('C' != S[right])
continue;
sum += (lli)(num[1][right + 1] - num[1][left + 1]);
}
ret += sum;
for (left = left + 1; left < N; left++, right = min(N, right + 1)) {
if ('M' == S[left]) {
sum -= (lli)(num[2][right] - num[2][left + 1]);
}
if ('C' == S[right]) {
sum += (lli)(num[1][right] - num[1][left + 1]);
}
if ('D' == S[left]) {
ret += sum;
}
}
printf("%lld\n", ret);
}
void solv() {
scanf("%d%s%d", &N, S, &Q);
num[0][0] = num[1][0] = num[2][0] = 0;
for (int i = 1; i <= N; i++) {
num[0][i] = num[0][i - 1] + ('D' == S[i - 1] ? 1 : 0);
num[1][i] = num[1][i - 1] + ('M' == S[i - 1] ? 1 : 0);
num[2][i] = num[2][i - 1] + ('C' == S[i - 1] ? 1 : 0);
}
num[1][N + 1] = num[1][N];
for (int i = 0; i < Q; i++) {
int k;
scanf("%d", &k);
solv2(k);
}
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long int lli;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
lli gcd(lli a, lli b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
lli lcm(lli a, lli b) { return a * b / gcd(a, b); }
#define N_MAX 1000000
#define MOD 1000000007
int N, Q;
char S[N_MAX + 10];
int num[3][N_MAX + 10];
void solv2(int k) {
lli ret = 0;
int left = -1, right = -1;
for (int i = 0; i < N; i++) {
if ('D' == S[i]) {
left = i;
break;
}
}
if (-1 == left) {
printf("0\n");
return;
}
lli sum = 0;
for (right = left; right < min(N, left + k); right++) {
if ('C' != S[right])
continue;
sum += (lli)(num[1][right + 1] - num[1][left + 1]);
}
ret += sum;
for (left = left + 1; left < N; left++, right = min(N, right + 1)) {
if ('M' == S[left]) {
sum -= (lli)(num[2][right] - num[2][left + 1]);
}
if ('C' == S[right]) {
sum += (lli)(num[1][right] - num[1][left + 1]);
}
if ('D' == S[left]) {
ret += sum;
}
}
printf("%lld\n", ret);
}
void solv() {
scanf("%d%s%d", &N, S, &Q);
num[0][0] = num[1][0] = num[2][0] = 0;
for (int i = 1; i <= N; i++) {
num[0][i] = num[0][i - 1] + ('D' == S[i - 1] ? 1 : 0);
num[1][i] = num[1][i - 1] + ('M' == S[i - 1] ? 1 : 0);
num[2][i] = num[2][i - 1] + ('C' == S[i - 1] ? 1 : 0);
}
num[1][N + 1] = num[1][N];
for (int i = 0; i < Q; i++) {
int k;
scanf("%d", &k);
solv2(k);
}
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03217 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// when range [l, r), has property notP~P, want first P.
// when return r, means not found.
template <typename T> T bs_first(T l, T r, function<bool(T)> f) {
assert(l < r);
T mid;
while (l != r) {
mid = l + (r - l) / 2;
if (f(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
return r;
}
const int N = 1024;
int cnt[N][N];
int a[N << 1][N << 1];
int b[N << 1][N << 1];
void solve() {
int n, D;
cin >> n >> D;
for (int _ = 0; _ < n; _++) {
int x, y;
cin >> x >> y;
x %= D;
y %= D;
cnt[x][y]++;
}
n = 0;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
int k = 0;
while (k * k < cnt[i][j]) {
k++;
}
n = max(n, k);
}
}
int z = (n - 1) * n;
int p = (n - 1) * (n - 1);
int Z = 0;
int P = 0;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
if (cnt[i][j] > z) {
Z++;
int x = i + 1, y = j + 1;
a[x][y] = a[x][y + D] = a[x + D][y] = a[x + D][y + D] = 1;
} else if (cnt[i][j] > p) {
P++;
int x = i + 1, y = j + 1;
b[x][y] = b[x][y + D] = b[x + D][y] = b[x + D][y + D] = 1;
}
}
}
const int LIM = D << 1;
for (int i = 1; i <= LIM; i++) {
for (int j = 1; j <= LIM; j++) {
a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
}
}
auto sum = [&](int i, int j, int d) {
return a[i + d][j + d] - a[i][j + d] - a[i + d][j] + a[i][j];
};
auto sum_b = [&](int i, int j, int d) {
return b[i + d][j + d] - b[i][j + d] - b[i + d][j] + b[i][j];
};
auto cover = [&](int i, int j, int d) {
return P - sum_b(i + d, j + d, D - d);
};
int res = D;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
int tmp = bs_first<int>(1, D, [&](int d) { return sum(i, j, d) >= Z; });
int cov = bs_first<int>(1, D, [&](int d) { return cover(i, j, d) >= P; });
tmp = max(tmp, cov);
res = min(res, tmp);
}
}
res += (n - 1) * D - 1;
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// when range [l, r), has property notP~P, want first P.
// when return r, means not found.
template <typename T> T bs_first(T l, T r, function<bool(T)> f) {
assert(l < r);
T mid;
while (l != r) {
mid = l + (r - l) / 2;
if (f(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
return r;
}
const int N = 1024;
int cnt[N][N];
int a[N << 1][N << 1];
int b[N << 1][N << 1];
void solve() {
int n, D;
cin >> n >> D;
for (int _ = 0; _ < n; _++) {
int x, y;
cin >> x >> y;
x %= D;
y %= D;
cnt[x][y]++;
}
n = 0;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
int k = 0;
while (k * k < cnt[i][j]) {
k++;
}
n = max(n, k);
}
}
int z = (n - 1) * n;
int p = (n - 1) * (n - 1);
int Z = 0;
int P = 0;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
if (cnt[i][j] > z) {
Z++;
int x = i + 1, y = j + 1;
a[x][y] = a[x][y + D] = a[x + D][y] = a[x + D][y + D] = 1;
} else if (cnt[i][j] > p) {
P++;
int x = i + 1, y = j + 1;
b[x][y] = b[x][y + D] = b[x + D][y] = b[x + D][y + D] = 1;
}
}
}
const int LIM = D << 1;
for (int i = 1; i <= LIM; i++) {
for (int j = 1; j <= LIM; j++) {
a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
}
}
auto sum = [&](int i, int j, int d) {
return a[i + d][j + d] - a[i][j + d] - a[i + d][j] + a[i][j];
};
auto sum_b = [&](int i, int j, int d) {
return b[i + d][j + d] - b[i][j + d] - b[i + d][j] + b[i][j];
};
auto cover = [&](int i, int j, int d) {
return P - sum_b(i + d, j + d, D - d);
};
if (D == 1) {
cout << (n - 1);
return;
}
int res = D;
for (int i = 0; i < D; i++) {
for (int j = 0; j < D; j++) {
int tmp = bs_first<int>(1, D, [&](int d) { return sum(i, j, d) >= Z; });
int cov = bs_first<int>(1, D, [&](int d) { return cover(i, j, d) >= P; });
tmp = max(tmp, cov);
res = min(res, tmp);
}
}
res += (n - 1) * D - 1;
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| insert | 79 | 79 | 79 | 84 | -6 | 0b5b30b4-ba2c-4903-8186-4437cc6f730a.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03217/C++/s995041324.cpp:9: T bs_first(T, T, std::function<bool(_CharT)>) [with T = int]: Assertion `l < r' failed.
|
p03217 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
template <typename T, int VW, int VH> struct Ruisekiwa2D {
T v[VH][VW];
Ruisekiwa2D() { rep(y, 0, VH) rep(x, 0, VW) v[y][x] = 0; }
void set(int x, int y, T c) { v[y][x] = c; }
void build() {
rep(y, 0, VH) rep(x, 0, VW) {
if (0 < y)
v[y][x] += v[y - 1][x];
if (0 < x)
v[y][x] += v[y][x - 1];
if (0 < y && 0 < x)
v[y][x] -= v[y - 1][x - 1];
}
}
T get(int sx, int sy, int tx, int ty) {
assert(sx <= tx && sy <= ty);
T rs = v[ty][tx];
if (0 < sx)
rs -= v[ty][sx - 1];
if (0 < sy)
rs -= v[sy - 1][tx];
if (0 < sx && 0 < sy)
rs += v[sy - 1][sx - 1];
return rs;
}
};
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, D, X[101010], Y[101010];
//---------------------------------------------------------------------------------------------------
int cnt[1010][1010];
int check(int r) {
Ruisekiwa2D<int, 2010, 2010> aa, ab, bb;
int a = r / D;
int b = r % D;
rep(y, 0, D * 2) rep(x, 0, D * 2) {
int xx = x % D, yy = y % D;
if (1LL * a * a < cnt[yy][xx]) {
aa.set(x, y, 1);
}
if (1LL * a * (a + 1) < cnt[yy][xx]) {
ab.set(x, y, 1);
}
if (1LL * (a + 1) * (a + 1) < cnt[yy][xx]) {
bb.set(x, y, 1);
}
}
aa.build();
ab.build();
bb.build();
rep(sy, 0, D) rep(sx, 0, D) {
int ok = 1;
if (0 < b) {
if (bb.get(sx, sy, sx + b - 1, sy + b - 1))
ok = 0;
if (ab.get(sx, sy + b, sx + b - 1, sx + D - 1))
ok = 0;
if (ab.get(sx + b, sy, sx + D - 1, sy + b - 1))
ok = 0;
}
if (aa.get(sx + b, sy + b, sx + D - 1, sy + D - 1))
ok = 0;
if (ok)
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> D;
rep(i, 0, N) cin >> X[i] >> Y[i];
rep(i, 0, N) cnt[Y[i] % D][X[i] % D]++;
check(2);
int ng = 1, ok = inf;
while (ng + 1 != ok) {
int md = (ng + ok) / 2;
if (check(md))
ok = md;
else
ng = md;
}
cout << ok - 1 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
template <typename T, int VW, int VH> struct Ruisekiwa2D {
T v[VH][VW];
Ruisekiwa2D() { rep(y, 0, VH) rep(x, 0, VW) v[y][x] = 0; }
void set(int x, int y, T c) { v[y][x] = c; }
void build() {
rep(y, 0, VH) rep(x, 0, VW) {
if (0 < y)
v[y][x] += v[y - 1][x];
if (0 < x)
v[y][x] += v[y][x - 1];
if (0 < y && 0 < x)
v[y][x] -= v[y - 1][x - 1];
}
}
T get(int sx, int sy, int tx, int ty) {
assert(sx <= tx && sy <= ty);
T rs = v[ty][tx];
if (0 < sx)
rs -= v[ty][sx - 1];
if (0 < sy)
rs -= v[sy - 1][tx];
if (0 < sx && 0 < sy)
rs += v[sy - 1][sx - 1];
return rs;
}
};
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, D, X[101010], Y[101010];
//---------------------------------------------------------------------------------------------------
int cnt[1010][1010];
int check(int r) {
Ruisekiwa2D<int, 2010, 2010> aa, ab, bb;
int a = r / D;
int b = r % D;
rep(y, 0, D * 2) rep(x, 0, D * 2) {
int xx = x % D, yy = y % D;
if (1LL * a * a < cnt[yy][xx]) {
aa.set(x, y, 1);
}
if (1LL * a * (a + 1) < cnt[yy][xx]) {
ab.set(x, y, 1);
}
if (1LL * (a + 1) * (a + 1) < cnt[yy][xx]) {
bb.set(x, y, 1);
}
}
aa.build();
ab.build();
bb.build();
rep(sy, 0, D) rep(sx, 0, D) {
int ok = 1;
if (0 < b) {
if (bb.get(sx, sy, sx + b - 1, sy + b - 1))
ok = 0;
if (ab.get(sx, sy + b, sx + b - 1, sy + D - 1))
ok = 0;
if (ab.get(sx + b, sy, sx + D - 1, sy + b - 1))
ok = 0;
}
if (aa.get(sx + b, sy + b, sx + D - 1, sy + D - 1))
ok = 0;
if (ok)
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> D;
rep(i, 0, N) cin >> X[i] >> Y[i];
rep(i, 0, N) cnt[Y[i] % D][X[i] % D]++;
check(2);
int ng = 1, ok = inf;
while (ng + 1 != ok) {
int md = (ng + ok) / 2;
if (check(md))
ok = md;
else
ng = md;
}
cout << ok - 1 << endl;
}
| replace | 97 | 98 | 97 | 98 | -11 | |
p03217 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch & 15;
while (isdigit(ch = getchar()))
num = num * 10 + (ch & 15);
if (neg)
num = -num;
}
int N, D, A[1005][1005], k;
ll ans = infll;
int f[2005][2005], g[2005][2005], sf[2005][2005], sg[2005][2005];
inline bool check(int a[][2005], const int &lx, const int &ly, const int &rx,
const int &ry) {
if (lx > rx || ly > ry)
return 1;
return a[rx][ry] - a[rx][ly - 1] - a[lx - 1][ry] + a[lx - 1][ly - 1] ==
(rx - lx + 1) * (ry - ly + 1);
}
inline bool check(const int &x, const int &y, const int &b) {
return check(sf, x + b + 1, y + b + 1, x + D - 1, y + D - 1) &&
check(sg, x, y + b + 1, x + D - 1, y + D - 1) &&
check(sg, x + b + 1, y, x + D - 1, y + D - 1);
}
inline ll calc(const int &x, const int &y) {
int l = 0, r = D - 1;
while (l < r) {
const int mid = l + r >> 1;
if (check(x, y, mid))
r = mid;
else
l = mid + 1;
}
return k * (ll)D + l;
}
int main() {
getint(N), getint(D);
if (N == 1)
return puts("0"), 0;
for (register int i = 1, x, y; i <= N; i++)
getint(x), getint(y), A[x % D][y % D]++;
for (register int i = 0; i < D; i++)
for (register int j = 0; j < D; j++)
k = max(k, A[i][j]);
k = (int)sqrt(k - 0.5);
for (register int i = 0, F = k * k, G = k * (k + 1); i < D; i++)
for (register int j = 0; j < D; j++) {
f[i][j] = f[i + D][j] = f[i][j + D] = f[i + D][j + D] = A[i][j] <= F;
g[i][j] = g[i + D][j] = g[i][j + D] = g[i + D][j + D] = A[i][j] <= G;
}
sf[0][0] = f[0][0], sg[0][0] = g[0][0];
for (register int i = 1; i < (D << 1); i++) {
sf[0][i] = sf[0][i - 1] + f[0][i], sg[0][i] = sg[0][i - 1] + g[0][i];
sf[i][0] = sf[i - 1][0] + f[i][0], sg[i][0] = sg[i - 1][0] + g[i][0];
}
for (register int i = 1; i < (D << 1); i++)
for (register int j = 1; j < (D << 1); j++) {
sf[i][j] = sf[i][j - 1] + sf[i - 1][j] - sf[i - 1][j - 1] + f[i][j];
sg[i][j] = sg[i][j - 1] + sg[i - 1][j] - sg[i - 1][j - 1] + g[i][j];
}
for (register int i = 0; i < D; i++)
for (register int j = 0; j < D; j++)
ans = min(ans, calc(i, j));
return printf("%lld\n", ans), 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch & 15;
while (isdigit(ch = getchar()))
num = num * 10 + (ch & 15);
if (neg)
num = -num;
}
int N, D, A[1005][1005], k;
ll ans = infll;
int f[2005][2005], g[2005][2005], sf[2005][2005], sg[2005][2005];
inline bool check(int a[][2005], const int &lx, const int &ly, const int &rx,
const int &ry) {
if (lx > rx || ly > ry)
return 1;
return a[rx][ry] - (ly ? a[rx][ly - 1] : 0) - (lx ? a[lx - 1][ry] : 0) +
(lx && ly ? a[lx - 1][ly - 1] : 0) ==
(rx - lx + 1) * (ry - ly + 1);
}
inline bool check(const int &x, const int &y, const int &b) {
return check(sf, x + b + 1, y + b + 1, x + D - 1, y + D - 1) &&
check(sg, x, y + b + 1, x + D - 1, y + D - 1) &&
check(sg, x + b + 1, y, x + D - 1, y + D - 1);
}
inline ll calc(const int &x, const int &y) {
int l = 0, r = D - 1;
while (l < r) {
const int mid = l + r >> 1;
if (check(x, y, mid))
r = mid;
else
l = mid + 1;
}
return k * (ll)D + l;
}
int main() {
getint(N), getint(D);
if (N == 1)
return puts("0"), 0;
for (register int i = 1, x, y; i <= N; i++)
getint(x), getint(y), A[x % D][y % D]++;
for (register int i = 0; i < D; i++)
for (register int j = 0; j < D; j++)
k = max(k, A[i][j]);
k = (int)sqrt(k - 0.5);
for (register int i = 0, F = k * k, G = k * (k + 1); i < D; i++)
for (register int j = 0; j < D; j++) {
f[i][j] = f[i + D][j] = f[i][j + D] = f[i + D][j + D] = A[i][j] <= F;
g[i][j] = g[i + D][j] = g[i][j + D] = g[i + D][j + D] = A[i][j] <= G;
}
sf[0][0] = f[0][0], sg[0][0] = g[0][0];
for (register int i = 1; i < (D << 1); i++) {
sf[0][i] = sf[0][i - 1] + f[0][i], sg[0][i] = sg[0][i - 1] + g[0][i];
sf[i][0] = sf[i - 1][0] + f[i][0], sg[i][0] = sg[i - 1][0] + g[i][0];
}
for (register int i = 1; i < (D << 1); i++)
for (register int j = 1; j < (D << 1); j++) {
sf[i][j] = sf[i][j - 1] + sf[i - 1][j] - sf[i - 1][j - 1] + f[i][j];
sg[i][j] = sg[i][j - 1] + sg[i - 1][j] - sg[i - 1][j - 1] + g[i][j];
}
for (register int i = 0; i < D; i++)
for (register int j = 0; j < D; j++)
ans = min(ans, calc(i, j));
return printf("%lld\n", ans), 0;
} | replace | 30 | 31 | 30 | 32 | 0 | |
p03217 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX 100002
int n;
int d;
int cnt[1002][1002];
inline int rng(int a, int b, int c) { // count [a,b] x%d==c
int below = (a / d) * d + c;
while (below < a) {
below += d;
}
int up = (b / d) * d + c;
while (up > b) {
up -= d;
}
if (below > up)
return 0;
return (up - below) / d + 1;
}
vector<pair<int, pair<int, int>>> vv;
bool valid(int x, int y, int len) {
long long int guarantee = len / d;
guarantee *= guarantee;
for (int i1 = 0; i1 < vv.size(); i1++) {
int i = vv[i1].second.first;
int j = vv[i1].second.second;
long long int validx = rng(x, x + len, i);
long long int validy = rng(y, y + len, j);
validx *= validy;
if (validx < cnt[i][j]) {
return false;
}
if (cnt[i][j] == 0)
break;
if (cnt[i][j] <= guarantee)
break;
}
return true;
}
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
cnt[x % d][y % d]++;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < d; j++) {
vv.push_back(make_pair(cnt[i][j], make_pair(i, j)));
}
}
sort(vv.begin(), vv.end());
reverse(vv.begin(), vv.end());
int ans = 1000000;
for (int ii = 0; ii < vv.size(); ii++) {
int i = vv[ii].second.first;
int j = vv[ii].second.second;
int mint = 0;
int maxt = ans;
if (valid(i, j, ans - 1) == false)
continue;
else {
maxt = ans - 1;
if (mint > maxt)
continue;
while (mint + 1 < maxt) {
int mid = (mint + maxt) / 2;
if (valid(i, j, mid)) {
maxt = mid;
} else {
mint = mid + 1;
}
}
if (valid(i, j, mint)) {
maxt = mint;
} else {
mint = maxt;
}
ans = min(ans, mint);
}
if (ii % 40 == 0 && d > 30 && clock() / (double)(CLOCKS_PER_SEC) > 2.2)
break;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX 100002
int n;
int d;
int cnt[1002][1002];
inline int rng(int a, int b, int c) { // count [a,b] x%d==c
int below = (a / d) * d + c;
while (below < a) {
below += d;
}
int up = (b / d) * d + c;
while (up > b) {
up -= d;
}
if (below > up)
return 0;
return (up - below) / d + 1;
}
vector<pair<int, pair<int, int>>> vv;
bool valid(int x, int y, int len) {
long long int guarantee = len / d;
guarantee *= guarantee;
for (int i1 = 0; i1 < vv.size(); i1++) {
int i = vv[i1].second.first;
int j = vv[i1].second.second;
long long int validx = rng(x, x + len, i);
long long int validy = rng(y, y + len, j);
validx *= validy;
if (validx < cnt[i][j]) {
return false;
}
if (cnt[i][j] == 0)
break;
if (cnt[i][j] <= guarantee)
break;
}
return true;
}
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
cnt[x % d][y % d]++;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < d; j++) {
vv.push_back(make_pair(cnt[i][j], make_pair(i, j)));
}
}
sort(vv.begin(), vv.end());
reverse(vv.begin(), vv.end());
int ans = 1000000;
for (int ii = 0; ii < vv.size(); ii++) {
int i = vv[ii].second.first;
int j = vv[ii].second.second;
int mint = 0;
int maxt = ans;
if (valid(i, j, ans - 1) == false) {
} else {
maxt = ans - 1;
if (mint > maxt)
continue;
while (mint + 1 < maxt) {
int mid = (mint + maxt) / 2;
if (valid(i, j, mid)) {
maxt = mid;
} else {
mint = mid + 1;
}
}
if (valid(i, j, mint)) {
maxt = mint;
} else {
mint = maxt;
}
ans = min(ans, mint);
}
if (ii % 40 == 0 && d > 30 && clock() / (double)(CLOCKS_PER_SEC) > 2.2)
break;
}
cout << ans << endl;
return 0;
} | replace | 94 | 97 | 94 | 97 | TLE | |
p03219 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAXN 100100
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
int a, b;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
cout << a + b / 2;
} | #include <bits/stdc++.h>
#define MAXN 100100
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
int a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
cout << a + b / 2;
} | delete | 11 | 14 | 11 | 11 | 0 | |
p03219 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x, y;
int ans = 0;
while (scanf("%d%d", &x, &y)) {
ans = 0;
ans = x + y / 2;
printf("%d\n", ans);
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x, y;
int ans = 0;
scanf("%d%d", &x, &y);
ans = 0;
ans = x + y / 2;
printf("%d\n", ans);
return 0;
} | replace | 8 | 13 | 8 | 12 | TLE | |
p03219 | Python | Runtime Error | x, y = map(int(), input().split(" "))
print(x + y // 2)
| x, y = map(int, input().split(" "))
print(x + y // 2)
| replace | 0 | 1 | 0 | 1 | TypeError: 'int' object is not callable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03219/Python/s777207884.py", line 1, in <module>
x, y = map(int(), input().split(' '))
TypeError: 'int' object is not callable
|
p03219 | Python | Runtime Error | x, y = map(int, input().split())
print(int(x + y / 2))
x, y = map(int, input().split())
print(int(x + y / 2))
| x, y = map(int, input().split())
print(int(x + y / 2))
| delete | 3 | 6 | 3 | 3 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03219/Python/s372051841.py", line 4, in <module>
x, y = map(int, input().split())
EOFError: EOF when reading a line
|
p03219 | Python | Runtime Error | def solve():
x, y = map(int, input())
return x + y // 2
if __name__ == "__main__":
print(solve())
| def solve():
x, y = map(int, input().split())
return x + y // 2
if __name__ == "__main__":
print(solve())
| replace | 1 | 2 | 1 | 2 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03219/Python/s803037603.py", line 7, in <module>
print(solve())
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03219/Python/s803037603.py", line 2, in solve
x, y = map(int, input())
ValueError: invalid literal for int() with base 10: ' '
|
p03219 | C++ | Runtime Error | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!! ! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!
!!!!
*/
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
cout << (x + y / 2);
return 0;
} | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!! ! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!
!!!!
*/
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
// freopen("input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
cout << (x + y / 2);
return 0;
} | replace | 58 | 59 | 58 | 59 | 0 | |
p03219 | C++ | Runtime Error | // Devarshi
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const int maxn = 1000001;
int main() {
sync
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int x, y;
cin >> x >> y;
cout << x + y / 2;
return 0;
}
| // Devarshi
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const int maxn = 1000001;
int main() {
sync
int x,
y;
cin >> x >> y;
cout << x + y / 2;
return 0;
}
| replace | 44 | 52 | 44 | 46 | 0 | |
p03219 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
freopen("input.txt", "r", stdin);
int x, y;
cin >> x >> y;
cout << x + y / 2 << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int x, y;
cin >> x >> y;
cout << x + y / 2 << "\n";
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03219 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y;
cin >> x >> y;
cout << (x + y / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y;
cin >> x >> y;
cout << (x + y / 2) << endl;
} | delete | 6 | 10 | 6 | 6 | 0 | |
p03220 | Python | Runtime Error | n = int(input())
t, a = map(int, input().split())
list = [int(i) for i in input().split()]
dif_list = []
answer = 0
for i in range(n):
t_i = t - list(i) * 0.006
t_i_dif = abs(a - t_i)
dif_list.append(t_i_dif)
if min(dif_list) == t_i_dif:
answer = i + 1
print(answer)
| n = int(input())
t, a = map(int, input().split())
list = [int(i) for i in input().split()]
dif_list = []
answer = 0
for i in range(n):
t_i = t - list[i] * 0.006
t_i_dif = abs(a - t_i)
dif_list.append(t_i_dif)
if min(dif_list) == t_i_dif:
answer = i + 1
print(answer)
| replace | 8 | 9 | 8 | 9 | TypeError: 'list' object is not callable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03220/Python/s862713349.py", line 9, in <module>
t_i = t - list(i) * 0.006
TypeError: 'list' object is not callable
|
p03220 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[N + 10], min = 100000, B[N + 10], ans;
double tem;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
tem = T - H[i] * 0.006;
B[i] = A - tem;
if (B[i] < 0) {
B[i] = B[i] * (-1);
}
}
for (int i = 0; i < N; i++) {
if (min > B[i]) {
min = B[i];
ans = i;
}
}
cout << ans + 1 << endl;
}
| #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[1009], ans;
double tem, B[1009], min = 10000000;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
tem = T - H[i] * 0.006;
B[i] = A - tem;
if (B[i] < 0) {
B[i] = B[i] * (-1);
}
}
for (int i = 0; i < N; i++) {
if (min > B[i]) {
min = B[i];
ans = i;
}
}
cout << ans + 1 << endl;
}
| replace | 8 | 10 | 8 | 10 | 0 | |
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
double abs(double x, double y) {
if (x >= y) {
return x - y;
} else {
return y - x;
}
}
int main() {
int N, T, A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 1;
double tem = abs(A, T - 0.006 * H.at(0));
for (int i = 1; i < N; i++) {
if (tem > abs(A, T - 0.006 * H.at(i))) {
tem = abs(A, T - 0.006 * H.at(i));
ans = i + 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
double abs(double x, double y) {
if (x >= y) {
return x - y;
} else {
return y - x;
}
}
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 1;
double tem = abs(A, T - 0.006 * H.at(0));
for (int i = 1; i < N; i++) {
if (tem > abs(A, T - 0.006 * H.at(i))) {
tem = abs(A, T - 0.006 * H.at(i));
ans = i + 1;
}
}
cout << ans << endl;
} | insert | 12 | 12 | 12 | 13 | 0 | |
p03220 | C++ | Runtime Error | /*
chirag11032000
Chirag Thakur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define pb push_back
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const db PI = acos(-1);
const ll MOD = 1e9 + 7, INF = LLONG_MAX;
const ll N = 50 + 10;
ll arr[N];
void test_case();
int main() {
fast_io();
test_case();
cerr << "Time taken: " << int((clock() * 1000.) / CLOCKS_PER_SEC) << "ms\n";
return 0;
}
void test_case() {
ll n, t, a;
cin >> n >> t >> a;
db diff = INF;
ll ind = -1;
for (ll i = 0; i < n; ++i) {
cin >> arr[i];
db curr = t - 0.006 * arr[i];
if (abs(curr - a) < diff) {
diff = abs(curr - a);
ind = i + 1;
}
}
cout << ind << endl;
} | /*
chirag11032000
Chirag Thakur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define pb push_back
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const db PI = acos(-1);
const ll MOD = 1e9 + 7, INF = LLONG_MAX;
const ll N = 1000 + 10;
ll arr[N];
void test_case();
int main() {
fast_io();
test_case();
cerr << "Time taken: " << int((clock() * 1000.) / CLOCKS_PER_SEC) << "ms\n";
return 0;
}
void test_case() {
ll n, t, a;
cin >> n >> t >> a;
db diff = INF;
ll ind = -1;
for (ll i = 0; i < n; ++i) {
cin >> arr[i];
db curr = t - 0.006 * arr[i];
if (abs(curr - a) < diff) {
diff = abs(curr - a);
ind = i + 1;
}
}
cout << ind << endl;
} | replace | 44 | 45 | 44 | 45 | 0 | Time taken: 35ms
|
p03220 | C++ | Runtime Error | // Author: Jinhai Chen
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int n, A, t;
const int maxn = 1e5 + 10;
double h[maxn], a[maxn];
int main() {
#ifndef ONLINE_JUDGE
freopen("data.in", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin >> n >> t >> A;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
a[i] = t - 0.006 * h[i];
double g = 1e19;
int ans = -1;
for (int i = 1; i <= n; i++) {
if (fabs(a[i] - A) < g) {
g = fabs(a[i] - A);
ans = i;
}
}
cout << ans << endl;
return 0;
}
| // Author: Jinhai Chen
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int n, A, t;
const int maxn = 1e5 + 10;
double h[maxn], a[maxn];
int main() {
#ifndef ONLINE_JUDGE
// freopen("data.in","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> n >> t >> A;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
a[i] = t - 0.006 * h[i];
double g = 1e19;
int ans = -1;
for (int i = 1; i <= n; i++) {
if (fabs(a[i] - A) < g) {
g = fabs(a[i] - A);
ans = i;
}
}
cout << ans << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
map<double, int> score;
for (int i = 0; i < a; i++) {
double d;
cin >> d;
score[b - d * 0.006] = i + 1;
}
double MIN = 10000000;
int minkey = 0;
for (auto p : score) {
auto key = p.first;
auto value = p.second;
double lon = abs(key - c);
if (lon < MIN) {
MIN = lon;
minkey = key;
}
}
cout << score.at(minkey) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
map<double, int> score;
for (int i = 0; i < a; i++) {
double d;
cin >> d;
score[b - d * 0.006] = i + 1;
}
double MIN = 10000000;
double minkey = 0;
for (auto p : score) {
auto key = p.first;
auto value = p.second;
double lon = abs(key - c);
if (lon < MIN) {
MIN = lon;
minkey = key;
}
}
cout << score.at(minkey) << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[100];
rep(i, n) { cin >> h[i]; }
float tmp, dif = FLT_MAX;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
dif = abs(tmp - a);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1000];
rep(i, n) { cin >> h[i]; }
float tmp, dif = FLT_MAX;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
dif = abs(tmp - a);
}
}
cout << ans;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03220 | Python | Runtime Error | n = int(input())
t, a = map(int, input().split())
t *= 1000
a *= 1000
lst = list(map(int, input().split()))
tmp = abs(t - 6 * lst[0] - a)
tmpa = 0
for i in range(1, n):
temp = abs(t - 6 * lst[i] - a)
if temp < tmp:
tmp = tmp
tmpa = i
print(tmpa + 1)
n = int(input())
t, a = map(int, input().split())
t *= 1000
a *= 1000
lst = list(map(int, input().split()))
tmp = abs(t - 6 * lst[0] - a)
tmpa = 0
for i in range(1, n):
temp = abs(t - 6 * lst[i] - a)
if temp < tmp:
tmp = temp
tmpa = i
print(tmpa + 1)
| n = int(input())
t, a = map(int, input().split())
t *= 1000
a *= 1000
lst = list(map(int, input().split()))
tmp = abs(t - 6 * lst[0] - a)
tmpa = 0
for i in range(1, n):
temp = abs(t - 6 * lst[i] - a)
if temp < tmp:
tmp = temp
tmpa = i
print(tmpa + 1)
| delete | 0 | 13 | 0 | 0 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03220/Python/s164286419.py", line 14, in <module>
n = int(input())
EOFError: EOF when reading a line
|
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
double t, a;
cin >> n >> t >> a;
double h[100];
int ok = 1;
for (int i = 1; i <= n; i++) {
cin >> h[i];
double v1 = t - h[ok] * 0.006;
double v2 = t - h[i] * 0.006;
if (abs(a - v1) >= abs(a - v2))
ok = i;
}
cout << ok << endl;
return 0;
}
| #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
double t, a;
cin >> n >> t >> a;
double h[1005];
int ok = 1;
for (int i = 1; i <= n; i++) {
cin >> h[i];
double v1 = t - h[ok] * 0.006;
double v2 = t - h[i] * 0.006;
if (abs(a - v1) >= abs(a - v2))
ok = i;
}
cout << ok << endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
fast();
// ll t;cin>>t;while(t--)
{
ll n, s = 0, t, A;
cin >> n;
cin >> t >> A;
ll a[n];
double b[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
b[i] = t - a[i] * 0.006;
}
double min = abs(b[0] - A);
int index = 0;
for (int i = 1; i < n; i++) {
double x = abs(A - b[i]);
if (min > x) {
index = i;
min = x;
}
}
cout << index + 1 << endl;
cerr << "hello" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
fast();
// ll t;cin>>t;while(t--)
{
ll n, s = 0, t, A;
cin >> n;
cin >> t >> A;
ll a[n];
double b[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
b[i] = t - a[i] * 0.006;
}
double min = abs(b[0] - A);
int index = 0;
for (int i = 1; i < n; i++) {
double x = abs(A - b[i]);
if (min > x) {
index = i;
min = x;
}
}
cout << index + 1 << endl;
cerr << "hello" << endl;
}
return 0;
} | replace | 51 | 57 | 51 | 57 | -11 | |
p03220 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define M 1003
int main() {
int N, T, A, H[N];
double ret[N], re[N];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
ret[i] = abs(T - H[i] * 0.006 - A);
re[i] = ret[i];
}
sort(re, re + N);
for (int i = 0; i < N; i++) {
if (ret[i] == re[0]) {
cout << i + 1 << endl;
break;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define M 1003
int main() {
int N, T, A, H[M];
double ret[M], re[M];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
ret[i] = abs(T - H[i] * 0.006 - A);
re[i] = ret[i];
}
sort(re, re + N);
for (int i = 0; i < N; i++) {
if (ret[i] == re[0]) {
cout << i + 1 << endl;
break;
}
}
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p03220 | Python | Runtime Error | N = int(input())
T, A = map(int, input().split())
(*H,) = [map(int, input().split())]
min = 10000000
ans = 0
for i in range(N):
if min > abs(A - T + H[i] * 0.006):
min = abs(A - T + H[i] * 0.006)
ans = i
print(ans)
| N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
X = [abs(A - (T - h * 0.006)) for h in H]
print(X.index(min(X)) + 1)
| replace | 2 | 10 | 2 | 5 | TypeError: unsupported operand type(s) for *: 'map' and 'float' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03220/Python/s870153227.py", line 7, in <module>
if min > abs(A - T + H[i] * 0.006):
TypeError: unsupported operand type(s) for *: 'map' and 'float'
|
p03220 | Python | Runtime Error | n = int(input())
t, a = map(int, input().split())
b = [abs(a - (t - i * 0.006)) for i in list(map(int, input().split()))]
print(b.index(min(b) + 1))
| n = int(input())
t, a = map(int, input().split())
b = [abs(a - (t - i * 0.006)) for i in list(map(int, input().split()))]
print(b.index(min(b)) + 1)
| replace | 3 | 4 | 3 | 4 | ValueError: 2.0 is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03220/Python/s852227382.py", line 4, in <module>
print(b.index(min(b) + 1))
ValueError: 2.0 is not in list
|
p03220 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
cin >> H.at(i);
int d = (T * 1000 - H.at(i) * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N + 10);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
cin >> H.at(i);
int d = (T * 1000 - H.at(i) * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
cout << res << endl;
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
#define INF (int)2e9
int main() {
int n, m;
cin >> n >> m;
int p[m], y[m];
map<int, vector<int>> mp;
rep(i, m) {
cin >> p[i] >> y[i];
mp[p[i]].emplace_back(y[i]);
}
for (auto &p : mp) {
sort(p.second.begin(), p.second.end());
}
rep(i, m) {
for (int j = 0; j < mp[p[i]].size(); j++) {
if (mp[p[i]][j] == y[i]) {
printf("%06d", p[i]);
printf("%06d\n", j + 1);
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
#define INF (int)2e9
int main() {
int n, m;
cin >> n >> m;
int p[m], y[m];
map<int, vector<int>> mp;
rep(i, m) {
cin >> p[i] >> y[i];
mp[p[i]].emplace_back(y[i]);
}
for (auto &p : mp) {
sort(p.second.begin(), p.second.end());
}
rep(i, m) {
int num =
lower_bound(mp[p[i]].begin(), mp[p[i]].end(), y[i]) - mp[p[i]].begin();
printf("%06d", p[i]);
printf("%06d\n", num + 1);
}
return 0;
} | replace | 24 | 31 | 24 | 28 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, i;
cin >> N;
cin >> M;
vector<pair<int, int>> p(M);
vector<int> Y(M);
vector<int> app(M);
vector<string> SN(M);
// map< int, int > orig;
unordered_map<int, int> orig;
int P;
for (i = 0; i < M; i++) {
cin >> P;
cin >> Y[i];
p[i] = make_pair(Y[i], P);
orig[Y[i]] = i;
}
sort(p.begin(), p.end());
int temp, num, j, index;
for (i = 0; i < M; i++) {
app[p[i].second]++;
num = app[p[i].second];
index = orig[p[i].first];
string s1 = to_string(num); // build order
string s2 = to_string(p[i].second); // num of pref.
for (j = 0; j < 6 - s2.size(); j++)
SN[index].push_back('0');
SN[index] += s2;
for (j = 0; j < 6 - s1.size(); j++)
SN[index].push_back('0');
SN[index] += s1;
}
for (i = 0; i < M; i++) {
cout << SN[i] << '\n';
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, i;
cin >> N;
cin >> M;
vector<pair<int, int>> p(M);
vector<int> Y(M);
vector<int> app(N);
vector<string> SN(M);
// map< int, int > orig;
unordered_map<int, int> orig;
int P;
for (i = 0; i < M; i++) {
cin >> P;
cin >> Y[i];
p[i] = make_pair(Y[i], P);
orig[Y[i]] = i;
}
sort(p.begin(), p.end());
int temp, num, j, index;
for (i = 0; i < M; i++) {
app[p[i].second]++;
num = app[p[i].second];
index = orig[p[i].first];
string s1 = to_string(num); // build order
string s2 = to_string(p[i].second); // num of pref.
for (j = 0; j < 6 - s2.size(); j++)
SN[index].push_back('0');
SN[index] += s2;
for (j = 0; j < 6 - s1.size(); j++)
SN[index].push_back('0');
SN[index] += s1;
}
for (i = 0; i < M; i++) {
cout << SN[i] << '\n';
}
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(c) c.begin(), c.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> v(N + 1);
REP(i, M) {
int P, Y;
cin >> P >> Y;
v[P].PB(MP(Y, i));
}
vector<pair<int, int>> v2(N);
for (int i = 1; i <= N; i++) {
if (!v[i].empty()) {
sort(ALL(v[i]));
REP(j, v[i].size()) { v2[v[i][j].SE] = MP(i, j + 1); }
}
}
REP(i, M) {
cout << setfill('0') << setw(6) << v2[i].FI << setfill('0') << setw(6)
<< v2[i].SE << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(c) c.begin(), c.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> v(N + 1);
REP(i, M) {
int P, Y;
cin >> P >> Y;
v[P].PB(MP(Y, i));
}
vector<pair<int, int>> v2(M);
for (int i = 1; i <= N; i++) {
if (!v[i].empty()) {
sort(ALL(v[i]));
REP(j, v[i].size()) { v2[v[i][j].SE] = MP(i, j + 1); }
}
}
REP(i, M) {
cout << setfill('0') << setw(6) << v2[i].FI << setfill('0') << setw(6)
<< v2[i].SE << endl;
}
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct cities {
int pref, city, idx;
bool operator<(const cities &c) const {
return (pref < c.pref || city < c.city);
}
};
int main() {
int n, m, x = 0, y;
cin >> n >> m;
vector<cities> v(m);
vector<pair<int, char *>> a(m);
rep(i, m) {
cin >> v[i].pref >> v[i].city;
v[i].idx = i;
}
sort(v.begin(), v.end());
rep(i, m) {
if (x != v[i].pref) {
x = v[i].pref;
y = 1;
}
char *c = new char[13];
sprintf(c, "%06d%06d", v[i].pref, y++);
a[i].first = v[i].idx;
a[i].second = c;
}
sort(a.begin(), a.end());
rep(i, m) printf("%s\n", a[i].second);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct cities {
int pref, city, idx;
bool operator<(const cities &c) const {
return (pref < c.pref || (pref == c.pref && city < c.city));
}
};
int main() {
int n, m, x = 0, y;
cin >> n >> m;
vector<cities> v(m);
vector<pair<int, char *>> a(m);
rep(i, m) {
cin >> v[i].pref >> v[i].city;
v[i].idx = i;
}
sort(v.begin(), v.end());
rep(i, m) {
if (x != v[i].pref) {
x = v[i].pref;
y = 1;
}
char *c = new char[13];
sprintf(c, "%06d%06d", v[i].pref, y++);
a[i].first = v[i].idx;
a[i].second = c;
}
sort(a.begin(), a.end());
rep(i, m) printf("%s\n", a[i].second);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma region _define
#define f(i, a, b) for (int i = a; i < b; i++)
#define f_vI(v, n) f(i, 0, n) cin >> v[i]
#define f_v2I(v1, v2, n) f(i, 0, n) cin >> v1[i] >> v2[i]
#define f_v3I(v1, v2, v3, n) f(i, 0, n) cin >> v1[i] >> v2[i] >> v3[i]
#define f_vO(v, n) f(i, 0, n) cout << v[i] << endl
#define all(a) a.begin(), a.end()
#define size(s) s.size()
#define endl "\n"
#define _y() cout << "Yes" << endl
#define _Y() cout << "YES" << endl
#define _n() cout << "No" << endl
#define _N() cout << "NO" << endl
#pragma endregion
#pragma region _using
using namespace std;
using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using si = stack<LL>;
using pi = pair<LL, LL>;
using v_pi = vector<pi>;
#pragma endregion
#pragma region _graph
#define node 50
// bool graph[node][node]; bool visited[node] = { false };
#define link(a, b) \
f(i, 0, n) { \
cin >> a[i] >> b[i]; \
a[i]--; \
b[i]--; \
graph[a[i]][b[i]] = graph[b[i]][a[i]] = true; \
}
#pragma endregion
LL gcd(LL a, LL b) {
LL r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
LL lcm(LL a, LL b) { return (a / gcd(a, b) * b); }
/*****************************************************************************/
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vi p(m), y(m);
vvi y_num(m + 1);
f(i, 0, m) {
cin >> p[i] >> y[i];
y_num[p[i]].push_back(y[i]);
}
f(i, 0, n) { sort(all(y_num[i + 1])); }
f(i, 0, m) {
cout << setw(6) << setfill('0') << p[i];
cout << setw(6) << setfill('0')
<< LL(lower_bound(all(y_num[p[i]]), y[i]) - y_num[p[i]].begin() + 1);
cout << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma region _define
#define f(i, a, b) for (int i = a; i < b; i++)
#define f_vI(v, n) f(i, 0, n) cin >> v[i]
#define f_v2I(v1, v2, n) f(i, 0, n) cin >> v1[i] >> v2[i]
#define f_v3I(v1, v2, v3, n) f(i, 0, n) cin >> v1[i] >> v2[i] >> v3[i]
#define f_vO(v, n) f(i, 0, n) cout << v[i] << endl
#define all(a) a.begin(), a.end()
#define size(s) s.size()
#define endl "\n"
#define _y() cout << "Yes" << endl
#define _Y() cout << "YES" << endl
#define _n() cout << "No" << endl
#define _N() cout << "NO" << endl
#pragma endregion
#pragma region _using
using namespace std;
using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using si = stack<LL>;
using pi = pair<LL, LL>;
using v_pi = vector<pi>;
#pragma endregion
#pragma region _graph
#define node 50
// bool graph[node][node]; bool visited[node] = { false };
#define link(a, b) \
f(i, 0, n) { \
cin >> a[i] >> b[i]; \
a[i]--; \
b[i]--; \
graph[a[i]][b[i]] = graph[b[i]][a[i]] = true; \
}
#pragma endregion
LL gcd(LL a, LL b) {
LL r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
LL lcm(LL a, LL b) { return (a / gcd(a, b) * b); }
/*****************************************************************************/
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vi p(100000), y(100000);
vvi y_num(100001);
f(i, 0, m) {
cin >> p[i] >> y[i];
y_num[p[i]].push_back(y[i]);
}
f(i, 0, n) { sort(all(y_num[i + 1])); }
f(i, 0, m) {
cout << setw(6) << setfill('0') << p[i];
cout << setw(6) << setfill('0')
<< LL(lower_bound(all(y_num[p[i]]), y[i]) - y_num[p[i]].begin() + 1);
cout << endl;
}
return 0;
} | replace | 82 | 84 | 82 | 84 | 0 | |
p03221 | Python | Time Limit Exceeded | n, m = map(int, input().split())
pys = [list(map(int, input().split())) for _ in range(m)]
map_ = {}
for i, (p, y) in enumerate(pys):
map_.setdefault(p, [])
for j in range(len(map_[p])):
if y < pys[map_[p][j]][1]:
map_[p].insert(j, i)
break
else:
map_[p].append(i)
ans = [None] * m
for key, val in map_.items():
for num, i in enumerate(val):
ans[i] = "{:06d}".format(key) + "{:06d}".format(num + 1)
for a in ans:
print(a)
| n, m = map(int, input().split())
pys = [list(map(int, input().split())) for _ in range(m)]
map_ = {}
for i, (p, y) in enumerate(pys):
map_.setdefault(p, [])
map_[p].append(i)
for val in map_.values():
val.sort(key=lambda i: pys[i][1])
ans = [None] * m
for key, val in map_.items():
for num, i in enumerate(val):
ans[i] = "{:06d}".format(key) + "{:06d}".format(num + 1)
for a in ans:
print(a)
| replace | 5 | 11 | 5 | 10 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define INF (1 << 30)
#define LLINF (1 << 60)
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int p[10000], y[10000];
vector<int> yd[10001];
cin >> n >> m;
rep(i, m) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
rep(i, n) sort(yd[i + 1].begin(), yd[i + 1].end());
rep(i, m) printf("%012lld\n",
ll(p[i]) * 1000000 +
int(lower_bound(yd[p[i]].begin(), yd[p[i]].end(), y[i]) -
yd[p[i]].begin()) +
1);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define INF (1 << 30)
#define LLINF (1 << 60)
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int p[100000], y[100000];
vector<int> yd[100001];
cin >> n >> m;
rep(i, m) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
rep(i, n) sort(yd[i + 1].begin(), yd[i + 1].end());
rep(i, m) printf("%012lld\n",
ll(p[i]) * 1000000 +
int(lower_bound(yd[p[i]].begin(), yd[p[i]].end(), y[i]) -
yd[p[i]].begin()) +
1);
return 0;
}
| replace | 35 | 37 | 35 | 37 | 0 | |
p03221 | Python | Runtime Error | import collections
City = collections.namedtuple("City", ("number", "pref", "year"))
n, m = [int(i) for i in input().split()]
cities = []
for i in range(m):
pref, year = input().split()
city = City(i, int(pref), int(year))
cities.append(city)
id_numbers = []
cities.sort(key=lambda x: x.year)
cities.sort(key=lambda x: x.pref)
prev_pref = None
for city in cities:
if prev_pref is None or city.pref != prev_pref:
rank = 1
else:
rank += 1
id_numbers.append((city.number, city.pref, rank))
prev_pref = city.pref
id_numbers.sort(key=lambda x: x[0])
for i in id_numbers:
print(f"{i[1]:0>6}{i[2]:0>6}")
| import collections
City = collections.namedtuple("City", ("number", "pref", "year"))
n, m = [int(i) for i in input().split()]
cities = []
for i in range(m):
pref, year = input().split()
city = City(i, int(pref), int(year))
cities.append(city)
id_numbers = []
cities.sort(key=lambda x: x.year)
cities.sort(key=lambda x: x.pref)
prev_pref = None
for city in cities:
if prev_pref is None or city.pref != prev_pref:
rank = 1
else:
rank += 1
id_numbers.append((city.number, city.pref, rank))
prev_pref = city.pref
id_numbers.sort(key=lambda x: x[0])
for i in id_numbers:
print("{:0>6}{:0>6}".format(i[1], i[2]))
| replace | 23 | 24 | 23 | 24 | 0 | |
p03221 | C++ | Runtime Error | /* *
*
* Author: Hamkor
*
* */
#include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
#define ll long long
#define ld long double
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VI vector<int>
#define VII vector<pair<int, int>>
#define VLL vector<pair<ll, ll>>
#define PB push_back()
#define B begin()
#define E end()
#define F first
#define S second
#define SZ size()
#define P complex<ll>
#define X real()
#define Y imag()
const int oo = 1e9;
const ll mod = 1e7;
/* * * * * * * * * * */
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n + 1, vector<int>());
VI p(n + 1), y(m + 1);
for (int i = 0; i < m; ++i) {
cin >> p[i] >> y[i];
a[p[i]].push_back(y[i]);
}
for (int i = 1; i <= n; ++i)
sort(a[i].B, a[i].E);
for (int i = 0; i < m; ++i) {
cout << right << setw(6) << setfill('0') << p[i];
int j = lower_bound(a[p[i]].B, a[p[i]].E, y[i]) - a[p[i]].B + 1;
cout << right << setw(6) << setfill('0') << j << "\n";
}
return 0;
}
| /* *
*
* Author: Hamkor
*
* */
#include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
#define ll long long
#define ld long double
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VI vector<int>
#define VII vector<pair<int, int>>
#define VLL vector<pair<ll, ll>>
#define PB push_back()
#define B begin()
#define E end()
#define F first
#define S second
#define SZ size()
#define P complex<ll>
#define X real()
#define Y imag()
const int oo = 1e9;
const ll mod = 1e7;
/* * * * * * * * * * */
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n + 1, vector<int>());
VI p(1e5 + 10), y(1e5 + 10);
for (int i = 0; i < m; ++i) {
cin >> p[i] >> y[i];
a[p[i]].push_back(y[i]);
}
for (int i = 1; i <= n; ++i)
sort(a[i].B, a[i].E);
for (int i = 0; i < m; ++i) {
cout << right << setw(6) << setfill('0') << p[i];
int j = lower_bound(a[p[i]].B, a[p[i]].E, y[i]) - a[p[i]].B + 1;
cout << right << setw(6) << setfill('0') << j << "\n";
}
return 0;
}
| replace | 36 | 37 | 36 | 37 | 0 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.