Submission #320577

#TimeUsernameProblemLanguageResultExecution timeMemory
320577arnold518Park (JOI17_park)C++14
10 / 100
32 ms632 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...