oj.uz

Submission #391354

# Submission time Handle Problem Language Result Execution time Memory
391354 2021-04-18T15:52:27 Z MahdiBahramian Park (BOI16_park) C++11
0 / 100
 11 ms 452 KB 
#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] , cout << S[i] << '\n';
}

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 452 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -