Submission #645083

#TimeUsernameProblemLanguageResultExecution timeMemory
645083mychecksedadNautilus (BOI19_nautilus)C++17
66 / 100
49 ms67016 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> using namespace std; typedef long long int ll; typedef long double ld; #define MOD (1000000000+7) #define MOD1 (998244353) #define PI 3.1415926535 #define pb push_back #define setp() cout << setprecision(15) #define all(x) x.begin(), x.end() #define debug(x) cerr << #x << " is " << x << '\n'; const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20; int n, m, k, arr[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; bool dp[105][105][105]; string s[N], t; void solve(){ cin >> n >> m >> k; for(int i = 0; i < n; ++i) cin >> s[i]; cin >> t; for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) for(int l = 0; l <= k; ++l) dp[i][j][l] = 0; for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) if(s[i][j] == '.') dp[i][j][0] = 1; int ans = 0; for(int l = 1; l <= k; ++l){ for(int i = 0; i < n; ++i){ for(int j = 0; j < m; ++j){ if(dp[i][j][l - 1]){ int x = i, y = j; if(t[l - 1] == '?'){ for(int h = 0; h < 4; ++h){ x += arr[h][0], y += arr[h][1]; if(x>=0&&x<n&&y>=0&&y<m&&s[x][y]=='.') dp[x][y][l] = 1; x -= arr[h][0], y -= arr[h][1]; } }else{ if(t[l - 1] == 'N') x--; else if(t[l - 1] == 'S') x++; else if(t[l - 1] == 'W') y--; else y++; if(x>=0&&x<n&&y>=0&&y<m&&s[x][y]=='.') dp[x][y][l] = 1; } } } } } for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) ans += dp[i][j][k]; cout << ans; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int T = 1, aa; // cin >> T;aa=T; while(T--){ // cout << "Case #" << aa-T << ": "; solve(); cout << '\n'; } return 0; }

Compilation message (stderr)

nautilus.cpp: In function 'int main()':
nautilus.cpp:59:16: warning: unused variable 'aa' [-Wunused-variable]
   59 |     int T = 1, aa;
      |                ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...