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<bits/stdc++.h>
#define ll int
#include "park.h"
using namespace std;
ll Place[1400];
void Detect(int T, int N)
{
if (T==1)
{
for (ll a=0; a<N; a++)
for (ll b=a+1; b<N; b++)
{
Place[a]=1; Place[b]=1;
if (Ask(a, b, Place))
Answer(a, b);
Place[a]=0; Place[b]=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... |