# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328618 | egas | Nautilus (BOI19_nautilus) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long r;
cin >> r;
long long c;
cin >> c;
long long m;
cin >> m;
vector<string> grid;
for(long long i = 0 ; i < r ; i++) {
string temp;
cin >> temp;
grid.push_back(temp);
}
string path;
cin >> path;
long long X_dev=0;
long long Y_dev=0;
for(long long i = 0 ; i < path.length() ; i++) {
if(path[i]=='N') {
Y_dev--;
} else if(path[i]=='S') {
Y_dev++;
} else if(path[i]=='W') {
X_dev--;
} else if(path[i]=='E') {
X_dev++;
}
}
long long res=0;
for(long long i = 0 ; i < r ; i++) {
for(long long j = 0 ; j < c ; j++) {
long long curX=i;
long long curY=j;
curX+=X_dev;
curY+=Y_dev;
if(curX>=0 and curX<r and curY>=0 and curY<c and grid[curX][curY]=='.') {
res++;
}
}
}
cout << res << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |