| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 30866 | minimario | 고속도로 설계 (CEOI12_highway) | C++14 | 0 ms | 2412 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;
#define e1 first
#define e2 second
#define pb push_back
#define mp make_pair
#define boost ios_base::sync_with_stdio(false)
#define eb emplace_back
#define OUT(x) {cout << x; exit(0); }
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define scanf(...) scanf(__VA_ARGS__)?:0
typedef long long int ll;
typedef unsigned long long ull;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair <PLL, int> PLLI;
typedef pair <PLL, PLL> PP;
typedef pair <PII, int> PPI;
typedef pair <ll, int> PLI;
typedef unsigned int ui;
const int inf = 1e9+9;
const int mod = 1e9+7;
vector <int> second;
void tryHarder(int st, int sec, int x, int y)
{
	for (int i=x; i<=y; i+=2)
	{
		if ((int)second.size() == 2) break;
		if (i == y)
		{
			if (!isOnLine(st, sec, i)) second.pb(i);
		}
		else
		{
			if (!isOnLine(st, i, i+1))
			{
				if (isOnLine(st, sec, i)) second.pb(i + 1);
				else second.pb(i);
			}
		}
	}
}
vector <int> jest;
bool odw[7];
void solveSimple()
{
	//we want to ask at most 20 queries here
	second.clear(); jest.clear();
	for (int i=1; i<=5; ++i)
		for (int j=i+1; j<=5; ++j)
			for (int k=j+1; k<=5; ++k)
				if (isOnLine(i, j, k)) {
					jest.pb(i); jest.pb(j); jest.pb(k);
					odw[i] = 1; odw[j] = 1; odw[k] = 1;
					break;
				}
	for (int i=1; i<=6; ++i)
		if (!odw[i] && !isOnLine(jest[0], jest[1], i)) second.pb(i);
		
	Answer(jest[0], jest[1], second[0], second[1]);
	exit(0);
}
int main()
{
	int n = GetN();
	bool c1 = isOnLine(1, 2, 3);
	if (c1)
	{
		tryHarder(1, 2, 4, n);
		Answer(1, 2, second[0], second[1]);
		exit(0);
	}
	bool c2 = isOnLine(4, 5, 6);
	if (!c2) solveSimple();
	else 
	{
		tryHarder(4, 5, 7, n);
		if ((int)second.size() >= 2)
		{
			Answer(4, 5, second[0], second[1]);
			exit(0);
		}
		assert((int)second.size() == 1);
		//i guess we will never end up here but for the sake of certainty..
		tryHarder(4, 5, 1, 3);
		assert((int)second.size() >= 2);
		Answer(4, 5, second[0], second[1]);
		exit(0);
	}
	
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
