#include"office.h"
#include<bits/stdc++.h>
using namespace std;
int n;
/*int GetN () {}
int isOnLine (int x, int y, int z) {}
void Answer(int a1, int b1, int a2, int b2) {}*/
int main () {
n = GetN();
if (isOnLine(1, 2, 3)) {
vector <int> v;
for (int i = 4; i + 1 <= n && v.size() < 2; i += 2) {
if (isOnLine(1, i, i + 1)) continue;
if (isOnLine(2, 3, i) == 0) v.push_back(i); else v.push_back(i + 1);
}
if (v.size() == 1) v.push_back(v.back() + 1);
Answer(1, 2, v[0], v[1]);
} else {
int a = -1, b = -1, c = -1, d = -1;
if (isOnLine(1, 2, 4)) a = 1, b = 2, c = 4, d = 3;
if (isOnLine(1, 3, 4)) a = 1, b = 3, c = 4, d = 2;
if (isOnLine(2, 3, 4)) a = 2, b = 3, c = 4, d = 1;
if (a != -1) {
int res = -1;
for (int i = 5; i + 1 <= n; i += 2) {
if (isOnLine(a, i, i + 1)) continue;
if (i + 3 > n) {
res = i;
} else {
if (isOnLine(b, c, i) == 0) res = i; else res = i + 1;
}
break;
}
Answer(a, b, d, res);
} else {
if (isOnLine(1, 2, 5)) Answer(1, 2, 3, 4);
else if (isOnLine(1, 3, 5)) Answer(1, 3, 2, 4);
else if (isOnLine(1, 4, 5)) Answer(1, 4, 2, 3);
else if (isOnLine(2, 3, 5)) Answer(2, 3, 1, 4);
else if (isOnLine(2, 4, 5)) Answer(2, 4, 1, 3);
else if (isOnLine(3, 4, 5)) Answer(1, 2, 3, 4);
}
}
return 0;
}
Compilation message
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);
~~~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct - 20 queries, 4 points |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct - 10 queries, 4 points |
| 3 |
Correct |
0 ms |
256 KB |
Output is correct - 156 queries, 4 points |
| 4 |
Correct |
0 ms |
256 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
0 ms |
256 KB |
Output is correct - 251 queries, 4 points |
| 6 |
Correct |
0 ms |
256 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct - 350 queries, 4 points |
| 8 |
Correct |
0 ms |
256 KB |
Output is correct - 400 queries, 4 points |
| 9 |
Correct |
0 ms |
256 KB |
Output is correct - 450 queries, 4 points |
| 10 |
Correct |
0 ms |
256 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct - 1001 queries, 4 points |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
0 ms |
384 KB |
Output is correct - 1502 queries, 4 points |
| 14 |
Correct |
0 ms |
384 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
0 ms |
384 KB |
Output is correct - 2503 queries, 4 points |
| 16 |
Correct |
0 ms |
384 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
0 ms |
384 KB |
Output is correct - 854 queries, 4 points |
| 18 |
Correct |
0 ms |
384 KB |
Output is correct - 900 queries, 4 points |
| 19 |
Correct |
0 ms |
384 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
0 ms |
384 KB |
Output is correct - 15000 queries, 4 points |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
640 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
1 ms |
640 KB |
Output is correct - 40944 queries, 4 points |
| 25 |
Correct |
1 ms |
768 KB |
Output is correct - 49999 queries, 4 points |
