| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 146075 | Mamnoon_Siam | Highway design (CEOI12_highway) | C++17 | 5 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;
int main(int argc, char const *argv[])
{
	int N = GetN();
	if(isOnLine(1, 2, 3)) {
		int found = 0;
		vector<int> tmp;
		for(int j = 5; j <= N - 2 + found; j += 2) {
			int i = j - 1;
			if(!isOnLine(1, i, j)) {
				int x = isOnLine(1, 2, i);
				int y = isOnLine(1, 2, j);
				if(!x) {
					tmp.emplace_back(i);
					found++;
					if(found == 2) break;
				}
				if(!y) {
					tmp.emplace_back(j);
					found++;
					if(found == 2) break;
				}
			}
		}
		for(int i = 0; i < (2 - found); i++) {
			tmp.emplace_back(N - i);
		}
		Answer(1, 2, tmp[0], tmp[1]);
		return 0;
	}
	int flag = 0;
	int a, b;
	for(int i = 1; i <= 3; i++) {
		for(int j = i + 1; j <= 3; j++) {
			if(isOnLine(i, j, 4)) {
				a = i, b = j;
				flag = 1;
				break;
			}
		}
		if(flag) {
			break;
		}
	}
	if(flag) {
		vector<int> tmp;
		int found = 1;
		tmp.emplace_back(1 ^ 2 ^ 3 ^ a ^ b);
		for(int j = 6; j <= N - 2 + found; j += 2) {
			int i = j - 1;
			if(!isOnLine(a, i, j)) {
				int x = isOnLine(a, b, i);
				int y = isOnLine(a, b, j);
				if(!x) {
					tmp.emplace_back(i);
					found++;
					if(found == 2) break;
				}
				if(!y) {
					tmp.emplace_back(j);
					found++;
					if(found == 2) break;
				}
			}
		}
		for(int i = 0; i < (2 - found); i++) {
			tmp.emplace_back(N - i);
		}
		Answer(a, b, tmp[0], tmp[1]);
	} else {
		for(int i = 1; i <= 4; i++) {
			for(int j = i + 1; j <= 4; j++) {
				if(isOnLine(i, j, 5)) {
					a = i, b = j;
					flag = 1;
					break;
				}
			}
			if(flag) {
				break;
			}
		}
		vector<int> book(5);
		book[a] = 1, book[b] = 1;
		vector<int> tmp;
		for(int i = 1; i <= 4; i++) {
			if(!book[i]) tmp.emplace_back(i);
		}
		Answer(a, b, tmp[0], tmp[1]);
	}
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
