# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860183 | maks007 | Nautilus (BOI19_nautilus) | C++14 | 16 ms | 8280 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;
int dp[100][100][100];
signed main () {
map <char,char> op;
map <char,int> it, jt;
op['E'] = 'W';
op['W'] = 'E';
op['S'] = 'N';
op['N'] = 'S';
it['E'] = 0;
it['W'] = 0;
it['S'] = 1;
it['N'] = -1;
jt['E'] = 1;
jt['W'] = -1;
jt['S'] = 0;
jt['N'] = 0;
int n, m, c;
cin >> n >> m >> c;
string a[n];
for(int i = 0; i < n; i ++) {
cin >> a[i];
}
string str;
cin >> str;
for(int i = 0; i <= str.size(); i ++) {
for(int posi = 0; posi < n; posi ++) {
for(int posj = 0; posj < m; posj ++) {
if(a[posi][posj] == '#') {
dp[i][posi][posj] = 0;
continue;
}
if(i == 0) {
dp[i][posi][posj]=1;
}else {
if(str[i-1] == '?') {
char ch = 'E';
dp[i][posi][posj] += dp[i-1][posi+it[ch]][posj+jt[ch]];
ch = 'W';
dp[i][posi][posj] += dp[i-1][posi+it[ch]][posj+jt[ch]];
ch = 'N';
dp[i][posi][posj] += dp[i-1][posi+it[ch]][posj+jt[ch]];
ch = 'S';
dp[i][posi][posj] += dp[i-1][posi+it[ch]][posj+jt[ch]];
}else {
char ch = op[str[i-1]];
dp[i][posi][posj] = dp[i-1][posi+it[ch]][posj+jt[ch]];
}
}
}
}
}
int ans = 0;
for(int i = 0; i < n; i ++) {
for(int j = 0; j < m; j ++) ans += dp[str.size()][i][j];
}
cout << ans;
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... |