답안 #96675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96675 2019-02-10T19:26:39 Z shoemakerjo 고속도로 설계 (CEOI12_highway) C++14
100 / 100
8 ms 1400 KB
#include "office.h"
#include <bits/stdc++.h>

using namespace std;

int n;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	vector<int> c1, c2, poss; //start all empty
	vector<int> c2poss; //extra stuff

	int tp = 0;
	n = GetN();

	if (isOnLine(1, 2, 3)) {
		tp = 0;
		c1.push_back(1);
		c1.push_back(2);
		c1.push_back(3);
		for (int i = 4; i <= n; i++) {
			poss.push_back(i);
		}
	}
	else if (isOnLine(1, 3, 4)) {
		tp = 1;
		c1.push_back(1);
		c1.push_back(3);
		c1.push_back(4);
		c2.push_back(2);
		for (int i = 5; i <= n; i++) {
			poss.push_back(i);
		}
	}
	else if (isOnLine(1, 2, 4)) {
		tp = 2;
		c1.push_back(1);
		c1.push_back(2);
		c1.push_back(4);
		c2.push_back(3);
		for (int i = 5; i <= n; i++) {
			poss.push_back(i);
		}
	}
	else if (isOnLine(2, 3, 4)) {
		tp = 3;
		c1.push_back(2);
		c1.push_back(3);
		c1.push_back(4);
		c2.push_back(1);
		for (int i = 5; i <= n; i++) {
			poss.push_back(i);
		}
	}
	else {
		//just bash
		if (isOnLine(1, 2, 5)) {
			Answer(1, 2, 3, 4);
			return 0;
		}
		if (isOnLine(1, 3, 5)) {
			Answer(1, 3, 2, 4);
			return 0;
		}
		if (isOnLine(1, 4, 5)) {
			Answer(1, 4, 2, 3);
			return 0;
		}
		if (isOnLine(2, 3, 5)) {
			Answer(2, 3, 1, 4);
			return 0;
		}
		if (isOnLine(2, 4, 5)) {
			Answer(2, 4, 1, 3);
			return 0;
		}
		if (isOnLine(3, 4, 5)) {
			Answer(3, 4, 1, 2);
			return 0;
		}
		return 0; //assert flase should also work here
	}

	while (poss.size()) {
		if (c2.size() >= 2) {
			//we can go ahead and answer
			Answer(c1[0], c1[1], c2[0], c2[1]);
			return 0;
		}
		if (poss.size() == 1) {
			//always must be in the answer
			Answer(c1[0], c1[1], c2[0], poss.back());
			return 0;
		}
			
		int a = poss.back(); poss.pop_back();
		int b = poss.back(); poss.pop_back();

		if (tp != 0 && poss.size() <= 1) {
			//at least one is in the answer
			if (isOnLine(c1[0], c1[1], a)) {
				c2.push_back(a);
			}
			else {
				c2.push_back(b);
			}
			continue;
		}
		if (isOnLine(c1[0], a, b)) {
			continue;
		}
		if (isOnLine(c1[0], c1[1], a)) {
			c2.push_back(b);
		}
		else {
			c2.push_back(a);
			c2poss.push_back(b);
		}
	}
	for (int v : c2poss) c2.push_back(v);

	Answer(c1[0], c1[1], c2[0], c2[1]);

}

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);
     ~~~~~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 388 KB Output is correct - 20 queries, 4 points
2 Correct 2 ms 376 KB Output is correct - 10 queries, 4 points
3 Correct 3 ms 376 KB Output is correct - 156 queries, 4 points
4 Correct 2 ms 376 KB Output is correct - 202 queries, 4 points
5 Correct 2 ms 376 KB Output is correct - 251 queries, 4 points
6 Correct 2 ms 376 KB Output is correct - 303 queries, 4 points
7 Correct 2 ms 376 KB Output is correct - 350 queries, 4 points
8 Correct 2 ms 376 KB Output is correct - 400 queries, 4 points
9 Correct 2 ms 376 KB Output is correct - 450 queries, 4 points
10 Correct 2 ms 376 KB Output is correct - 502 queries, 4 points
11 Correct 2 ms 376 KB Output is correct - 1001 queries, 4 points
12 Correct 2 ms 376 KB Output is correct - 1003 queries, 4 points
13 Correct 2 ms 376 KB Output is correct - 1502 queries, 4 points
14 Correct 2 ms 376 KB Output is correct - 2004 queries, 4 points
15 Correct 2 ms 504 KB Output is correct - 2503 queries, 4 points
16 Correct 2 ms 376 KB Output is correct - 805 queries, 4 points
17 Correct 2 ms 376 KB Output is correct - 854 queries, 4 points
18 Correct 2 ms 376 KB Output is correct - 900 queries, 4 points
19 Correct 3 ms 636 KB Output is correct - 12707 queries, 4 points
20 Correct 3 ms 760 KB Output is correct - 15000 queries, 4 points
21 Correct 3 ms 888 KB Output is correct - 20062 queries, 4 points
22 Correct 3 ms 888 KB Output is correct - 28063 queries, 4 points
23 Correct 4 ms 1272 KB Output is correct - 33890 queries, 4 points
24 Correct 3 ms 1272 KB Output is correct - 40944 queries, 4 points
25 Correct 8 ms 1400 KB Output is correct - 49999 queries, 4 points