#include "key.h"
int gv[1010], gvv[1010][1010];
void EnsureKeyInfo(int N) {
int i, j;
for(i=1 ; i<=N ; i++)
{
TakeKey(i); gv[i]=Explore();
}
for(i=1 ; i<=N ; i++)
{
for(j=i+1 ; j<=N ; j++)
{
TakeKey(i); TakeKey(j); gvv[i][j]=Explore(); gvv[j][i]=gvv[i][j];
}
}
for(i=1 ; i<=N ; i++)
{
for(j=1 ; j<=N ; j++)
{
if(j==i) Report(i,i);
if(j==i) continue;
if(gvv[i][j]==gv[i]) Report(i,j);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
996 KB |
Output is correct |
3 |
Correct |
3 ms |
996 KB |
Output is correct |
4 |
Correct |
3 ms |
1072 KB |
Output is correct |
5 |
Correct |
3 ms |
1072 KB |
Output is correct |
6 |
Correct |
4 ms |
1072 KB |
Output is correct |
7 |
Correct |
5 ms |
1276 KB |
Output is correct |
8 |
Correct |
5 ms |
1276 KB |
Output is correct |
9 |
Correct |
5 ms |
1280 KB |
Output is correct |
10 |
Correct |
5 ms |
1280 KB |
Output is correct |
11 |
Correct |
4 ms |
1280 KB |
Output is correct |
12 |
Correct |
5 ms |
1280 KB |
Output is correct |
13 |
Correct |
5 ms |
1308 KB |
Output is correct |
14 |
Correct |
4 ms |
1308 KB |
Output is correct |
15 |
Correct |
5 ms |
1312 KB |
Output is correct |
16 |
Correct |
5 ms |
1312 KB |
Output is correct |
17 |
Correct |
6 ms |
1312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
996 KB |
Output is correct |
3 |
Correct |
3 ms |
996 KB |
Output is correct |
4 |
Correct |
3 ms |
1072 KB |
Output is correct |
5 |
Correct |
3 ms |
1072 KB |
Output is correct |
6 |
Correct |
4 ms |
1072 KB |
Output is correct |
7 |
Correct |
5 ms |
1276 KB |
Output is correct |
8 |
Correct |
5 ms |
1276 KB |
Output is correct |
9 |
Correct |
5 ms |
1280 KB |
Output is correct |
10 |
Correct |
5 ms |
1280 KB |
Output is correct |
11 |
Correct |
4 ms |
1280 KB |
Output is correct |
12 |
Correct |
5 ms |
1280 KB |
Output is correct |
13 |
Correct |
5 ms |
1308 KB |
Output is correct |
14 |
Correct |
4 ms |
1308 KB |
Output is correct |
15 |
Correct |
5 ms |
1312 KB |
Output is correct |
16 |
Correct |
5 ms |
1312 KB |
Output is correct |
17 |
Correct |
6 ms |
1312 KB |
Output is correct |
18 |
Runtime error |
11 ms |
3180 KB |
Execution failed because the return code was nonzero |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
996 KB |
Output is correct |
3 |
Correct |
3 ms |
996 KB |
Output is correct |
4 |
Correct |
3 ms |
1072 KB |
Output is correct |
5 |
Correct |
3 ms |
1072 KB |
Output is correct |
6 |
Correct |
4 ms |
1072 KB |
Output is correct |
7 |
Correct |
5 ms |
1276 KB |
Output is correct |
8 |
Correct |
5 ms |
1276 KB |
Output is correct |
9 |
Correct |
5 ms |
1280 KB |
Output is correct |
10 |
Correct |
5 ms |
1280 KB |
Output is correct |
11 |
Correct |
4 ms |
1280 KB |
Output is correct |
12 |
Correct |
5 ms |
1280 KB |
Output is correct |
13 |
Correct |
5 ms |
1308 KB |
Output is correct |
14 |
Correct |
4 ms |
1308 KB |
Output is correct |
15 |
Correct |
5 ms |
1312 KB |
Output is correct |
16 |
Correct |
5 ms |
1312 KB |
Output is correct |
17 |
Correct |
6 ms |
1312 KB |
Output is correct |
18 |
Runtime error |
11 ms |
3180 KB |
Execution failed because the return code was nonzero |
19 |
Halted |
0 ms |
0 KB |
- |