oj.uz

답안 #487946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487946 2021-11-17T07:33:22 Z maks007 Trampoline (info1cup20_trampoline) C++14
0 / 100
 491 ms 30056 KB 
#include <bits/stdc++.h>

using namespace std;
void solve() {
	int n, m, green;
	cin >> n >> m >> green;
	const int N = n * m;

	map <int, pair <int, int>> mp, mp2;

	for(int i = 0; i < green; i ++) {
		int x, y;
		cin >> x >> y;
 		x --;
 		y --;
 		mp[x] = {1, y};
 		mp2[y] = {2, x};
	}

	int q;

	cin >> q;
	while(q --) {
		pair <int, int > start, end;
		cin >> start.first >> start.second >> end.first >> end.second;
		if(start.first == end.first) {
			cout << "Yes\n";
			continue;
		}
		start.first --;
		start.second --;
		end.first --;
		end.second --;
		int temp = start.second;
		if(mp[start.first].first == 0 or mp[start.first].second < temp) {
			cout << "No\n";
			goto end;
		}
		for(int i = start.first; i <= start.second; i ++) {
			if(mp[i].first == 0 or mp[i].second < temp) {
				cout << "No\n";
				goto end;
			}
			temp = mp[i].second;
		}
		cout << "Yes\n";
		end:;
	}


}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int Q = 1;
	//cin >> Q;
	while (Q --) {
		solve();
	}
	return 0;
}

Compilation message

trampoline.cpp: In function 'void solve()':
trampoline.cpp:7:12: warning: unused variable 'N' [-Wunused-variable]
    7 |  const int N = n * m;
      |            ^

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 332 KB expected YES, found NO [5th token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 65 ms 600 KB expected NO, found YES [2nd token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 242 ms 25140 KB expected YES, found NO [9th token]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 844 KB expected YES, found NO [1st token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 491 ms 30056 KB expected YES, found NO [3rd token]
2 Halted 0 ms 0 KB -