# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370445 | arnold518 | Highway design (CEOI12_highway) | C++14 | 31 ms | 4580 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N;
int GetN(void);
int isOnLine(int x, int y, int z);
void Answer(int a1, int b1, int a2, int b2);
map<tuple<int, int, int>, int> M;
int query(int a, int b, int c)
{
if(a>b) swap(a, b);
if(b>c) swap(b, c);
if(a>b) swap(a, b);
if(M.find({a, b, c})!=M.end()) return M[{a, b, c}];
M[{a, b, c}]=isOnLine(a, b, c);
return M[{a, b, c}];
}
vector<int> V, V2, V3;
int main()
{
N=GetN();
V.push_back(1);
int a, b, c;
for(int i=1; i<=5; i++)
{
for(int j=i+1; j<=5; j++)
{
for(int k=j+1; k<=5; k++)
{
if(query(i, j, k))
{
a=i; b=j; c=k;
break;
}
}
}
}
V.push_back(a);
V.push_back(b);
V.push_back(c);
vector<int> todo;
for(int i=1; i<=N; i++)
{
if(i==a) continue;
if(i==b) continue;
if(i==c) continue;
todo.push_back(i);
}
for(int i=0; i+1<todo.size(); i+=2)
{
if(query(V[0], todo[i], todo[i+1]))
{
V.push_back(todo[i]);
V.push_back(todo[i+1]);
}
else
{
V2.push_back(todo[i]);
V2.push_back(todo[i+1]);
}
}
for(auto it : V2)
{
//printf("HI %d %d %d\n", V[0], V[1], it);
if(!query(V[0], V[1], it))
{
V3.push_back(it);
}
if(V3.size()>1 && V.size()>1) break;
}
//printf("!%d %d %d %d\n", V[0], V[1], V3[0], V3[1]);
Answer(V[0], V[1], V3[0], V3[1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |