oj.uz

Submission #370445

# Submission time Handle Problem Language Result Execution time Memory
370445 2021-02-24T03:20:51 Z arnold518 Highway design (CEOI12_highway) C++14
49 / 100
 31 ms 4580 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, V2, V3;

int main()
{
	N=GetN();

	V.push_back(1);
	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.push_back(a);
	V.push_back(b);
	V.push_back(c);

	vector<int> todo;
	for(int i=1; i<=N; i++)
	{
		if(i==a) continue;
		if(i==b) continue;
		if(i==c) continue;
		todo.push_back(i);
	}

	for(int i=0; i+1<todo.size(); i+=2)
	{
		if(query(V[0], todo[i], todo[i+1]))
		{
			V.push_back(todo[i]);
			V.push_back(todo[i+1]);
		}
		else
		{
			V2.push_back(todo[i]);
			V2.push_back(todo[i+1]);	
		}
	}
	for(auto it : V2)
	{
		//printf("HI %d %d %d\n", V[0], V[1], it);
		if(!query(V[0], V[1], it))
		{
			V3.push_back(it);
		}
		if(V3.size()>1 && V.size()>1) break;
	}
	//printf("!%d %d %d %d\n", V[0], V[1], V3[0], V3[1]);
	Answer(V[0], V[1], V3[0], V3[1]);
}

Compilation message

highway.cpp: In function 'int main()':
highway.cpp:61:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i=0; i+1<todo.size(); i+=2)
      |               ~~~^~~~~~~~~~~~
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
49.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 364 KB Output is partially correct - 26 queries, 2 points
2 Partially correct 0 ms 364 KB Output is partially correct - 16 queries, 1 points
3 Partially correct 0 ms 364 KB Output is partially correct - 162 queries, 2 points
4 Partially correct 1 ms 364 KB Output is partially correct - 208 queries, 2 points
5 Partially correct 1 ms 364 KB Output is partially correct - 257 queries, 2 points
6 Partially correct 1 ms 364 KB Output is partially correct - 309 queries, 2 points
7 Partially correct 1 ms 364 KB Output is partially correct - 356 queries, 2 points
8 Partially correct 1 ms 364 KB Output is partially correct - 406 queries, 2 points
9 Partially correct 1 ms 364 KB Output is partially correct - 456 queries, 2 points
10 Partially correct 1 ms 364 KB Output is partially correct - 508 queries, 2 points
11 Partially correct 1 ms 364 KB Output is partially correct - 1007 queries, 2 points
12 Partially correct 1 ms 364 KB Output is partially correct - 1009 queries, 2 points
13 Partially correct 1 ms 492 KB Output is partially correct - 1508 queries, 2 points
14 Partially correct 1 ms 492 KB Output is partially correct - 2010 queries, 2 points
15 Partially correct 1 ms 492 KB Output is partially correct - 2509 queries, 2 points
16 Partially correct 1 ms 364 KB Output is partially correct - 811 queries, 2 points
17 Partially correct 1 ms 364 KB Output is partially correct - 860 queries, 2 points
18 Partially correct 1 ms 364 KB Output is partially correct - 906 queries, 2 points
19 Partially correct 7 ms 1388 KB Output is partially correct - 12713 queries, 2 points
20 Partially correct 9 ms 1644 KB Output is partially correct - 15006 queries, 2 points
21 Partially correct 13 ms 2024 KB Output is partially correct - 20068 queries, 2 points
22 Partially correct 15 ms 2792 KB Output is partially correct - 28069 queries, 2 points
23 Partially correct 18 ms 3428 KB Output is partially correct - 33896 queries, 2 points
24 Partially correct 23 ms 3812 KB Output is partially correct - 40950 queries, 2 points
25 Partially correct 31 ms 4580 KB Output is partially correct - 50005 queries, 2 points