This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |