oj.uz

Submission #207175

# Submission time Handle Problem Language Result Execution time Memory
207175 2020-03-06T15:44:53 Z brcode Nautilus (BOI19_nautilus) C++14
100 / 100
 198 ms 1016 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 510;
int n,m,k;
char grid[MAXN][MAXN];
bitset<MAXN> dp[MAXN],temp[MAXN],arr[MAXN];
int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char x;
            cin>>x;
            grid[i][j] = x;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(grid[i][j] =='.'){
                dp[i][j] = 1;
                arr[i][j] = 1;
            }
        }
    }
    for(int j=1;j<=k;j++){
        char x;
        cin>>x;
      
        if(x == 'N'||x=='?'){
            for(int i=1;i<n;i++){
                temp[i] = dp[i+1];
            }
        }
        if(x=='S'||x=='?'){
            for(int i=2;i<=n;i++){
                temp[i] |= dp[i-1];
            }
        }
        if(x=='E'||x=='?'){
            for(int i=1;i<=n;i++){
                temp[i]|=(dp[i]<<1);
            }
        }
        if(x=='W'||x=='?'){
            for(int i=1;i<=n;i++){
                temp[i]|=(dp[i]>>1);
            }
        }
        for(int i=1;i<=n;i++){
            dp[i] = temp[i]&(arr[i]);
            
            temp[i].reset();
        }
         
        
    }
    int ans = 0;
    for(int i=1;i<=n;i++){
        ans+=dp[i].count();
    }
    cout<<ans<<endl;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 380 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 380 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 380 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 6 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 380 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 380 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 6 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 128 ms 712 KB Output is correct
23 Correct 125 ms 636 KB Output is correct
24 Correct 128 ms 716 KB Output is correct
25 Correct 123 ms 760 KB Output is correct
26 Correct 120 ms 632 KB Output is correct
27 Correct 159 ms 712 KB Output is correct
28 Correct 160 ms 632 KB Output is correct
29 Correct 160 ms 1016 KB Output is correct
30 Correct 161 ms 888 KB Output is correct
31 Correct 157 ms 888 KB Output is correct
32 Correct 188 ms 888 KB Output is correct
33 Correct 187 ms 888 KB Output is correct
34 Correct 189 ms 888 KB Output is correct
35 Correct 198 ms 888 KB Output is correct
36 Correct 185 ms 888 KB Output is correct