#include "office.h"
int main() {
int n = GetN(), i1, j1, i2, j2, i;
i1 = j1 = i2 = j2 = 0;
if (isOnLine(1, 2, 3))
i1 = 1, j1 = 2;
else if (isOnLine(4, 5, 6))
i1 = 5, j1 = 6;
else {
if (isOnLine(1, 2, 4))
i1 = 1, j1 = 2, i2 = 3;
else if (isOnLine(1, 3, 4))
i1 = 1, j1 = 3, i2 = 2;
else if (isOnLine(2, 3, 4))
i1 = 2, j1 = 3, i2 = 1;
else if (isOnLine(1, 2, 5))
i1 = 1, j1 = 2, i2 = 3, j2 = 4;
else if (isOnLine(1, 3, 5))
i1 = 1, j1 = 3, i2 = 2, j2 = 4;
else if (isOnLine(1, 4, 5))
i1 = 1, j1 = 4, i2 = 2, j2 = 3;
if (!j2)
for (j2 = 1; j2 <= 6; j2++)
if (j2 != i1 && j2 != j1 && j2 != i2 && !isOnLine(i1, j1, j2))
break;
Answer(i1, j1, i2, j2);
}
for (i = i1 == 1 ? 4 : 1; i <= n; i += 2)
if (i != 5 && (i + 2 > n || !isOnLine(i1, i, i + 1))) {
if (i == n || !isOnLine(i1, j1, i)) {
if (i2 == 0)
i2 = i;
else {
j2 = i;
break;
}
} else
if (i2 == 0)
i2 = i + 1;
else {
j2 = i + 1;
break;
}
}
Answer(i1, j1, i2, j2);
return 0;
}
Compilation message
office.c: In function 'isOnLine':
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
83 | int i;
| ^
office.c: In function 'Answer':
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
128 | if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
134 | if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
120 | int na1, nb1, na2, nb2, pont;
| ^~~~
office.c: In function '_doInit':
office.c:33:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | scanf("%d", &_N);
| ^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct - 20 queries, 4 points |
2 |
Correct |
0 ms |
208 KB |
Output is correct - 10 queries, 4 points |
3 |
Correct |
0 ms |
208 KB |
Output is correct - 156 queries, 4 points |
4 |
Correct |
0 ms |
208 KB |
Output is correct - 201 queries, 4 points |
5 |
Correct |
0 ms |
208 KB |
Output is correct - 251 queries, 4 points |
6 |
Correct |
0 ms |
208 KB |
Output is correct - 302 queries, 4 points |
7 |
Correct |
0 ms |
208 KB |
Output is correct - 350 queries, 4 points |
8 |
Correct |
0 ms |
208 KB |
Output is correct - 400 queries, 4 points |
9 |
Correct |
0 ms |
208 KB |
Output is correct - 450 queries, 4 points |
10 |
Correct |
0 ms |
208 KB |
Output is correct - 501 queries, 4 points |
11 |
Correct |
0 ms |
208 KB |
Output is correct - 1001 queries, 4 points |
12 |
Correct |
0 ms |
208 KB |
Output is correct - 1002 queries, 4 points |
13 |
Correct |
0 ms |
208 KB |
Output is correct - 1502 queries, 4 points |
14 |
Correct |
0 ms |
208 KB |
Output is correct - 2003 queries, 4 points |
15 |
Correct |
0 ms |
208 KB |
Output is correct - 2503 queries, 4 points |
16 |
Correct |
0 ms |
208 KB |
Output is correct - 804 queries, 4 points |
17 |
Correct |
0 ms |
208 KB |
Output is correct - 854 queries, 4 points |
18 |
Correct |
0 ms |
208 KB |
Output is correct - 900 queries, 4 points |
19 |
Correct |
0 ms |
336 KB |
Output is correct - 12706 queries, 4 points |
20 |
Correct |
1 ms |
336 KB |
Output is correct - 15000 queries, 4 points |
21 |
Correct |
1 ms |
336 KB |
Output is correct - 20061 queries, 4 points |
22 |
Correct |
1 ms |
464 KB |
Output is correct - 28062 queries, 4 points |
23 |
Correct |
1 ms |
464 KB |
Output is correct - 33889 queries, 4 points |
24 |
Correct |
1 ms |
592 KB |
Output is correct - 40944 queries, 4 points |
25 |
Correct |
1 ms |
592 KB |
Output is correct - 49999 queries, 4 points |