Submission #60951018

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 <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
    int H, W, X, Y;
    cin >> H >> W >> X >> Y;
    vector<string> grid(H);
    for (int i = 0; i < H; ++i) {
        cin >> grid[i];
    }
    string T;
    cin >> T;
    int dx[] = {-1, 1, 0, 0};
    int dy[] = {0, 0, -1, 1};
    char directions[] = {'U', 'D', 'L', 'R'};
    int x = X - 1;
    int y = Y - 1;
    set<pair<int, int>> visited_houses;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main() {
    int H, W, X, Y;
    cin >> H >> W >> X >> Y;
    vector<string> grid(H);
    for (int i = 0; i < H; ++i) {
        cin >> grid[i];
    }
    string T;
    cin >> T;
    int dx[] = {-1, 1, 0, 0};
    int dy[] = {0, 0, -1, 1};
    char directions[] = {'U', 'D', 'L', 'R'};
    int x = X - 1;
    int y = Y - 1;
    set<pair<int, int>> visited_houses;
    for (char move : T) {
        int nx = x, ny = y;
        for (int i = 0; i < 4; ++i) {
            if (move == directions[i]) {
                nx = x + dx[i];
                ny = y + dy[i];
                break;
            }
        }
        if (grid[nx][ny] != '#') {
            x = nx;
            y = ny;
            if (grid[x][y] == '@') {
                visited_houses.insert({x, y});
            }
        }
    }
    cout << x + 1 << " " << y + 1 << " " << visited_houses.size() << endl;
    return 0;
}

Submission Info

Judge Result