oj.uz

답안 #370479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370479 2021-02-24T04:08:04 Z arnold518 고속도로 설계 (CEOI12_highway) C++14
100 / 100
 27 ms 4196 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}];
}


int main()
{
	N=GetN();

	if(N%2)
	{
		vector<int> V, V3;
		vector<pii> V2;
		V.push_back(1);

		for(int i=2; i+1<=N; i+=2)
		{
			if(query(1, i, i+1))
			{
				V.push_back(i);
				V.push_back(i+1);
			}
			else
			{
				V2.push_back({i, i+1});
			}
		}
		for(auto it : V2)
		{

			if(query(V[0], V[1], it.first))
			{
				V3.push_back(it.second);
			}
			else
			{
				V3.push_back(it.first);
				if(V3.size()>1 && V.size()>1) break;
				if(query(V[0], V[1], it.second))
				{
					V3.push_back(it.second);
					if(V3.size()>1 && V.size()>1) break;
				}	
			}
			if(V3.size()>1 && V.size()>1) break;
		}
		Answer(V[0], V[1], V3[0], V3[1]);
	}
	else
	{
		vector<int> V, V2, V3;
 
		V.push_back(1);
 
		for(int i=2; i+1<=N; i+=2)
		{
			if(query(1, i, i+1))
			{
				V.push_back(i);
				V.push_back(i+1);
			}
			else
			{
				V2.push_back(i);
				V2.push_back(i+1);
			}
		}
		for(auto it : V2)
		{
			if(!query(V[0], V[1], it))
			{
				V3.push_back(it);
			}
			if(V3.size()>1 && V.size()>1) break;
		}
		Answer(V[0], V[1], V3[0], V3[1]);
	}
}

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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct - 21 queries, 4 points
2 Correct 1 ms 364 KB Output is correct - 11 queries, 4 points
3 Correct 0 ms 364 KB Output is correct - 157 queries, 4 points
4 Correct 1 ms 364 KB Output is correct - 202 queries, 4 points
5 Correct 1 ms 364 KB Output is correct - 252 queries, 4 points
6 Correct 1 ms 364 KB Output is correct - 303 queries, 4 points
7 Correct 1 ms 364 KB Output is correct - 351 queries, 4 points
8 Correct 1 ms 364 KB Output is correct - 401 queries, 4 points
9 Correct 1 ms 364 KB Output is correct - 451 queries, 4 points
10 Correct 1 ms 364 KB Output is correct - 502 queries, 4 points
11 Correct 1 ms 364 KB Output is correct - 1002 queries, 4 points
12 Correct 1 ms 512 KB Output is correct - 1003 queries, 4 points
13 Correct 1 ms 492 KB Output is correct - 1503 queries, 4 points
14 Correct 1 ms 492 KB Output is correct - 2004 queries, 4 points
15 Correct 1 ms 492 KB Output is correct - 2504 queries, 4 points
16 Correct 1 ms 364 KB Output is correct - 805 queries, 4 points
17 Correct 1 ms 364 KB Output is correct - 855 queries, 4 points
18 Correct 1 ms 364 KB Output is correct - 901 queries, 4 points
19 Correct 6 ms 1260 KB Output is correct - 12707 queries, 4 points
20 Correct 7 ms 1516 KB Output is correct - 15001 queries, 4 points
21 Correct 10 ms 1896 KB Output is correct - 20062 queries, 4 points
22 Correct 14 ms 2536 KB Output is correct - 28063 queries, 4 points
23 Correct 18 ms 3176 KB Output is correct - 33890 queries, 4 points
24 Correct 22 ms 3556 KB Output is correct - 40945 queries, 4 points
25 Correct 27 ms 4196 KB Output is correct - 50000 queries, 4 points