oj.uz

답안 #30866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30866 2017-07-28T20:32:59 Z minimario 고속도로 설계 (CEOI12_highway) C++14
100 / 100
 0 ms 2412 KB 
#include "office.h"
#include <bits/stdc++.h>
using namespace std;
#define e1 first
#define e2 second
#define pb push_back
#define mp make_pair
#define boost ios_base::sync_with_stdio(false)
#define eb emplace_back
#define OUT(x) {cout << x; exit(0); }
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define scanf(...) scanf(__VA_ARGS__)?:0
typedef long long int ll;
typedef unsigned long long ull;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair <PLL, int> PLLI;
typedef pair <PLL, PLL> PP;
typedef pair <PII, int> PPI;
typedef pair <ll, int> PLI;
typedef unsigned int ui;
const int inf = 1e9+9;
const int mod = 1e9+7;
vector <int> second;

void tryHarder(int st, int sec, int x, int y)
{
	for (int i=x; i<=y; i+=2)
	{
		if ((int)second.size() == 2) break;
		if (i == y)
		{
			if (!isOnLine(st, sec, i)) second.pb(i);
		}
		else
		{
			if (!isOnLine(st, i, i+1))
			{
				if (isOnLine(st, sec, i)) second.pb(i + 1);
				else second.pb(i);
			}
		}
	}
}
vector <int> jest;
bool odw[7];
void solveSimple()
{
	//we want to ask at most 20 queries here
	second.clear(); jest.clear();
	for (int i=1; i<=5; ++i)
		for (int j=i+1; j<=5; ++j)
			for (int k=j+1; k<=5; ++k)
				if (isOnLine(i, j, k)) {
					jest.pb(i); jest.pb(j); jest.pb(k);
					odw[i] = 1; odw[j] = 1; odw[k] = 1;
					break;
				}
	for (int i=1; i<=6; ++i)
		if (!odw[i] && !isOnLine(jest[0], jest[1], i)) second.pb(i);
		
	Answer(jest[0], jest[1], second[0], second[1]);
	exit(0);
}

int main()
{
	int n = GetN();
	bool c1 = isOnLine(1, 2, 3);
	if (c1)
	{
		tryHarder(1, 2, 4, n);
		Answer(1, 2, second[0], second[1]);
		exit(0);
	}
	bool c2 = isOnLine(4, 5, 6);
	if (!c2) solveSimple();
	else 
	{
		tryHarder(4, 5, 7, n);
		if ((int)second.size() >= 2)
		{
			Answer(4, 5, second[0], second[1]);
			exit(0);
		}
		assert((int)second.size() == 1);
		//i guess we will never end up here but for the sake of certainty..
		tryHarder(4, 5, 1, 3);
		assert((int)second.size() >= 2);
		Answer(4, 5, second[0], second[1]);
		exit(0);
	}
	
}

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: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

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