Submission #5118

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
5118	2014-02-09T11:29:06 Z	ainta	Highway design (CEOI12_highway)	C++	100 / 100	0 ms	1508 KB

highway

#include "office.h"

int main() {
	int N = GetN();
	int i, c1 = 0, c2 = 0, j, k, x, y, z;
	if (isOnLine(1, 2, 3)) {
		for (i = 4; i < N && !c2; i += 2){
			if (!isOnLine(1, i, i + 1)){
				if (isOnLine(1, 2, i)){
					if (c1 == 0)c1 = i + 1;
					else c2 = i + 1;
				}
				else{
					if (c1 == 0)c1 = i;
					else c2 = i;
				}
			}
		}
		if (!c2) c2 = c1 + 1;
		Answer(1, 2, c1, c2);
	}
	else if(isOnLine(4, 5, 6))
	{
		for (i = 7; i < N && !c1; i += 2){
			if (!isOnLine(4, i, i + 1)){
				if (!isOnLine(4, 5, i))c1 = i;
				else c1 = i + 1;
			}
		}
		if (!c1)c1 = N;
		if (!isOnLine(4, 5, 1))c2 = 1;
		else if (!isOnLine(4, 5, 2))c2 = 2;
		else c2 = 3;
		Answer(4, 5, c1, c2);
	}
	else{
		for (i = 1; i <= 4; i++){
			for (j = i + 1; j <= 5; j++){
				for (k = j + 1; k <= 6; k++){
					if (isOnLine(i, j, k))break;
				}
				if (k != 7)break;
			}
			if (j != 6)break;
		}
		x = i, y = j, z = k;
		for (i = 1; i <= 6 && !c2; i++){
			if (x != i && y != i && z != i){
				if (!isOnLine(x, y, i)){
					if (!c1)c1 = i;
					else c2 = i;
				}
				else break;
			}
		}
		if (!c2){
			for (i = i + 1; i <= 6 && !c2; i++){
				if (x != i && y != i && z != i){
					if (!c1)c1 = i;
					else if (!c2)c2 = i;
				}
			}
		}
		Answer(x, y, c1, c2);
	}
	return 0;
}

Compilation message

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:29: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:88:29: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:92:37: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
     _Fin(false, "Too many questions");
                                     ^
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   int i;
       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:29: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
                                            ^
office.c:130:30: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:132:36: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
                                            ^
office.c:136:30: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:138:36: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:140:33: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
       _Fin(false, "Wrong answer");
                                 ^
office.c:142:23: warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]
   _Fin(true, "Correct");
                       ^
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
   int na1, nb1, na2, nb2, pont;
                           ^
office.c: In function 'void _doInit()':
office.c:33:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &_N);
                     ^

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1508 KB	Output is correct - 20 queries, 4 points
2	Correct	0 ms	1508 KB	Output is correct - 10 queries, 4 points
3	Correct	0 ms	1508 KB	Output is correct - 156 queries, 4 points
4	Correct	0 ms	1508 KB	Output is correct - 202 queries, 4 points
5	Correct	0 ms	1508 KB	Output is correct - 251 queries, 4 points
6	Correct	0 ms	1508 KB	Output is correct - 303 queries, 4 points
7	Correct	0 ms	1508 KB	Output is correct - 350 queries, 4 points
8	Correct	0 ms	1508 KB	Output is correct - 400 queries, 4 points
9	Correct	0 ms	1508 KB	Output is correct - 450 queries, 4 points
10	Correct	0 ms	1508 KB	Output is correct - 502 queries, 4 points
11	Correct	0 ms	1508 KB	Output is correct - 1001 queries, 4 points
12	Correct	0 ms	1508 KB	Output is correct - 1003 queries, 4 points
13	Correct	0 ms	1508 KB	Output is correct - 1502 queries, 4 points
14	Correct	0 ms	1508 KB	Output is correct - 2004 queries, 4 points
15	Correct	0 ms	1508 KB	Output is correct - 2503 queries, 4 points
16	Correct	0 ms	1508 KB	Output is correct - 805 queries, 4 points
17	Correct	0 ms	1508 KB	Output is correct - 854 queries, 4 points
18	Correct	0 ms	1508 KB	Output is correct - 900 queries, 4 points
19	Correct	0 ms	1508 KB	Output is correct - 12707 queries, 4 points
20	Correct	0 ms	1508 KB	Output is correct - 15000 queries, 4 points
21	Correct	0 ms	1508 KB	Output is correct - 20062 queries, 4 points
22	Correct	0 ms	1508 KB	Output is correct - 28063 queries, 4 points
23	Correct	0 ms	1508 KB	Output is correct - 33890 queries, 4 points
24	Correct	0 ms	1508 KB	Output is correct - 40944 queries, 4 points
25	Correct	0 ms	1508 KB	Output is correct - 49999 queries, 4 points