oj.uz

Submission #113357

# Submission time Handle Problem Language Result Execution time Memory
113357 2019-05-25T07:32:16 Z ckodser Highway design (CEOI12_highway) C++14
100 / 100
 3 ms 640 KB 
#include<bits/stdc++.h>
#include "office.h"
#define isOnline isOnLine
#define pb push_back
using namespace std;
void Type3(int n)
{
	for (int i = 1; i <= 4; i++)
		for (int j = i + 1; j <= 4; j++)
			if (isOnline(i, j, 5))
			{
				int a = 1, b = 1;
				while (b == i || b == j) b ++;
				while (a == i || a == j || a == b) a ++;
				Answer(i, j, a, b);
			}
	exit(13);
}
void Type1(int n)
{
	vector < int > vec;
	for (int i = 4; i + 1 <= n && (int)vec.size() < 2; i += 2)
		if (!isOnline(1, i, i + 1))
		{
			if (!isOnline(1, 2, i))
				vec.push_back(i);
			else
				vec.push_back(i + 1);
		}
	if (vec.size() < 2)
		vec.pb(n);
	Answer(1, 2, vec[0], vec[1]);
}
void Type2(int n, int a, int b, int c)
{
	int d = 1 + 2 + 3 + 4 - a - b - c;
	vector < int > vec;
	vec.push_back(d);
	for (int i = 5; i + 2 <= n && (int)vec.size() < 2; i += 2)
		if (!isOnline(a, i, i + 1))
		{
			if (!isOnline(a, b, i))
				vec.push_back(i);
			else
				vec.push_back(i + 1);
		}
	if (vec.size() < 2)
		vec.push_back(n);
	Answer(a, b, vec[0], vec[1]);
}
int main()
{
	int n = GetN();
	if (isOnline(1, 2, 3))
		Type1(n);
	else if (isOnline(1, 2, 4))
		Type2(n, 1, 2, 4);
	else if (isOnline(1, 3, 4))
		Type2(n, 1, 3, 4);
	else if (isOnline(2, 3, 4))
		Type2(n, 2, 3, 4);
	else
		Type3(n);
}

Compilation message

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:88:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:92:37: warning: ISO C++ forbids converting a 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: ISO C++ forbids converting a 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: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:132:36: warning: ISO C++ forbids converting a 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: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:138:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:140:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
       _Fin(false, "Wrong answer");
                                 ^
office.c:142:23: warning: ISO C++ forbids converting a 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:10: 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 2 ms 256 KB Output is correct - 20 queries, 4 points
2 Correct 2 ms 384 KB Output is correct - 10 queries, 4 points
3 Correct 2 ms 384 KB Output is correct - 156 queries, 4 points
4 Correct 2 ms 384 KB Output is correct - 202 queries, 4 points
5 Correct 2 ms 384 KB Output is correct - 251 queries, 4 points
6 Correct 2 ms 384 KB Output is correct - 303 queries, 4 points
7 Correct 2 ms 384 KB Output is correct - 350 queries, 4 points
8 Correct 2 ms 384 KB Output is correct - 400 queries, 4 points
9 Correct 2 ms 384 KB Output is correct - 450 queries, 4 points
10 Correct 2 ms 384 KB Output is correct - 502 queries, 4 points
11 Correct 2 ms 384 KB Output is correct - 1001 queries, 4 points
12 Correct 2 ms 384 KB Output is correct - 1003 queries, 4 points
13 Correct 2 ms 384 KB Output is correct - 1502 queries, 4 points
14 Correct 2 ms 384 KB Output is correct - 2004 queries, 4 points
15 Correct 2 ms 384 KB Output is correct - 2503 queries, 4 points
16 Correct 2 ms 384 KB Output is correct - 805 queries, 4 points
17 Correct 2 ms 256 KB Output is correct - 854 queries, 4 points
18 Correct 2 ms 384 KB Output is correct - 900 queries, 4 points
19 Correct 2 ms 384 KB Output is correct - 12707 queries, 4 points
20 Correct 2 ms 512 KB Output is correct - 15000 queries, 4 points
21 Correct 3 ms 512 KB Output is correct - 20062 queries, 4 points
22 Correct 3 ms 512 KB Output is correct - 28063 queries, 4 points
23 Correct 2 ms 640 KB Output is correct - 33890 queries, 4 points
24 Correct 3 ms 640 KB Output is correct - 40944 queries, 4 points
25 Correct 3 ms 640 KB Output is correct - 49999 queries, 4 points