# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26950 | wangyenjen | Park (JOI17_park) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Author: Wang, Yen-Jen
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
inline void subtask1(int N) {
static int palce[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);
}