oj.uz

답안 #522143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
522143 2022-02-04T00:28:00 Z maks007 Trampoline (info1cup20_trampoline) C++14
43 / 100
 2000 ms 392616 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	map <int,vector <int>> a;
	int q;
	cin >> q;
	while(q --) {
		int x, y;
		cin >> x >> y;
		x --;
		y --;
		a[x].push_back(y);
	}
	for(int i = 0; i < n; i ++) sort(a[i].begin(), a[i].end());
	cin >> q;
	while(q --) {
		int startx, starty, endx, endy;
		cin >> startx >> starty >> endx >> endy;
		startx --;
		starty --;
		endx --;
		endy --;
		while(startx != endx) {
			auto it = lower_bound(a[startx].begin(), a[startx].end(), starty);
			if(it == a[startx].end()) {
				goto end;
			}
			startx ++;
			starty = *it;
		}
		if(startx == endx and starty <= endy){
			cout << "Yes\n";
		}else cout << "No\n";
		continue;
		end:;
		cout << "No\n";
	}
	return false;
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB 200 token(s): yes count is 21, no count is 179
2 Correct 3 ms 444 KB 200 token(s): yes count is 70, no count is 130
3 Correct 3 ms 336 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 1984 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 97 ms 4020 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 211 ms 3012 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 449 ms 3904 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2111 ms 366924 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2096 ms 389776 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2113 ms 392616 KB Time limit exceeded
2 Halted 0 ms 0 KB -