Submission #6518702

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>

using namespace std;

int main(){

    int N, D, K;
    cin >> N >> D >> K;
    vector<pair<int, int>> LR(D);
    vector<pair<int, int>> ST(K);

    int l, r;
    for(int i = 0; i < D; i++){
        cin >> l >> r;
        LR[i] = make_pair(l, r);
    }

    vector<int> pos(K);
    int s, t;
    for(int i = 0; i < K; i++){
        cin >> s >> t;
        ST[i] = make_pair(s, t);
        pos[i] = s;
    }

    vector<int> ans(K, -1);
    for(int i = 0; i < D; i++){
        auto lr = LR[i];
        for(int j = 0; j < K; j++){
            if(ans[j] != -1){
                continue;
            }

            int target = ST[j].second;
            if(lr.first <= pos[j] && pos[j] <= lr.second){
                if(lr.first <= target && target <= lr.second){
                    ans[j] = i + 1;
                    pos[j] = target;
                }
                else{
                    if(pos[j] <= target){
                        pos[j] = lr.second;
                    }
                    else{
                        pos[j] = lr.first;
                    }
                }
            }
        }
    }

    for(int i = 0; i < K; i++){
        cout << ans[i] << endl;
    }

    return 0;
}

Submission Info

Judge Result