| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 253278 | patrikpavic2 | Highway design (CEOI12_highway) | C++17 | 1 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"
#include <vector>
#include <cstdlib>
 
using namespace std;
 
int n, uk, los;
 
int main(){
	n = GetN();
	for(int i = 1;i <= 4;i++){
		int ret = isOnLine(1 + (i <= 1), 2 + (i <= 2), 3 + (i <= 3));
		uk += ret;
		if(!ret) los = i;
		if(uk >= 2) break;
	}
	if(uk == 0){
		for(int i = 1;i <= 4;i++){
			for(int j = i + 1;j <= 4;j++){
				if(isOnLine(i, j, 5)){
					int k = 1, l = 1;
					while(k == i || k == j) k++;
					while(l == i || l == j || l == k) l++;
					Answer(i, j, k, l);
					return 0;
				}
			}
		}
	}
	if(uk > 1){
		int dos = 0, pr = 0, dr = 0;
		int i = 5;
		while(i < n - 2 && dos < 2){
			int ret = isOnLine(1, i, i + 1);
			if(!ret){
				int ret2 = isOnLine(1, 2, i);
				if(!dos)
					pr = (ret2 ? i + 1 : i);
				else
					dr = (ret2 ? i + 1 : i);
				dos++;
			}
			i += 2;
		}
		if(dos == 2){
			Answer(1, 2, pr, dr);
			return 0;
		}
		if(dos == 0){
			Answer(1, 2, n - 1, n);
			return 0;
		}
		if(i == n - 1 || !isOnLine(1, n - 1, n)){
			int ret2 = isOnLine(1, 2, n);
			Answer(1, 2, pr, (ret2 ? n - 1 : n));
			return 0;
		}		
		else{
			Answer(1, 2, pr, n - 2);
			return 0;
		}
	}
	int A = 1, B = 1;
	while(A == los) A++;
	while(B == los || B == A) B++;
	int i = 5;
	while(i < n - 2){
		int ret = isOnLine(1, i, i + 1);
		if(!ret){
			int ret2 = isOnLine(1, 2, i);
			Answer(A, B, los, (ret2 ? i + 1 : i));
			return 0;
		}
	}
	Answer(A, B, los, (isOnLine(A, B, n) ? n - 1 : n));
	return 0;
}
 
 
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
