Submission #1301899

#TimeUsernameProblemLanguageResultExecution timeMemory
1301899vako_pPark (JOI17_park)C++20
10 / 100
32 ms492 KiB
#include "park.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define sd second const int mxN = 1500; ll n; ll query(ll x, ll y, vector<ll> v){ int place[n]; for(int i = 0; i < n; i++) place[i] = 0; for(auto it : v) place[it] = 1; return Ask(x, y, place); } void Detect(int T, int N) { n = N; for(int i = 0; i < n; i++){ for(int j = i + 1; j < n; j++){ if(query(i, j, {i, j})) Answer(i, j); } } }
#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...