// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
#include "office.h"
using namespace std;
#define nl '\n'
// g++ -std=c++17 office.cpp A.cpp
int main() {
cin.tie(0)->sync_with_stdio(0);
int N = GetN();
if (isOnLine(1, 2, 3)) {
vector<int> I; for(int i = 3; i < N; i++) I.push_back(i);
int a1 = 1, b1 = 2;
int a2 = -1, b2 = -1;
for(int i = 0; i < int(size(I)); i += 2) {
int a = I[i], b = I[i+1];
if (!isOnLine(a1, a + 1, b + 1)) {
if (isOnLine(a1, b1, a)) {
if (a2 == -1) a2 = b;
else b2 = b;
} else {
if (a2 == -1) a2 = a;
else b2 = a;
}
if (a2 != -1 && b2 != -1) break;
}
}
if (b2 == -1) {
assert(size(I) % 2);
b2 = I.back();
}
Answer(a1, b1, a2, b2);
} else if (isOnLine(1, 4, 5)) {
vector<int> I; for(int i = 1; i < N; i++) if (i != 3 && i != 4) I.push_back(i);
int a1 = 1, b1 = 4;
int a2 = -1, b2 = -1;
for(int i = 0; i < int(size(I)); i += 2) {
int a = I[i], b = I[i+1];
if (a == 1 || !isOnLine(a1, a + 1, b + 1)) {
if (isOnLine(a1, b1, a)) {
if (a2 == -1) a2 = b;
else b2 = b;
} else {
if (a2 == -1) a2 = a;
else b2 = a;
}
if (a2 != -1 && b2 != -1) break;
}
}
if (b2 == -1) {
assert(size(I) % 2);
b2 = I.back();
}
Answer(a1, b1, a2, b2);
} else if (isOnLine(2, 4, 5)) {
int a1 = 2, b1 = 4;
int a2 = 1, b2 = -1;
vector<int> I; for(int i = 5; i < N; i++) I.push_back(i);
for(int i = 0; i < int(size(I)); i += 2) {
int a = I[i], b = I[i+1];
if (!isOnLine(a1, a + 1, b + 1)) {
if (isOnLine(a1, b1, a)) {
if (a2 == -1) a2 = b;
else b2 = b;
} else {
if (a2 == -1) a2 = a;
else b2 = a;
}
if (a2 != -1 && b2 != -1) break;
}
}
if (b2 == -1) {
assert(size(I) % 2);
b2 = I.back();
}
Answer(a1, b1, a2, b2);
} else {
int a1, b1, a2, b2;
set<int> S = {0, 1, 2, 3, 4};
for(int i = 0; i < 5; i++) {
for(int j = i+1; j < 5; j++) {
for(int k = j+1; k < 5; k++) {
if (isOnLine(i + 1, j + 1, k + 1)) {
a1 = i + 1, b1 = j + 1;
S.erase(i); S.erase(j); S.erase(k);
a2 = *begin(S) + 1, b2 = *rbegin(S) + 1;
}
}
}
}
Answer(a1, b1, a2, b2);
}
return 0;
}
Compilation message
highway.cpp: In function 'int main()':
highway.cpp:106:9: warning: 'b2' may be used uninitialized in this function [-Wmaybe-uninitialized]
106 | Answer(a1, b1, a2, b2);
| ~~~~~~^~~~~~~~~~~~~~~~
highway.cpp:106:9: warning: 'a2' may be used uninitialized in this function [-Wmaybe-uninitialized]
highway.cpp:106:9: warning: 'b1' may be used uninitialized in this function [-Wmaybe-uninitialized]
highway.cpp:106:9: warning: 'a1' may be used uninitialized in this function [-Wmaybe-uninitialized]
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);
| ~~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
320 KB |
Output is correct - 22 queries, 4 points |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct - 12 queries, 4 points |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct - 158 queries, 4 points |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct - 253 queries, 4 points |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Correct |
0 ms |
324 KB |
Output is correct - 352 queries, 4 points |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct - 402 queries, 4 points |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct - 452 queries, 4 points |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct - 1003 queries, 4 points |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct - 1504 queries, 4 points |
| 14 |
Correct |
0 ms |
336 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
0 ms |
336 KB |
Output is correct - 2505 queries, 4 points |
| 16 |
Correct |
0 ms |
336 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
0 ms |
336 KB |
Output is correct - 856 queries, 4 points |
| 18 |
Correct |
0 ms |
336 KB |
Output is correct - 902 queries, 4 points |
| 19 |
Correct |
1 ms |
592 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
1 ms |
592 KB |
Output is correct - 15002 queries, 4 points |
| 21 |
Correct |
1 ms |
848 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
852 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
1236 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
1 ms |
1236 KB |
Output is correct - 40946 queries, 4 points |
| 25 |
Correct |
2 ms |
1364 KB |
Output is correct - 50001 queries, 4 points |
