Submission #1175350

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;

ll L[10010], R[10010];

int main()
{
	ll N, D, K;
	cin >> N >> D >> K;

	for (int i = 0; i < D; i++) {
		cin >> L[i] >> R[i];
	}

	vector<pair<ll,ll>> p(110);
	for (int i = 0; i < K; i++) {
		cin >> p[i].first >> p[i].second;
	}

	ll l, r;
	for (int i = 0; i < K; i++) {
		l = p[i].first;
		ll a = 0;

		while (a != D) {
			if (p[i].first < p[i].second) {
				if (L[a] <= l) {
					l = R[a];
					if (l >= p[i].second)break;
				}
			}else {
				if (R[a] >= l) {
					l = L[a];
					if (l <= p[i].second)break;
				}
			}
			a++;
		}
		if (a != D)
			cout << a + 1 << endl;
		else
			cout << a << endl;
	}
	return 0;
}

Submission Info

Judge Result