# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860186 | 2023-10-12T04:49:37 Z | maks007 | Nautilus (BOI19_nautilus) | C++14 | 1 ms | 604 KB |
#include "bits/stdc++.h" using namespace std; int dp[110][110][110]; 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+1]; for(int i = 1; i <= n; i ++) { cin >> a[i]; a[i] = ' ' + a[i]; } string str; cin >> str; str = ' ' + str; for(int i = 2; i < str.size(); i ++) { assert(str[i] != op[str[i-1]]); } for(int i = 1; i <= str.size() + 1; i ++) { for(int posi = 1; posi <= n; posi ++) { for(int posj = 1; posj <= m; posj ++) { if(a[posi][posj] == '#') { dp[i][posi][posj] = 0; continue; } if(i == 1) { 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 = 1; i <= n; i ++) { for(int j = 1; j <= m; j ++) ans += dp[str.size()+1][i][j]; } cout << ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |