oj.uz

답안 #79118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79118 2018-10-11T08:17:30 Z tmwilliamlin168 고속도로 설계 (CEOI12_highway) C++14
100 / 100
 3 ms 1488 KB 
#include "office.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> a[2];

int ol(int b) {
	return isOnLine(a[1][0], a[1][0]+1, b);
}

void ans(int b, int c) {
	Answer(a[1][0], a[1][0]+1, b, c);
}

int main() {
	int n=GetN();
	for(int i=1; i+2<=n; i+=3)
		a[isOnLine(i, i+1, i+2)].push_back(i);
	if(a[0].size()>=2) {
		int b[2];
		for(int i=0; i<2; ++i)
			for(b[i]=a[0][i]; ol(b[i]); ++b[i]);
		ans(b[0], b[1]);
	}
	for(int i=1; i+1<a[1].size(); i+=2) {
		if(isOnLine(a[1][0], a[1][i], a[1][i+1]))
			continue;
		int j=ol(a[1][i]);
		ans(a[1][i+j], a[1][i+j]+1);
	}
	if(a[1].size()%2==0&&!ol(a[1].back()))
		ans(a[1].back(), a[1].back()+1);
	if(n%3==1) {
		if(!ol(a[0][0]))
			ans(a[0][0], n);
		else if(!ol(a[0][0]+1))
			ans(a[0][0]+1, n);
		else
			ans(a[0][0]+2, n);
	} else {
		vector<int> b;
		for(int i=0; i<3; ++i)
			if(!ol(a[0][0]+i))
				b.push_back(a[0][0]+i);
		b.push_back(n);
		ans(b[0], b[1]);
	}
}

Compilation message

highway.cpp: In function 'int main()':
highway.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i+1<a[1].size(); i+=2) {
               ~~~^~~~~~~~~~~~
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);
     ~~~~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct - 20 queries, 4 points
2 Correct 2 ms 376 KB Output is correct - 9 queries, 4 points
3 Correct 2 ms 584 KB Output is correct - 156 queries, 4 points
4 Correct 2 ms 584 KB Output is correct - 200 queries, 4 points
5 Correct 2 ms 604 KB Output is correct - 251 queries, 4 points
6 Correct 2 ms 608 KB Output is correct - 302 queries, 4 points
7 Correct 2 ms 624 KB Output is correct - 350 queries, 4 points
8 Correct 2 ms 748 KB Output is correct - 399 queries, 4 points
9 Correct 2 ms 764 KB Output is correct - 450 queries, 4 points
10 Correct 2 ms 764 KB Output is correct - 500 queries, 4 points
11 Correct 2 ms 764 KB Output is correct - 1001 queries, 4 points
12 Correct 2 ms 764 KB Output is correct - 1001 queries, 4 points
13 Correct 2 ms 764 KB Output is correct - 1502 queries, 4 points
14 Correct 2 ms 764 KB Output is correct - 2003 queries, 4 points
15 Correct 2 ms 764 KB Output is correct - 2502 queries, 4 points
16 Correct 2 ms 764 KB Output is correct - 803 queries, 4 points
17 Correct 2 ms 764 KB Output is correct - 854 queries, 4 points
18 Correct 2 ms 764 KB Output is correct - 900 queries, 4 points
19 Correct 2 ms 836 KB Output is correct - 12705 queries, 4 points
20 Correct 3 ms 904 KB Output is correct - 15000 queries, 4 points
21 Correct 3 ms 972 KB Output is correct - 20060 queries, 4 points
22 Correct 3 ms 1104 KB Output is correct - 28061 queries, 4 points
23 Correct 3 ms 1104 KB Output is correct - 33888 queries, 4 points
24 Correct 3 ms 1236 KB Output is correct - 40944 queries, 4 points
25 Correct 3 ms 1488 KB Output is correct - 49998 queries, 4 points