#define _CRT_SECURE_NO_WARNINGS
#include "key.h"
#include "bits/stdc++.h"
using namespace std;
void EnsureKeyInfo(int n) {
int arr[1001];
for (int i = 1; i <= n; i++)
{
TakeKey(i);
arr[i] = Explore();
}
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= n; j++)
{
if (i == j)
{
Report(i, i);
continue;
}
TakeKey(i);
TakeKey(j);
int res = Explore();
if (res <= max(arr[i], arr[j]))
{
if (arr[i] > arr[j])
{
Report(i, j);
}
else if (arr[i] < arr[j])
{
Report(j, i);
}
else
Report(i, j), Report(j, i);
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
612 KB |
Output is correct |
3 |
Correct |
3 ms |
648 KB |
Output is correct |
4 |
Correct |
3 ms |
724 KB |
Output is correct |
5 |
Correct |
3 ms |
724 KB |
Output is correct |
6 |
Correct |
4 ms |
724 KB |
Output is correct |
7 |
Correct |
5 ms |
928 KB |
Output is correct |
8 |
Correct |
4 ms |
928 KB |
Output is correct |
9 |
Correct |
5 ms |
1076 KB |
Output is correct |
10 |
Correct |
4 ms |
1076 KB |
Output is correct |
11 |
Correct |
4 ms |
1076 KB |
Output is correct |
12 |
Correct |
4 ms |
1076 KB |
Output is correct |
13 |
Correct |
3 ms |
1076 KB |
Output is correct |
14 |
Correct |
6 ms |
1076 KB |
Output is correct |
15 |
Correct |
5 ms |
1076 KB |
Output is correct |
16 |
Correct |
3 ms |
1076 KB |
Output is correct |
17 |
Correct |
4 ms |
1076 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
612 KB |
Output is correct |
3 |
Correct |
3 ms |
648 KB |
Output is correct |
4 |
Correct |
3 ms |
724 KB |
Output is correct |
5 |
Correct |
3 ms |
724 KB |
Output is correct |
6 |
Correct |
4 ms |
724 KB |
Output is correct |
7 |
Correct |
5 ms |
928 KB |
Output is correct |
8 |
Correct |
4 ms |
928 KB |
Output is correct |
9 |
Correct |
5 ms |
1076 KB |
Output is correct |
10 |
Correct |
4 ms |
1076 KB |
Output is correct |
11 |
Correct |
4 ms |
1076 KB |
Output is correct |
12 |
Correct |
4 ms |
1076 KB |
Output is correct |
13 |
Correct |
3 ms |
1076 KB |
Output is correct |
14 |
Correct |
6 ms |
1076 KB |
Output is correct |
15 |
Correct |
5 ms |
1076 KB |
Output is correct |
16 |
Correct |
3 ms |
1076 KB |
Output is correct |
17 |
Correct |
4 ms |
1076 KB |
Output is correct |
18 |
Runtime error |
9 ms |
1900 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 |
612 KB |
Output is correct |
3 |
Correct |
3 ms |
648 KB |
Output is correct |
4 |
Correct |
3 ms |
724 KB |
Output is correct |
5 |
Correct |
3 ms |
724 KB |
Output is correct |
6 |
Correct |
4 ms |
724 KB |
Output is correct |
7 |
Correct |
5 ms |
928 KB |
Output is correct |
8 |
Correct |
4 ms |
928 KB |
Output is correct |
9 |
Correct |
5 ms |
1076 KB |
Output is correct |
10 |
Correct |
4 ms |
1076 KB |
Output is correct |
11 |
Correct |
4 ms |
1076 KB |
Output is correct |
12 |
Correct |
4 ms |
1076 KB |
Output is correct |
13 |
Correct |
3 ms |
1076 KB |
Output is correct |
14 |
Correct |
6 ms |
1076 KB |
Output is correct |
15 |
Correct |
5 ms |
1076 KB |
Output is correct |
16 |
Correct |
3 ms |
1076 KB |
Output is correct |
17 |
Correct |
4 ms |
1076 KB |
Output is correct |
18 |
Runtime error |
9 ms |
1900 KB |
Execution failed because the return code was nonzero |
19 |
Halted |
0 ms |
0 KB |
- |