Submission #391352

#TimeUsernameProblemLanguageResultExecution timeMemory
391352MahdiBahramianPark (BOI16_park)C++11
0 / 100
4 ms588 KiB
#include<bits/stdc++.h> #define F first #define S second #define make make_pair #define pb push_back using namespace std; const int Max = 1e3 + 10; int X[Max] , Y[Max] , R[Max] , S[Max] , RR[Max]; int main() { int n , q; cin >> n >> q; int W , H; cin >> W >> H; // 1 : (0,0) // 2 : (W,0) // 3 : (W,H) // 4 : (0,H) for(int i = 1 ; i <= n ; i++) cin >> X[i] >> Y[i] >> R[i]; for(int i = 1 ; i <= q ; i++) cin >> S[i] >> RR[i]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...