#include <bits/stdc++.h>
#include "office.h"
using namespace std;
int main(){
int n = GetN();
int use = -1;
if(isOnLine(1,2,3)){
for(int i = 4; i+1 <= n; i += 2){
if(!isOnLine(1,i,i+1)){
int b1 = isOnLine(1,2,i);
int b2 = isOnLine(1,2,i+1);
if(!b1 && !b2){
Answer(1,2,i,i+1);
return 0;
}else if(!b1){
if(use == -1){
use = i;
}else{
Answer(1,2,use,i);
return 0;
}
}else if(!b2){
if(use == -1){
use = i+1;
}else{
Answer(1,2,use,i+1);
return 0;
}
}else{
// Contradiction.
throw 0;
}
}
}
Answer(1,2,use,n);
}else if(isOnLine(1,3,4)){
for(int i = 5; i+1 <= n; i += 2){
if(!isOnLine(1,i,i+1)){
int b1 = isOnLine(1,3,i);
if(!b1){
Answer(1,3,2,i);
return 0;
}else{
Answer(1,3,2,i+1);
return 0;
}
}
}
Answer(1,3,2,n);
}else if(isOnLine(2,3,4)){
for(int i = 5; i+1 <= n; i += 2){
if(!isOnLine(2,i,i+1)){
int b1 = isOnLine(2,3,i);
if(!b1){
Answer(2,3,1,i);
return 0;
}else{
Answer(2,3,1,i+1);
return 0;
}
}
}
Answer(2,3,1,n);
}else if(isOnLine(1,4,5)){
Answer(1,4,2,3);
}else{
if(isOnLine(2,3,5)){
Answer(1,4,2,3);
}else if(isOnLine(2,4,5)){
Answer(1,3,2,4);
}else if(isOnLine(3,4,5)){
Answer(1,2,3,4);
}else if(isOnLine(1,2,4)){
Answer(1,2,3,5);
}else if(isOnLine(1,2,5)){
Answer(1,2,3,4);
}else if(isOnLine(1,3,5)){
Answer(1,3,2,4);
}else{
throw 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 |
2 ms |
256 KB |
Output is correct - 21 queries, 4 points |
| 2 |
Correct |
2 ms |
500 KB |
Output is correct - 11 queries, 4 points |
| 3 |
Correct |
2 ms |
500 KB |
Output is correct - 157 queries, 4 points |
| 4 |
Partially correct |
2 ms |
500 KB |
Output is partially correct - 204 queries, 2 points |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct - 252 queries, 4 points |
| 6 |
Partially correct |
2 ms |
540 KB |
Output is partially correct - 305 queries, 2 points |
| 7 |
Correct |
2 ms |
556 KB |
Output is correct - 351 queries, 4 points |
| 8 |
Correct |
2 ms |
556 KB |
Output is correct - 401 queries, 4 points |
| 9 |
Correct |
2 ms |
556 KB |
Output is correct - 451 queries, 4 points |
| 10 |
Partially correct |
2 ms |
556 KB |
Output is partially correct - 504 queries, 2 points |
| 11 |
Correct |
3 ms |
560 KB |
Output is correct - 1002 queries, 4 points |
| 12 |
Partially correct |
2 ms |
560 KB |
Output is partially correct - 1005 queries, 2 points |
| 13 |
Correct |
2 ms |
560 KB |
Output is correct - 1503 queries, 4 points |
| 14 |
Partially correct |
2 ms |
560 KB |
Output is partially correct - 2006 queries, 2 points |
| 15 |
Correct |
2 ms |
560 KB |
Output is correct - 2504 queries, 4 points |
| 16 |
Partially correct |
2 ms |
560 KB |
Output is partially correct - 807 queries, 2 points |
| 17 |
Correct |
2 ms |
560 KB |
Output is correct - 855 queries, 4 points |
| 18 |
Correct |
2 ms |
560 KB |
Output is correct - 901 queries, 4 points |
| 19 |
Partially correct |
2 ms |
736 KB |
Output is partially correct - 12709 queries, 2 points |
| 20 |
Correct |
3 ms |
736 KB |
Output is correct - 15001 queries, 4 points |
| 21 |
Partially correct |
2 ms |
876 KB |
Output is partially correct - 20064 queries, 2 points |
| 22 |
Partially correct |
2 ms |
876 KB |
Output is partially correct - 28065 queries, 2 points |
| 23 |
Partially correct |
3 ms |
876 KB |
Output is partially correct - 33892 queries, 2 points |
| 24 |
Correct |
3 ms |
892 KB |
Output is correct - 40945 queries, 4 points |
| 25 |
Correct |
3 ms |
892 KB |
Output is correct - 50000 queries, 4 points |
