oj.uz

Submission #443579

# Submission time Handle Problem Language Result Execution time Memory
443579 2021-07-10T21:57:07 Z JovanB Nautilus (BOI19_nautilus) C++17
100 / 100
 51 ms 420 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

bitset <500> dpp[505];
bitset <500> dp[505];
bitset <500> rows[505];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, m, k;
    cin >> n >> m >> k;
    for(int i=1; i<=n; i++){
        string s;
        cin >> s;
        for(int j=0; j<m; j++){
            if(s[j] == '.') dp[i][j] = rows[i][j] = 1;
        }
    }
    while(k--){
        for(int i=1; i<=n; i++) dpp[i] = dp[i];
        char c;
        cin >> c;
        if(c == 'W'){
            for(int i=1; i<=n; i++) dp[i] = (dpp[i] >> 1);
        }
        else if(c == 'E'){
            for(int i=1; i<=n; i++) dp[i] = (dpp[i] << 1);
        }
        else if(c == 'N'){
            for(int i=1; i<=n; i++) dp[i] = dpp[i+1];
        }
        else if(c == 'S'){
            for(int i=1; i<=n; i++) dp[i] = dpp[i-1];
        }
        else{
            for(int i=1; i<=n; i++){
                dp[i] = (dpp[i] << 1);
                dp[i] |= (dpp[i] >> 1);
                dp[i] |= dpp[i+1];
                dp[i] |= dpp[i-1];
            }
        }
        for(int i=1; i<=n; i++) dp[i] &= rows[i];
    }
    int res = 0;
    for(int i=1; i<=n; i++){
        res += dp[i].count();
    }
    cout << res << "\n";
    return 0;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 35 ms 332 KB Output is correct
23 Correct 37 ms 332 KB Output is correct
24 Correct 35 ms 420 KB Output is correct
25 Correct 34 ms 332 KB Output is correct
26 Correct 36 ms 400 KB Output is correct
27 Correct 44 ms 400 KB Output is correct
28 Correct 43 ms 332 KB Output is correct
29 Correct 45 ms 408 KB Output is correct
30 Correct 43 ms 332 KB Output is correct
31 Correct 42 ms 384 KB Output is correct
32 Correct 49 ms 332 KB Output is correct
33 Correct 49 ms 332 KB Output is correct
34 Correct 51 ms 404 KB Output is correct
35 Correct 49 ms 332 KB Output is correct
36 Correct 49 ms 332 KB Output is correct