# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
320577 |
2020-11-09T06:43:53 Z |
arnold518 |
Park (JOI17_park) |
C++14 |
|
32 ms |
632 KB |
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1500;
int T, N;
int P[MAXN+10];
int query(int A, int B, int *PP)
{
return Ask(A, B, PP);
}
void Detect(int _T, int _N)
{
T=_T; N=_N;
for(int i=0; i<N; i++)
{
for(int j=i+1; j<N; j++)
{
P[i]=1; P[j]=1;
if(query(i, j, P))
{
Answer(i, j);
}
P[i]=0; P[j]=0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
5 ms |
364 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
376 KB |
Output is correct |
5 |
Correct |
5 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
32 ms |
484 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
364 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
492 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
632 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |