# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51315 | BrunoPloumhans | CATS (NOI14_cats) | C++14 | 520 ms | 8660 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int popcount(int x) {
int ans = 0;
while(x != 0) {
ans += (x&1);
x >>= 1;
}
return ans;
}
int greed(int x, int l, int n) {
int k = (l+2*n-1)/(2*n);
if(k < 60) {
int period = 2LL << k;
x %= period;
}
//cout << x << " " << period << endl;
return k*2*n+popcount(x)%2;
}
int simulate(int x, int l, int n) {
vector<int> st1(100000, 0);
/*int period = (l+2*n-1)/(2*n)*4;
x %= period;*/
int t2;
int counter = x+1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |