# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125327 | figter001 | Highway design (CEOI12_highway) | C++17 | 4 ms | 760 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;
bool vis[11][11][11];
int main(){
int n = GetN();
vector<int> a = {1,2,3,4};
do{
vector<int> cur;
cur.push_back(a[0]);
cur.push_back(a[1]);
cur.push_back(a[2]);
sort(cur.begin(),cur.end());
int x = cur[0],y = cur[1],z = cur[2];
if(vis[x][y][z])continue;
vis[x][y][z] = 1;
int res = isOnLine(x,y,z);
if(res == 1){
vector<int> g;
for(int i=1;i<=n;i++){
if(i == x || i == y || i == z){
}else{
int res = isOnLine(x,y,i);
if(res == 0)g.push_back(i);
if(g.size() == 2)break;
}
}
Answer(x,y,g[0],g[1]);
break;
}
}while(next_permutation(a.begin(),a.end()));
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |