답안 #16990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16990 2015-11-03T14:45:13 Z gs14004 고속도로 설계 (CEOI12_highway) C++14
100 / 100
0 ms 1564 KB
#include "office.h"
#include <set>
#include <vector>
#include <tuple>
using namespace std;
 
int main(){
    int n = GetN();
    if(isOnLine(1, 2, 3)){
    	vector<int> ret;
    	for(int i=4; i<=n; i+=2){
    		if(i == n) ret.push_back(i);
    		else if(!isOnLine(1, i, i+1)){
    			ret.push_back(i);
    			ret.push_back(i+1);
    			if(ret.size() == 4) break;
    		}
    	}
    	if(ret.size() == 2){
    		Answer(1, 2, ret[0], ret[1]);
    	}
    	else if(ret.size() == 3){
    		vector<int> q;
    		for(auto &i : ret){
	    		if(!isOnLine(1, 2, i)){
	    			q.push_back(i);
	    			if(q.size() == 2) break;
	    		}
	    	}
	    	Answer(1, 2, q[0], q[1]);
    	}
    	else{
    		vector<int> q;
    		if(isOnLine(1, 2, ret[0])){
    			q.push_back(ret[1]);
    		}
    		else q.push_back(ret[0]);
    		if(isOnLine(1, 2, ret[2])){
    			q.push_back(ret[3]);
    		}
    		else q.push_back(ret[2]);
    		Answer(1, 2, q[0], q[1]);
    	}
    }
    else if(isOnLine(4, 5, 6)){
    	vector<int> ret, q;
    	ret.push_back(1);
    	ret.push_back(2);
    	for(int i=7; i<=n; i+=2){
    		if(i == n) ret.push_back(i);
    		else if(!isOnLine(4, i, i+1)){
    			ret.push_back(i);
    			ret.push_back(i+1);
    			break;
    		}
    	}
    	// N / 2 + 3
    	for(auto &i : ret){
    		if(!isOnLine(4, 5, i)){
    			q.push_back(i);
    			if(q.size() == 2) break;
    		}
    	}
    	Answer(4, 5, q[0], q[1]);
    }
    else{
    	int p1 = -1, p2, p3;
    	for(int i=1; i<=4; i++){
    		for(int j=i+1; j<=5; j++){
    			for(int k=j+1; k<=6; k++){
    				if(isOnLine(i, j, k)){
    					tie(p1, p2, p3) = make_tuple(i, j, k);
    				}
    				if(p1 > 0) break;
    			}
    			if(p1 > 0) break;
    		}
    		if(p1 > 0) break;
    	}
    	vector<int> q;
    	for(int i=1; i<=6; i++){
    		if(i == p1 || i == p2 || i == p3) continue;
    		if(!isOnLine(p1, p2, i)){
    			q.push_back(i);
    			if(q.size() == 2) break;
    		}
    	}
    	Answer(p1, p2, q[0], q[1]);
    }
}

Compilation message

highway.cpp: In function 'int main()':
highway.cpp:82:29: warning: 'p3' may be used uninitialized in this function [-Wmaybe-uninitialized]
       if(i == p1 || i == p2 || i == p3) continue;
                             ^
highway.cpp:83:19: warning: 'p2' may be used uninitialized in this function [-Wmaybe-uninitialized]
       if(!isOnLine(p1, p2, i)){
                   ^
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);
                     ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1564 KB Output is correct - 21 queries, 4 points
2 Correct 0 ms 1564 KB Output is correct - 11 queries, 4 points
3 Correct 0 ms 1564 KB Output is correct - 157 queries, 4 points
4 Correct 0 ms 1564 KB Output is correct - 202 queries, 4 points
5 Correct 0 ms 1564 KB Output is correct - 252 queries, 4 points
6 Correct 0 ms 1564 KB Output is correct - 303 queries, 4 points
7 Correct 0 ms 1564 KB Output is correct - 351 queries, 4 points
8 Correct 0 ms 1564 KB Output is correct - 401 queries, 4 points
9 Correct 0 ms 1564 KB Output is correct - 451 queries, 4 points
10 Correct 0 ms 1564 KB Output is correct - 502 queries, 4 points
11 Correct 0 ms 1564 KB Output is correct - 1002 queries, 4 points
12 Correct 0 ms 1564 KB Output is correct - 1003 queries, 4 points
13 Correct 0 ms 1564 KB Output is correct - 1503 queries, 4 points
14 Correct 0 ms 1564 KB Output is correct - 2004 queries, 4 points
15 Correct 0 ms 1564 KB Output is correct - 2504 queries, 4 points
16 Correct 0 ms 1564 KB Output is correct - 805 queries, 4 points
17 Correct 0 ms 1564 KB Output is correct - 855 queries, 4 points
18 Correct 0 ms 1564 KB Output is correct - 901 queries, 4 points
19 Correct 0 ms 1564 KB Output is correct - 12707 queries, 4 points
20 Correct 0 ms 1564 KB Output is correct - 15001 queries, 4 points
21 Correct 0 ms 1564 KB Output is correct - 20062 queries, 4 points
22 Correct 0 ms 1564 KB Output is correct - 28063 queries, 4 points
23 Correct 0 ms 1564 KB Output is correct - 33890 queries, 4 points
24 Correct 0 ms 1564 KB Output is correct - 40945 queries, 4 points
25 Correct 0 ms 1564 KB Output is correct - 50000 queries, 4 points