Submission #1484513

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;
using llng = long long;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T> >;

int main() {
    int N, D, K; cin >> N >> D >> K;
    v<int> L(D+1), R(D+1); for (int i=1; i<=D; i++) cin >> L[i] >> R[i];
    for (int k=0; k<K; k++) {
        int S, T; cin >> S >> T;
        for (int d=1; d<=D; d++) {
            if (S < L[d] || S > R[d]) continue;
            if (T >= L[d] && T <= R[d]) {
                cout << d << endl; break;
            }
            S = (S < T ? R[d] : L[d]);
        }
    }
    return 0;
}

Submission Info

Judge Result