#include <iostream>
#include <vector>
#include "office.h"
using namespace std;
using vi = vector<int>;
#define sz(x) int(x.size())
int main()
{
int N = GetN();
int Q123 = isOnLine(1, 2, 3);
int Q341 = isOnLine(3, 4, 1);
vi biglist, smalllist;
if(Q123 && Q341) //elements are homogenous (4, 0)
{
vi goodlist;
for(int i = 5; i+1 <= N; i += 2)
{
if(!isOnLine(1, i, i+1))
{
goodlist.push_back(i);
}
}
if(N % 2 == 0)
{
if(sz(goodlist) == 1)
Answer(1, 2, goodlist[0], goodlist[0] + 1);
else
{
int e1 = isOnLine(1, 2, goodlist[0]) ? goodlist[0] + 1 : goodlist[0];
int e2 = isOnLine(1, 2, goodlist[1]) ? goodlist[1] + 1 : goodlist[1];
Answer(1, 2, e1, e2);
}
}
else
{
if(sz(goodlist) == 1)
{
vi lst{1, 2};
int agood = !isOnLine(lst[0], lst[1], goodlist[0]);
int bgood = !isOnLine(lst[0], lst[1], goodlist[0] + 1);
if(agood && bgood) Answer(lst[0], lst[1], goodlist[0], goodlist[0] + 1);
else if(agood) Answer(lst[0], lst[1], goodlist[0], N);
else Answer(lst[0], lst[1], goodlist[0] + 1, N);
}
else
{
int e1 = isOnLine(1, 2, goodlist[0]) ? goodlist[0] + 1 : goodlist[0];
int e2 = isOnLine(1, 2, goodlist[1]) ? goodlist[1] + 1 : goodlist[1];
Answer(1, 2, e1, e2);
}
}
}
else
{
int Q234 = isOnLine(2, 3, 4);
int Q412 = isOnLine(4, 1, 2);
int tot = Q234 + Q412 + Q123 + Q341;
if(tot == 0) //(2, 2)
{
if(isOnLine(5, 1, 2)) Answer(1, 2, 3, 4);
else if(isOnLine(5, 2, 3)) Answer(1, 4, 2, 3);
else Answer(1, 3, 2, 4);
return 0;
}
int exc = 0;
if(Q123) exc = 4;
else if(Q341) exc = 2;
else if(Q234) exc = 1;
else exc = 3;
vi lst;
for(int i = 1; i <= 4; i++)
if(i != exc)
lst.push_back(i);
vi goodlist;
for(int i = 5; i+1 <= N; i += 2)
{
if(!isOnLine(lst[0], lst[1], i))
goodlist.push_back(i);
}
if(sz(goodlist) >= 2)
{
int e1 = isOnLine(lst[0], lst[1], goodlist[0]) ? goodlist[0] + 1 : goodlist[0];
int e2 = isOnLine(lst[0], lst[1], goodlist[1]) ? goodlist[1] + 1 : goodlist[1];
Answer(lst[0], lst[1], e1, e2);
return 0;
}
else
{
int agood = !isOnLine(lst[0], lst[1], goodlist[0]);
int bgood = !isOnLine(lst[0], lst[1], goodlist[0] + 1);
if(agood && bgood) Answer(lst[0], lst[1], goodlist[0], goodlist[0] + 1);
else if(agood) Answer(lst[0], lst[1], goodlist[0], N);
else Answer(lst[0], lst[1], goodlist[0] + 1, N);
}
}
}
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 |
Correct |
0 ms |
208 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 |
1 ms |
208 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
0 ms |
208 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 |
208 KB |
Output is correct - 352 queries, 4 points |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct - 402 queries, 4 points |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct - 452 queries, 4 points |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct - 1003 queries, 4 points |
| 12 |
Correct |
0 ms |
208 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
0 ms |
208 KB |
Output is correct - 1504 queries, 4 points |
| 14 |
Correct |
0 ms |
208 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
0 ms |
208 KB |
Output is correct - 2505 queries, 4 points |
| 16 |
Correct |
0 ms |
208 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
0 ms |
208 KB |
Output is correct - 856 queries, 4 points |
| 18 |
Correct |
1 ms |
208 KB |
Output is correct - 902 queries, 4 points |
| 19 |
Correct |
1 ms |
336 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct - 15002 queries, 4 points |
| 21 |
Correct |
1 ms |
336 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
464 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
464 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
1 ms |
592 KB |
Output is correct - 40946 queries, 4 points |
| 25 |
Correct |
2 ms |
592 KB |
Output is correct - 50001 queries, 4 points |
