# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23007 | Bruteforceman | Highway design (CEOI12_highway) | C++11 | 23 ms | 5584 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>
#include <office.h>
using namespace std;
/*
int isOnLine(int x, int y, int z) {
return 0;
}
void Answer(int x, int y, int p, int q) {
return ;
}
int GetN() {
return 1;
}
*/
map <tuple <int, int, int>, int> mem;
int ask(int x, int y, int z) {
if(x > y) swap(x, y);
if(y > z) swap(y, z);
if(x > y) swap(x, y);
if(mem.find(make_tuple(x, y, z)) == mem.end()) {
return mem[make_tuple(x, y, z)] = isOnLine(x, y, z);
} else {
return mem[make_tuple(x, y, z)];
}
}
int main() {
int n = GetN();
if(ask(1, 2, 3) == 1) {
vector <int> can;
for(int i = 4; i <= n; i += 2) {
if(can.size() >= 2) break;
if(i == n) {
can.push_back(i);
} else if (ask(1, i, i+1) == 0) {
if(ask(1, 2, i) == 0) can.push_back(i);
if(can.size() == 2) break;
if(ask(1, 2, i+1) == 0) can.push_back(i+1);
if(can.size() == 2) break;
}
}
Answer(1, 2, can.front(), can.back());
} else if (ask(3, 4, 5) == 1) {
vector <int> can;
if(ask(2, 3, 4) == 1) can.push_back(1);
else can.push_back(2);
for(int i = 6; i <= n; i += 2) {
if(can.size() >= 2) break;
if(i == n) {
can.push_back(i);
} else if (ask(3, i, i+1)) {
if(ask(3, 4, i) == 0) can.push_back(i);
if(can.size() == 2) break;
if(ask(3, 4, i+1) == 0) can.push_back(i+1);
if(can.size() == 2) break;
}
}
Answer(3, 4, can.front(), can.back());
} else if (ask(1, 2, 4) == 1) {
vector <int> can;
can.push_back(3);
for(int i = 4; i <= n; i += 2) {
if(can.size() >= 2) break;
if(i == n) {
can.push_back(i);
} else if (ask(1, i, i+1) == 0) {
if(ask(1, 2, i) == 0) can.push_back(i);
if(can.size() == 2) break;
if(ask(1, 2, i+1) == 0) can.push_back(i+1);
if(can.size() == 2) break;
}
}
Answer(1, 2, can.front(), can.back());
} else {
for(int i = 1; i <= 5; i++) {
for(int j = i+1; j <= 5; j++) {
for(int k = j+1; k <= 5; k++) {
if(ask(i, j, k) == 1) {
vector <int> can;
for(int x = 1; x <= 5; x++) {
if(x == i || x == j || x == k) continue;
can.push_back(x);
}
Answer(i, j, can.front(), can.back());
break;
}
}
}
}
}
};
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |