oj.uz

Submission #475214

# Submission time Handle Problem Language Result Execution time Memory
475214 2021-09-21T13:35:49 Z bigo Trampoline (info1cup20_trampoline) C++14
0 / 100
 1335 ms 19844 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
#define pii pair<int, int>
vector<vector<int>>vec;
vector<bool>visit;
void dfs(int v) {
	visit[v] = true;
	for (auto u:vec[v]) {
		if (!visit[u])
			dfs(u);
	}
}
int main() {
	int r, c, n;
	cin >> r >> c >> n;
	set<pii>green;
	set<int>green1;
	int a, b;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		a--, b--;
		green.insert({ a,b });
		green1.insert(a * c + b);
	}
	int t;
	cin >> t;
	while (t--) {
		int y1, x1, y2, x2;
		cin >> y1 >> x1 >> y2 >> x2;
		y1--, x1--, y2--, x2--;
		auto it = green1.lower_bound(y1 * c + x1);
		if (*it <= y1 * c + x2)
			cout << "YES";
		else
			cout << "NO";
		cout << endl;
	}
}

Subtask #1
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1100 KB expected NO, found YES [2nd token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 326 ms 19028 KB expected NO, found YES [1st token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1228 ms 19740 KB expected NO, found YES [65th token]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 716 KB expected NO, found YES [17th token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1335 ms 19844 KB expected NO, found YES [12th token]
2 Halted 0 ms 0 KB -