| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 545127 | rainboy | Highway design (CEOI12_highway) | C11 | 1 ms | 592 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"
int main() {
	int n = GetN(), i1, j1, i2, j2, i;
	i1 = j1 = i2 = j2 = 0;
	if (isOnLine(1, 2, 3))
		i1 = 1, j1 = 2;
	else if (isOnLine(4, 5, 6))
		i1 = 5, j1 = 6;
	else {
		if (isOnLine(1, 2, 4))
			i1 = 1, j1 = 2, i2 = 3;
		else if (isOnLine(1, 3, 4))
			i1 = 1, j1 = 3, i2 = 2;
		else if (isOnLine(2, 3, 4))
			i1 = 2, j1 = 3, i2 = 1;
		else if (isOnLine(1, 2, 5))
			i1 = 1, j1 = 2, i2 = 3, j2 = 4;
		else if (isOnLine(1, 3, 5))
			i1 = 1, j1 = 3, i2 = 2, j2 = 4;
		else if (isOnLine(1, 4, 5))
			i1 = 1, j1 = 4, i2 = 2, j2 = 3;
		if (!j2)
			for (j2 = 1; j2 <= 6; j2++)
				if (j2 != i1 && j2 != j1 && j2 != i2 && !isOnLine(i1, j1, j2))
					break;
		Answer(i1, j1, i2, j2);
	}
	for (i = i1 == 1 ? 4 : 1; i <= n; i += 2)
		if (i != 5 && (i + 2 > n || !isOnLine(i1, i, i + 1))) {
			if (i == n || !isOnLine(i1, j1, i)) {
				if (i2 == 0)
					i2 = i;
				else {
					j2 = i;
					break;
				}
			} else
				if (i2 == 0)
					i2 = i + 1;
				else {
					j2 = i + 1;
					break;
				}
		}
	Answer(i1, j1, i2, j2);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
