| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 210522 | bensonlzl | ICC (CEOI16_icc) | C++14 | 0 ms | 0 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 "icc.h"
#include <bits/stdc++.h>
using namespace std;
int s0, s1, a[105], b[105];
int par[105], sz[105];
int cnt[8], setbit;
void res(){
for (int i = 0; i < 105; ++i){
a[i] = b[i] = 0;
}
s0 = s1 = 0;
}
int solve(vector<int> A, vector<int> B){
if (B.size() == 1) return B[0];
vector<int> b0, b1;
for (int i = 0; i < B.size(); ++i){
if (i%2 == 0) b0.push_back(B[i]);
else b1.push_back(B[i]);
}
res();
for (int i = 0; i < A.size(); ++i){
a[i] = A[i];
}
for (int i = 0; i < b0.size(); ++i){
b[i] = b0[i];
}
int q = query(A.size(),b0.size(),a,b);
if (q) return solve(A,b0);
else return solve(A,b1);
}
void run(int n) {
for (int i = 1; i < n; ++i){
for (int j = 0; j < 7; ++j){
res();
for (int v = 1; v <= n; ++v){
if (v & (1 << j)){
b[s1] = v;
s1++;
}
else{
a[s0] = v;
s0++;
}
}
cnt[j] = query(s0,s1,a,b);
}
for (int k = 0; k < 7; ++k){
if (cnt[k] == 1){
setbit = k;
}
}
vector<int> v0, v1;
for (int v = 1; v <= n; ++v){
if (v & (1 << setbit)){
v1.push_back(v)
}
else{
v0.push_back(v);
}
}
int x = solve(v0,v1), y = x;
for (int j = 0; j < 7; ++j){
y ^= (cnt[j] * (1 << j));
}
setRoad(x,y);
}
}