# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22801 | 버거킹 송죽SK점 우수고객 (#40) | Window Xor (KRIII5_WX) | C++11 | 279 ms | 3288 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;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second
int n, k;
ll t;
int a[2][100010];
bool found[100010];
int cyc[100010];
int cn;
void trans(int h, int F, int T){
ll w = (1ll << h) % n;
if(w == 0){
if(k%2 == 0) for(int i=0; i<n; ++i) a[T][i]=0;
else for(int i=0; i<n; ++i) a[T][i]=a[F][i];
return;
}
fill(found, found+n, false);
for(int i=0; i<n; ++i) if(!found[i]){
cn=0;
for(int j=i;;){
if(found[j]) break;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |