Submission #281978

#TimeUsernameProblemLanguageResultExecution timeMemory
281978biggNautilus (BOI19_nautilus)C++14
66 / 100
1093 ms5376 KiB
#include<bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast") const int MAXN = 510; int dp[MAXN][MAXN][4], orig[MAXN][MAXN]; int r, c, m; string s; int main(){ std::ios::sync_with_stdio(0); std::cin.tie(0); cin >> r >> c >> m; for(int i = 1; i <= r; i ++){ for(int j = 1; j <= c; j++){ char c; cin >> c; if(c == '.') dp[i][j][1] = 1, orig[i][j] = 1; } } cin >> s; for(int k = 0; k < m; k++ ){ int p = k%2; //printf("%d\n",p ); for(int i = 1; i <= r; i++){ for(int j = 1; j <= c; j++){ dp[i][j][p] = 0; if(s[k] == '?')dp[i][j][p] = (dp[i-1][j][1-p] | dp[i+1][j][1-p] | dp[i][j-1][1-p] | dp[i][j+1][1-p]); if(s[k] == 'N') dp[i][j][p] = dp[i+1][j][1-p]; if(s[k] == 'S') dp[i][j][p] = dp[i-1][j][1-p]; if(s[k] == 'E') dp[i][j][p] = dp[i][j-1][1-p]; if(s[k] == 'W') dp[i][j][p] = dp[i][j+1][1-p]; dp[i][j][p] &= orig[i][j]; //printf("%d ", dp[i][j][p]); } //printf("\n"); } } int ans = 0; for(int i = 1; i <= r; i++){ for(int j = 1; j <= c; j++){ //printf("%d",dp[i][j][1-m%2] ); ans += dp[i][j][1-m%2]; } //printf("\n"); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...