# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16979 | gs14004 | Highway design (CEOI12_highway) | C++14 | 0 ms | 1564 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 "office.h"
#include <vector>
#include <tuple>
using namespace std;
int main(){
int n = GetN();
int p1, p2, p3, fnd = 0;
vector<int> ret;
if(isOnLine(1, 2, 3)){
tie(p1, p2) = make_tuple(1, 2);
}
else if(isOnLine(1, 4, 5)){
tie(p1, p2) = make_tuple(1, 4);
}
else if(isOnLine(2, 3, 4)){
tie(p1, p2) = make_tuple(2, 3);
}
else if(isOnLine(2, 3, 5)){
tie(p1, p2) = make_tuple(2, 3);
}
else if(isOnLine(2, 4, 5)){
tie(p1, p2) = make_tuple(1, 3);
}
else{
tie(p1, p2) = make_tuple(1, 2);
}
// five queries!! yay!!! >_<
for(int i=6; i<=n; i+=2){
if(i == n){
ret.push_back(i);
}
if(!isOnLine(p1, i, i+1)){
ret.push_back(i);
ret.push_back(i+1);
fnd++;
if(fnd >= 2) break;
}
}
int q1 = -1, q2 = -1;
for(auto &i : ret){
if(!isOnLine(p1, p2, i)){
if(q1 == -1) q1 = i;
else if(q2 == -1){
q2 = i;
break;
}
}
}
Answer(p1, p2, q1, q2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |