Submission #1519840

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;

int main()
{
    long long N, D, K;
    cin >> N >> D >> K;
    vector<long long> L(D), R(D);
    REP (i, D) {
        cin >> L[i] >> R[i];
        L[i]--;
        R[i]--;
    }
    vector<long long> S(K), T(K);
    REP (i, K) {
        cin >> S[i] >> T[i];
        S[i]--;
        T[i]--;
    }

    vector<long long> ans(K, 0);

    REP (i, K) {
        REP (j, D) {
            if (L[j] <= S[i] && S[i] <= R[j]) { //移動できる
                if (L[j] <= T[i] && T[i] <= R[j]) { //ゴールがあるなら終わり
                    ans[i] = j + 1;
                    break;
                } else { //そうじゃないなら両端のうち近いほう
                    S[i] = (abs(T[i] - L[j]) > abs(T[i] - R[j]) ? R[j] : L[j]);
                }
            }
        }
    }

    REP (i, K)
        cout << ans[i] << endl;
}

Submission Info

Judge Result