oj.uz

Submission #645094

# Submission time Handle Problem Language Result Execution time Memory
645094 2022-09-26T09:01:26 Z mychecksedad Nautilus (BOI19_nautilus) C++17
100 / 100
 245 ms 188972 KB 
/* 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;
bitset<505> dp[505][5005], is[505];
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 <= k; ++j) dp[i][j] = 0;
    for(int i = 0; i < n; ++i) is[i] = 0;
    for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) if(s[i][j] == '.') dp[i][0][j] = is[i][j] = 1;
    int ans = 0;
    for(int l = 1; l <= k; ++l){
        if(t[l - 1] == 'N'){
            
            for(int i = 0; i < n - 1; ++i)
                dp[i][l] = dp[i + 1][l - 1];

        }else if(t[l - 1] == 'S'){
            
            for(int i = 1; i < n; ++i)
                dp[i][l] = dp[i - 1][l - 1];
        
        }else if(t[l - 1] == 'W'){
        
            for(int i = 0; i < n; ++i)
                dp[i][l] = dp[i][l - 1] >> 1;
        
        }else if(t[l - 1] == 'E'){
        
            for(int i = 0; i < n; ++i)
                dp[i][l] = dp[i][l - 1] << 1;
        
        }else{      
            for(int i = 0; i < n; ++i){
                dp[i][l] = (dp[i][l - 1] >> 1) | (dp[i][l - 1] << 1);
                if(i - 1 >= 0) dp[i][l] |= dp[i - 1][l - 1];
                if(i + 1 < n) dp[i][l] |= dp[i + 1][l - 1];
            }
        }
        for(int i = 0; i < n; ++i) dp[i][l] &= is[i];
    }
    for(int i = 0; i < n; ++i) ans += dp[i][k].count();
    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

nautilus.cpp: In function 'int main()':
nautilus.cpp:68:16: warning: unused variable 'aa' [-Wunused-variable]
   68 |     int T = 1, aa;
      |                ^~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 32724 KB Output is correct
2 Correct 17 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32656 KB Output is correct
5 Correct 19 ms 32636 KB Output is correct
6 Correct 17 ms 32724 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 32724 KB Output is correct
2 Correct 17 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32656 KB Output is correct
5 Correct 19 ms 32636 KB Output is correct
6 Correct 17 ms 32724 KB Output is correct
7 Correct 17 ms 32724 KB Output is correct
8 Correct 16 ms 32760 KB Output is correct
9 Correct 18 ms 32736 KB Output is correct
10 Correct 17 ms 32660 KB Output is correct
11 Correct 19 ms 32724 KB Output is correct
12 Correct 17 ms 32720 KB Output is correct
13 Correct 17 ms 32724 KB Output is correct
14 Correct 17 ms 32636 KB Output is correct
15 Correct 17 ms 32724 KB Output is correct
16 Correct 17 ms 32724 KB Output is correct
17 Correct 18 ms 32676 KB Output is correct
18 Correct 17 ms 32724 KB Output is correct
19 Correct 17 ms 32664 KB Output is correct
20 Correct 17 ms 32760 KB Output is correct
21 Correct 20 ms 32724 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 32724 KB Output is correct
2 Correct 17 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32656 KB Output is correct
5 Correct 19 ms 32636 KB Output is correct
6 Correct 17 ms 32724 KB Output is correct
7 Correct 17 ms 32724 KB Output is correct
8 Correct 16 ms 32760 KB Output is correct
9 Correct 18 ms 32736 KB Output is correct
10 Correct 17 ms 32660 KB Output is correct
11 Correct 19 ms 32724 KB Output is correct
12 Correct 17 ms 32720 KB Output is correct
13 Correct 17 ms 32724 KB Output is correct
14 Correct 17 ms 32636 KB Output is correct
15 Correct 17 ms 32724 KB Output is correct
16 Correct 17 ms 32724 KB Output is correct
17 Correct 18 ms 32676 KB Output is correct
18 Correct 17 ms 32724 KB Output is correct
19 Correct 17 ms 32664 KB Output is correct
20 Correct 17 ms 32760 KB Output is correct
21 Correct 20 ms 32724 KB Output is correct
22 Correct 183 ms 188568 KB Output is correct
23 Correct 180 ms 188848 KB Output is correct
24 Correct 179 ms 188928 KB Output is correct
25 Correct 178 ms 188876 KB Output is correct
26 Correct 178 ms 188896 KB Output is correct
27 Correct 216 ms 188956 KB Output is correct
28 Correct 211 ms 188968 KB Output is correct
29 Correct 215 ms 188892 KB Output is correct
30 Correct 217 ms 188932 KB Output is correct
31 Correct 210 ms 188876 KB Output is correct
32 Correct 236 ms 188832 KB Output is correct
33 Correct 245 ms 188972 KB Output is correct
34 Correct 239 ms 188936 KB Output is correct
35 Correct 239 ms 188876 KB Output is correct
36 Correct 240 ms 188972 KB Output is correct