# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16966 | gs14004 | Highway design (CEOI12_highway) | C++14 | 23 ms | 6316 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 <set>
#include <vector>
using namespace std;
int main() {
int n = GetN();
int p1, p2, p3;
for(int i=1; i<=3; i++){
for(int j=i+1; j<=4; j++){
for(int k=j+1; k<=5; k++){
if(isOnLine(i, j, k)){
p1 = i, p2 = j, p3 = k;
break;
}
}
}
} // 10
vector<int> ret;
set<int> s;
for(int i=1; i<=n; i++){
if(i != p1 && i != p2 && i != p3) s.insert(i);
}
auto it1 = s.begin();
auto it2 = ++s.begin();
int found = 0;
while(it2 != s.end()){
if(!isOnLine(p1, *it1, *it2)){
ret.push_back(*it1);
ret.push_back(*it2);
found++;
if(ret.size() >= 4) break;
}
it1++;
it1++;
it2++;
if(it2 != s.end()) it2++;
}
if(it1 != s.end() && found < 2){
ret.push_back(*it1);
}
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... |