oj.uz

Submission #370425

# Submission time Handle Problem Language Result Execution time Memory
370425 2021-02-24T02:39:21 Z arnold518 Highway design (CEOI12_highway) C++14
0 / 100
 53 ms 7396 KB 
#include "office.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N;

int GetN(void); 
int isOnLine(int x, int y, int z); 
void Answer(int a1, int b1, int a2, int b2);

map<tuple<int, int, int>, int> M;
int query(int a, int b, int c)
{
	if(a>b) swap(a, b);
	if(b>c) swap(b, c);
	if(a>b) swap(a, b);
	if(M.find({a, b, c})!=M.end()) return M[{a, b, c}];
	M[{a, b, c}]=isOnLine(a, b, c);
	return M[{a, b, c}];
}

vector<int> V[2];

int main()
{
	N=GetN();

	int a, b, c;
	for(int i=1; i<=5; i++)
	{
		for(int j=i+1; j<=5; j++)
		{
			for(int k=j+1; k<=5; k++)
			{
				if(query(i, j, k))
				{
					a=i; b=j; c=k;
					break;
				}
			}
		}
	}
	V[0].push_back(a);
	V[0].push_back(b);
	V[0].push_back(c);

	for(int i=1; i<=N; i++)
	{
		if(i==a) continue;
		if(i==b) continue;
		if(i==c) continue;
		if(query(a, b, i))
		{
			V[0].push_back(i);
		}
		else
		{
			V[1].push_back(i);
		}
		if(V[0].size()>1 && V[1].size()>1)
		{
			Answer(V[0][0], V[0][1], V[1][0], V[1][1]);
			break;
		}
	}
}

Compilation message

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   85 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:88:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   88 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:92:17: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   92 |     _Fin(false, "Too many questions");
      |                 ^~~~~~~~~~~~~~~~~~~~
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   83 |   int i;
      |       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  123 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  128 |       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  130 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:132:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  132 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  134 |       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  136 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:138:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  138 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:140:19: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  140 |       _Fin(false, "Wrong answer");
      |                   ^~~~~~~~~~~~~~
office.c:142:14: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  142 |   _Fin(true, "Correct");
      |              ^~~~~~~~~
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
  120 |   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]
   33 |     scanf("%d", &_N);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
2 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
3 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
4 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
5 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
6 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
7 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
8 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
9 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
10 Incorrect 1 ms 364 KB Output isn't correct - Too many questions
11 Incorrect 1 ms 492 KB Output isn't correct - Too many questions
12 Incorrect 1 ms 492 KB Output isn't correct - Too many questions
13 Incorrect 2 ms 492 KB Output isn't correct - Too many questions
14 Incorrect 2 ms 620 KB Output isn't correct - Too many questions
15 Incorrect 2 ms 620 KB Output isn't correct - Too many questions
16 Incorrect 1 ms 492 KB Output isn't correct - Too many questions
17 Incorrect 1 ms 492 KB Output isn't correct - Too many questions
18 Incorrect 1 ms 492 KB Output isn't correct - Too many questions
19 Incorrect 12 ms 2156 KB Output isn't correct - Too many questions
20 Incorrect 14 ms 2412 KB Output isn't correct - Too many questions
21 Incorrect 20 ms 3176 KB Output isn't correct - Too many questions
22 Incorrect 29 ms 4328 KB Output isn't correct - Too many questions
23 Incorrect 35 ms 5224 KB Output isn't correct - Too many questions
24 Incorrect 43 ms 6116 KB Output isn't correct - Too many questions
25 Incorrect 53 ms 7396 KB Output isn't correct - Too many questions