#include "key.h"
#include <algorithm>
using namespace std;
int self[1010];
void EnsureKeyInfo(int N) {
for(int i=1; i<=N; i++){
TakeKey(i);
self[i]=Explore();
Report(i, i);
}
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(i == j) continue;
TakeKey(i), TakeKey(j);
int x = Explore();
if(self[i] == x) Report(i, j);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
744 KB |
Output is correct |
3 |
Correct |
5 ms |
744 KB |
Output is correct |
4 |
Correct |
4 ms |
744 KB |
Output is correct |
5 |
Correct |
5 ms |
828 KB |
Output is correct |
6 |
Correct |
5 ms |
828 KB |
Output is correct |
7 |
Correct |
5 ms |
876 KB |
Output is correct |
8 |
Correct |
6 ms |
932 KB |
Output is correct |
9 |
Correct |
7 ms |
1108 KB |
Output is correct |
10 |
Correct |
5 ms |
1108 KB |
Output is correct |
11 |
Correct |
6 ms |
1108 KB |
Output is correct |
12 |
Correct |
5 ms |
1108 KB |
Output is correct |
13 |
Correct |
5 ms |
1108 KB |
Output is correct |
14 |
Correct |
6 ms |
1108 KB |
Output is correct |
15 |
Correct |
6 ms |
1108 KB |
Output is correct |
16 |
Correct |
6 ms |
1120 KB |
Output is correct |
17 |
Correct |
6 ms |
1120 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
744 KB |
Output is correct |
3 |
Correct |
5 ms |
744 KB |
Output is correct |
4 |
Correct |
4 ms |
744 KB |
Output is correct |
5 |
Correct |
5 ms |
828 KB |
Output is correct |
6 |
Correct |
5 ms |
828 KB |
Output is correct |
7 |
Correct |
5 ms |
876 KB |
Output is correct |
8 |
Correct |
6 ms |
932 KB |
Output is correct |
9 |
Correct |
7 ms |
1108 KB |
Output is correct |
10 |
Correct |
5 ms |
1108 KB |
Output is correct |
11 |
Correct |
6 ms |
1108 KB |
Output is correct |
12 |
Correct |
5 ms |
1108 KB |
Output is correct |
13 |
Correct |
5 ms |
1108 KB |
Output is correct |
14 |
Correct |
6 ms |
1108 KB |
Output is correct |
15 |
Correct |
6 ms |
1108 KB |
Output is correct |
16 |
Correct |
6 ms |
1120 KB |
Output is correct |
17 |
Correct |
6 ms |
1120 KB |
Output is correct |
18 |
Runtime error |
10 ms |
1900 KB |
Execution failed because the return code was nonzero |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
744 KB |
Output is correct |
3 |
Correct |
5 ms |
744 KB |
Output is correct |
4 |
Correct |
4 ms |
744 KB |
Output is correct |
5 |
Correct |
5 ms |
828 KB |
Output is correct |
6 |
Correct |
5 ms |
828 KB |
Output is correct |
7 |
Correct |
5 ms |
876 KB |
Output is correct |
8 |
Correct |
6 ms |
932 KB |
Output is correct |
9 |
Correct |
7 ms |
1108 KB |
Output is correct |
10 |
Correct |
5 ms |
1108 KB |
Output is correct |
11 |
Correct |
6 ms |
1108 KB |
Output is correct |
12 |
Correct |
5 ms |
1108 KB |
Output is correct |
13 |
Correct |
5 ms |
1108 KB |
Output is correct |
14 |
Correct |
6 ms |
1108 KB |
Output is correct |
15 |
Correct |
6 ms |
1108 KB |
Output is correct |
16 |
Correct |
6 ms |
1120 KB |
Output is correct |
17 |
Correct |
6 ms |
1120 KB |
Output is correct |
18 |
Runtime error |
10 ms |
1900 KB |
Execution failed because the return code was nonzero |
19 |
Halted |
0 ms |
0 KB |
- |