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;
static int place[1400];
int rem[1405];
void Detect(int T,int N){
for(int i=0;i<N;++i)rem[i]=7;
for(int i=0;i<N;++i){
if(rem[i]==0)continue;
for(int j=i+1;j<N;++j){
if(rem[j]==0)continue;
memset(place,0,sizeof place);
place[i]=place[j]=1;
if(Ask(i,j,place)){
Answer(i,j);
--rem[i];--rem[j];
}
}
}
}
# | 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... |