# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226095 | Andrei_Cotor | Highway design (CEOI12_highway) | C++11 | 6 ms | 640 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"
using namespace std;
int Comb[][3]={
{1,2,3},
{1,2,4},
{1,3,4},
{2,3,4}};
int main()
{
int n=GetN();
int found=-1;
for(int i=0; i<=4; i++)
{
if(isOnLine(Comb[i][0],Comb[i][1],Comb[i][2]))
{
found=i;
break;
}
}
if(found==-1) //intre primele 4 sunt 2 de pe prima dreapta si 2 de pe a doua
{
for(int i=1; i<=3; i++)
{
for(int j=i+1; j<=4; j++)
{
if(isOnLine(i,j,5)) //5 va fi al treilea element de pe una dintre drepte
{
int x=0,y=0;
for(int k=1; k<=4; k++)
{
if(k!=i && k!=j)
{
if(x==0)
x=k;
else
y=k;
}
}
Answer(i,j,x,y);
}
}
}
}
//altfel am cel putin 3 puncte de pe o dreapta
if(found==0) //nu se stie daca apar puncte de pe a doua dreapta in primele 4
{
int x=0;
int y=0;
for(int i=4; i<n; i+=2)
{
if(!isOnLine(Comb[found][0],i,i+1))
{
int aux;
if(isOnLine(Comb[found][0],Comb[found][1],i))
aux=i+1;
else
aux=i;
if(x==0)
x=aux;
else
y=aux;
}
}
if(n%2==0 && y==0)
y=n;
Answer(Comb[found][0],Comb[found][1],x,y);
}
else
{
int x=1^2^3^4^Comb[found][0]^Comb[found][1]^Comb[found][2];
for(int i=5; i<n-2; i+=2)
{
if(!isOnLine(Comb[found][0],i,i+1))
{
if(isOnLine(Comb[found][0],Comb[found][1],i))
Answer(Comb[found][0],Comb[found][1],x,i+1);
else
Answer(Comb[found][0],Comb[found][1],x,i);
}
}
if(n%2==1)
{
if(!isOnLine(Comb[found][0],Comb[found][1],n-2))
Answer(Comb[found][0],Comb[found][1],x,n-2);
else
Answer(Comb[found][0],Comb[found][1],x,n);
}
else
{
//ultimele 2 sunt sigur pe dreapta 2
Answer(Comb[found][0],Comb[found][1],x,n);
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |