# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
360129 | spatarel | ICC (CEOI16_icc) | C++17 | 170 ms | 624 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 <stdio.h>
#include <vector>
const int MAX_N = 100;
int comp[1 + MAX_N];
int query(std::vector<int> a, std::vector<int> b) {
return query(a.size(), b.size(), a.data(), b.data());
}
void run(int n) {
for (int i = 1; i <= n; i++) {
comp[i] = i - 1;
}
for (int comps = n; comps > 1; comps--) {
int log2Comps = 0;
int copy = comps - 1;
while (copy > 0) {
copy /= 2;
log2Comps++;
}
int XOR = 0;
std::vector<int> A, B;
for (int bi = 0; bi < log2Comps; bi++) {
int bit = 1 << bi;
std::vector<int> a, b;
for (int i = 1; i <= n; i++) {
if (comp[i] & bit) {
# | 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... |