# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346960 | blue | Highway design (CEOI12_highway) | C++11 | 1 ms | 620 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>
using namespace std;
int main()
{
int N = GetN();
int i, j, k;
set<int> l1;
for(i = 1; i <= 3; i++) for(j = i+1; j <= 4; j++) for(k = j+1; k <= 5; k++)
{
if(isOnLine(i, j, k))
{
l1.insert(i);
l1.insert(j);
l1.insert(k);
}
}
int a1, a2, b1, b2;
a1 = *l1.begin();
a2 = *l1.rbegin();
if(l1.size() == 3)
{
for(b1 = 1; b1 <= 5; b1++)
{
if(l1.find(b1) == l1.end()) break;
}
for(int b2 = 5; b2 >= 1; b2--)
{
if(l1.find(i) == l1.end()) Answer(a1, a2, b1, b2);
}
}
else if(l1.size() == 4)
{
for(b1 = 1; b1 <= 5; b1++)
{
if(l1.find(b1) == l1.end()) break;
}
for(b2 = 6; b2 <= N; b2++)
{
if(!isOnLine(a1, a2, b2))
{
Answer(a1, a2, b1, b2);
}
}
}
/*else
{
for(b1 = 6; b1 <= N; b1++)
{
if(!isOnLine(1, 2, b1))
{
break;
}
}
for(b2 = b1+1; b2 <= N; b2++)
{
if(!isOnLine(1, 2, b2))
{
Answer(a1, a2, b1, b2);
}
}
}*/
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |