# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328627 | egas | Nautilus (BOI19_nautilus) | C++14 | 5 ms | 876 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;
set<pair<long long,long long> > res;
for(long long i = 0 ; i < r ; i++) {
for(long long j = 0 ; j < c ; j++) {
long long curR=i;
long long curC=j;
long long pt=0;
while(pt<path.length() and curR>=0 and curR<r and curC>=0 and curC<c and grid[curR][curC]=='.') {
if(path[pt]=='N') {
curR--;
} else if(path[pt]=='S') {
curR++;
} else if(path[pt]=='W') {
curC--;
} else if(path[pt]=='E') {
curC++;
}
pt++;
}
if(pt==path.length()) {
res.insert({curR,curC});
}
}
}
cout << res.size() << '\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... |