제출 #225920

#제출 시각아이디문제언어결과실행 시간메모리
225920balbitPark (JOI17_park)C++14
10 / 100
66 ms512 KiB
#include <bits/stdc++.h> #ifndef BALBIT #include "park.h" #endif // BALBIT using namespace std; #define ll long long #define pii pair<int,int> #define f first #define s second #define SZ(x) (int)(x.size()) #define ALL(x) x.begin(),x.end() #define pb push_back #ifdef BALBIT #define bug(...) cerr<<__LINE__<<": "<<#__VA_ARGS__<<": ", _do(__VA_ARGS__) template<typename T> void _do(T && x){cerr<<x<<endl;} template<typename T, typename ...S> void _do(T && x, S&&...y){cerr<<x<<", "; _do(y...);} #define IOS() #else #define IOS() ios::sync_with_stdio(0),cin.tie(0) #define endl '\n' #define bug(...) #endif // BALBIT const int maxn = 3e5+5; static int B[1400]; void Detect(int T, int n) { for (int i = 0; i<n; ++i) { for (int j = 0; j<i; ++j) { B[i] = B[j] = 1; if (Ask (j,i,B) == 1) { Answer(j,i); } B[i] = B[j] = 0; } } } #ifdef BALBIT signed main(){ bug(1,2,3); } #endif
#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...