Submission #26951

#TimeUsernameProblemLanguageResultExecution timeMemory
26951wangyenjenPark (JOI17_park)C++14
10 / 100
9 ms2108 KiB
// Author: Wang, Yen-Jen #include "park.h" #include <bits/stdc++.h> using namespace std; inline void subtask1(int N) { static int place[250]; memset(place , 0 , sizeof(place)); for(int i = 0; i < N; i++) { for(int j = i + 1; j < N; j++) { place[i] = 1; place[j] = 1; if(Ask(i , j , place)) Answer(i , j); place[i] = 0; place[j] = 0; } } } void Detect(int T , int N) { if(T == 1) subtask1(N); }
#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...