Submission #60956315

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <tuple>
using namespace std;
using ll = long long;
int main() {
    // 入力
    ll N, M, Sx, Sy;
    cin >> N >> M >> Sx >> Sy;
    map<ll, set<ll>> x_to_y, y_to_x;
    for (ll i = 0; i < N; ++i) {
        ll x, y;
        cin >> x >> y;
        x_to_y[x].insert(y);
        y_to_x[y].insert(x);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <tuple>

using namespace std;
using ll = long long;

int main() {
    // 入力
    ll N, M, Sx, Sy;
    cin >> N >> M >> Sx >> Sy;

    map<ll, set<ll>> x_to_y, y_to_x;
    for (ll i = 0; i < N; ++i) {
        ll x, y;
        cin >> x >> y;
        x_to_y[x].insert(y);
        y_to_x[y].insert(x);
    }

    vector<pair<char, ll>> moves(M);
    for (ll i = 0; i < M; ++i) {
        char d;
        ll c;
        cin >> d >> c;
        moves[i] = {d, c};
    }

    ll x = Sx, y = Sy;
    set<pair<ll, ll>> visited;

    for (const auto &[dir, dist] : moves) {
        if (dir == 'U' || dir == 'D') {
            ll sign = (dir == 'U') ? 1 : -1;
            ll ny = y + sign * dist;

            auto &x_coords = x_to_y[x];
            auto it_low = x_coords.lower_bound(min(y, ny));
            auto it_high = x_coords.upper_bound(max(y, ny));
            for (auto it = it_low; it != it_high; ++it) {
                visited.insert({x, *it});
            }

            y = ny;

        } else if (dir == 'L' || dir == 'R') {
            ll sign = (dir == 'R') ? 1 : -1;
            ll nx = x + sign * dist;

            auto &y_coords = y_to_x[y];
            auto it_low = y_coords.lower_bound(min(x, nx));
            auto it_high = y_coords.upper_bound(max(x, nx));
            for (auto it = it_low; it != it_high; ++it) {
                visited.insert({*it, y});
            }

            x = nx;
        }
    }

    // 出力
    cout << x << " " << y << " " << visited.size() << endl;

    return 0;
}

Submission Info

Judge Result