Submission #35721235

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

int main(){
    //1. 入力を受け取る
    int H, W, rs, cs;
    cin >> H >> W >> rs >> cs;
    int N;
    cin >> N;
    vector<int> r(N);
    vector<int> c(N);
    for (int i = 0; i < N; i++){
        cin >> r[i] >> c[i];
    }
    int Q;
    cin >> Q;
    vector<char> d(Q);
    vector<int> l(Q);
    for (int i = 0; i < Q; i++){
        cin >> d[i] >> l[i];
    }

    //2. A, Bを構築する
    map<int, vector<int>> mpA;
    map<int, vector<int>> mpB;
    for (int i = 0; i < N; i++){
        mpA[r[i]].push_back(c[i]);
        mpB[c[i]].push_back(r[i]);
    }
    for (auto itr = mpA.begin(); itr != mpA.end(); itr++){
        (itr->second).push_back(0);
        (itr->second).push_back(W + 1);
        sort((itr->second).begin(), (itr->second).end());
    }
    for (auto itr = mpB.begin(); itr != mpB.end(); itr++){
        (itr->second).push_back(0);
        (itr->second).push_back(H + 1);
        sort((itr->second).begin(), (itr->second).end());
    }

    //3. 実際にシミュレーションを行う
    
    int now_r = rs;
    int now_c = cs;
    for (int i = 0; i < Q; i++){
        //3-1. 上のとき
        if (d[i] == 'U'){
            auto itr = mpB.find(now_c);
            int border = 1;
            //その座標に壁があるとき
            if (itr != mpB.end()){
                auto itr2 = lower_bound((itr->second).begin(), (itr->second).end(), now_r);
                itr2--;
                border = (*itr2) + 1;
            }
            now_r = max(now_r - l[i], border);
        }
        //3-2. 下のとき
        else if (d[i] == 'D'){
            auto itr = mpB.find(now_c);
            int border = H;
            //その座標に壁があるとき
            if (itr != mpB.end()){
                auto itr2 = lower_bound((itr->second).begin(), (itr->second).end(), now_r);
                border = (*itr2) - 1;
            }
            now_r = min(now_r + l[i], border);
        }
        //3-3. 左のとき
        else if (d[i] == 'L'){
            auto itr = mpA.find(now_r);
            int border = 1;
            if (itr != mpA.end()){
                auto itr2 = lower_bound((itr->second).begin(), (itr->second).end(), now_c);
                itr2--;
                border = (*itr2) + 1;
            }
            now_c = max(now_c - l[i], border);
        }
        //3-4. 右のとき
        else if (d[i] == 'R'){
            auto itr = mpA.find(now_r);
            int border = W;
            if (itr != mpA.end()){
                auto itr2 = lower_bound((itr->second).begin(), (itr->second).end(), now_c);
                border = (*itr2) - 1;
            }
            now_c = min(now_c + l[i], border);
        }
        cout << now_r << " " << now_c << "\n";
    }
}

Submission Info

Judge Result