Submission #23176

#TimeUsernameProblemLanguageResultExecution timeMemory
23176duongthoi1999Park (JOI17_park)C++14
10 / 100
43 ms2112 KiB
#include "park.h" #include <bits/stdc++.h> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define all(x) (x).begin(),(x).end() #define fi first #define se second #define SZ(x) ((int)(x).size()) typedef long long ll; typedef long double ld; typedef pair<ll, int> ii; const int mod = (int) 1e9 + 7; const ll inf = 1LL << 60; const int maxn = (int) 3e5 + 5; const ld eps = 1e-9; int Place[1400]; void Detect(int T, int N) { rep(i, 0, N) Place[i] = 0; rep(i, 0, N) { rep(j, i + 1, N) { Place[i] = Place[j] = 1; if(Ask(i, j, Place)) { Answer(i, j); cerr << i << ' ' << j << endl; } Place[i] = Place[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...