Submission #19544296

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;

int main() {
	int n, d, k;
	cin >> n >> d >> k;
	vector<pair<int, int>> vp;
	for (int i = 0; i < d; i++) {
		int l, r;
		cin >> l >> r;
		vp.emplace_back(l, r);
	}
	for (int i = 0; i < k; i++) {
		int s, t;
		cin >> s >> t;
		int b = s, e = s;
		for (int j = 0; j < d; j++) {
			int l = vp[j].first, r = vp[j].second;
			if (e < l || r < b) {
				continue;
			} else {
				b = min(b, l);
				e = max(e, r);
			}
			if (t >= b && t <= e) {
				cout << j + 1 << endl;
				break;
			}
		}
	}
}

Submission Info

Judge Result