#include <bits/stdc++.h>
#include "office.h"
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int n = GetN();
vector<int> otherline;
int a, b;
if (isOnLine(1, 2, 3))
{
// [{1, 2, 3}]
a = 1;
b = 2;
if (!isOnLine(1, 2, 4))
otherline.push_back(4);
}
else if (isOnLine(1, 2, 4))
{
// [{1, 2}, {3}]
a = 1;
b = 2;
otherline = {3};
}
else if (isOnLine(2, 3, 4))
{
// [{2, 3}, {1}]
a = 2;
b = 3;
otherline = {1};
}
else if (isOnLine(2, 3, 4))
{
// [{3, 1}, {2}]
a = 1;
b = 3;
otherline = {2};
}
else
{
// [{1, 2}, {3, 4}] or [{1, 3}, {2, 4}] or [{2, 3}, {1, 4}].
if (isOnLine(1, 2, 5) || isOnLine(3, 4, 5))
{
Answer(1, 2, 3, 4);
return 0;
}
if (isOnLine(1, 3, 5) || isOnLine(2, 4, 5))
{
Answer(1, 3, 2, 4);
return 0;
}
Answer(2, 3, 1, 4);
return 0;
}
for (int i = 5; i + 1 <= n && otherline.size() < 2; i += 2)
{
if (isOnLine(a, i, i + 1))
continue;
if (isOnLine(a, b, i + 1))
otherline.push_back(i);
else if (isOnLine(a, b, i))
otherline.push_back(i + 1);
else
{
otherline.push_back(i);
otherline.push_back(i + 1);
break;
}
}
if (n % 2 && otherline.size() < 2)
otherline.push_back(n);
Answer(a, b, otherline[0], otherline[1]);
return 0;
}
Compilation message
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 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 23 queries, 2 points |
| 2 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 13 queries, 2 points |
| 3 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 159 queries, 2 points |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 254 queries, 2 points |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 353 queries, 2 points |
| 8 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 403 queries, 2 points |
| 9 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 453 queries, 2 points |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 1004 queries, 2 points |
| 12 |
Correct |
0 ms |
344 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 1505 queries, 2 points |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 2506 queries, 2 points |
| 16 |
Correct |
0 ms |
344 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 857 queries, 2 points |
| 18 |
Partially correct |
0 ms |
344 KB |
Output is partially correct - 903 queries, 2 points |
| 19 |
Correct |
0 ms |
344 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Partially correct |
1 ms |
344 KB |
Output is partially correct - 15003 queries, 2 points |
| 21 |
Correct |
1 ms |
600 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
600 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
600 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Partially correct |
1 ms |
600 KB |
Output is partially correct - 40947 queries, 2 points |
| 25 |
Partially correct |
1 ms |
600 KB |
Output is partially correct - 50002 queries, 2 points |
