oj.uz

Submission #645093

# Submission time Handle Problem Language Result Execution time Memory
645093 2022-09-26T09:00:44 Z mychecksedad Nautilus (BOI19_nautilus) C++17
29 / 100
 18 ms 32724 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 16 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32724 KB Output is correct
5 Correct 18 ms 32724 KB Output is correct
6 Correct 16 ms 32724 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 32724 KB Output is correct
2 Correct 16 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32724 KB Output is correct
5 Correct 18 ms 32724 KB Output is correct
6 Correct 16 ms 32724 KB Output is correct
7 Correct 15 ms 32724 KB Output is correct
8 Incorrect 16 ms 32724 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 32724 KB Output is correct
2 Correct 16 ms 32724 KB Output is correct
3 Correct 16 ms 32724 KB Output is correct
4 Correct 16 ms 32724 KB Output is correct
5 Correct 18 ms 32724 KB Output is correct
6 Correct 16 ms 32724 KB Output is correct
7 Correct 15 ms 32724 KB Output is correct
8 Incorrect 16 ms 32724 KB Output isn't correct
9 Halted 0 ms 0 KB -