oj.uz

답안 #136394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136394 2019-07-25T08:27:20 Z popovicirobert Nautilus (BOI19_nautilus) C++14
100 / 100
 72 ms 760 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44


/*const int MOD = (int) 1e9 + 7;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;

const int MAXN = 500;

bitset <500> dp[2][MAXN], mat[MAXN];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j, n, m, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m >> k;

    for(i = 0; i < n; i++) {
        string str;
        cin >> str;

        for(j = 0; j < m; j++) {
            mat[i][j] = (str[j] == '.');
        }
        dp[0][i] = mat[i];
    }

    for(int t = 1; t <= k; t++) {
        char ch;
        cin >> ch;

        for(i = 0; i < n; i++) {
            dp[t & 1][i].reset();
        }

        if(ch == 'N' || ch == '?') {
            for(i = 0; i < n - 1; i++) {
                dp[t & 1][i] |= dp[1 - t & 1][i + 1];
            }
        }

        if(ch == 'W' || ch == '?') {
            for(i = 0; i < n; i++) {
                dp[t & 1][i] |= (dp[1 - t & 1][i] >> 1);
            }
        }

        if(ch == 'S' || ch == '?') {
            for(i = 1; i < n; i++) {
                dp[t & 1][i] |= dp[1 - t & 1][i - 1];
            }
        }

        if(ch == 'E' || ch == '?') {
            for(i = 0; i < n; i++) {
                dp[t & 1][i] |= (dp[1 - t & 1][i] << 1);
            }
        }

        for(i = 0; i < n; i++) {
            dp[t & 1][i] &= mat[i];
        }
    }

    int ans = 0;
    for(i = 0; i < n; i++) {
        for(j = 0; j < m; j++) {
            ans += dp[k & 1][i][j];
        }
    }

    cout << ans;

    return 0;
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:94:38: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[t & 1][i] |= dp[1 - t & 1][i + 1];
                                    ~~^~~
nautilus.cpp:100:39: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[t & 1][i] |= (dp[1 - t & 1][i] >> 1);
                                     ~~^~~
nautilus.cpp:106:38: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[t & 1][i] |= dp[1 - t & 1][i - 1];
                                    ~~^~~
nautilus.cpp:112:39: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[t & 1][i] |= (dp[1 - t & 1][i] << 1);
                                     ~~^~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 420 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 420 KB Output is correct
22 Correct 45 ms 596 KB Output is correct
23 Correct 46 ms 720 KB Output is correct
24 Correct 46 ms 632 KB Output is correct
25 Correct 45 ms 632 KB Output is correct
26 Correct 44 ms 632 KB Output is correct
27 Correct 59 ms 632 KB Output is correct
28 Correct 60 ms 760 KB Output is correct
29 Correct 60 ms 632 KB Output is correct
30 Correct 61 ms 760 KB Output is correct
31 Correct 59 ms 760 KB Output is correct
32 Correct 71 ms 760 KB Output is correct
33 Correct 71 ms 760 KB Output is correct
34 Correct 72 ms 632 KB Output is correct
35 Correct 71 ms 724 KB Output is correct
36 Correct 72 ms 632 KB Output is correct