oj.uz

Submission #593745

# Submission time Handle Problem Language Result Execution time Memory
593745 2022-07-11T14:26:20 Z nguyentu Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 1868 KB 
#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

#define ii pair<int , int>  
#define iv pair<ii , ii>
#define iii pair<int , ii>
#define fi first
#define se second
//#define int long long
const int inf = 1e9 + 7;
const int MAX_N = 5e2 + 7;
const int MOD = 1e9 + 7;

char a[MAX_N][MAX_N];
int f[MAX_N][MAX_N][107];
char s[5007];
bitset<5007> dp[2][MAX_N];
bitset<5007> d[MAX_N];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    int n , m , l; cin >> n >> m >> l;
    //subtask 3
        for (int i = 0 ; i < n ; i++) {
            for (int j = 0 ; j < m ; j++) {
                cin >> a[i][j];
                if (a[i][j] == '#') {
                    d[i][j] = 0;
                    dp[1][i][j] = 0;
                }
				else {
					d[i][j] = 1;
					dp[1][i][j] = 1;
				}
            }
        }
        for (int i = 0 ; i < l ; i++) {
            cin >> s[i];
        }
        for (int i = 0 ; i < l ; i++) {
            int now = i & 1;
            int prev = now ^ 1;
            for (int j = 0 ; j < n ; j++) {
                if (s[i] == 'W') {
                    dp[now][j] = dp[prev][j] >> 1;
                }
                else if (s[i] == 'E') {
                    dp[now][j] = dp[prev][j] << 1;
                }
                else if (s[i] == 'S') {
                    dp[now][j] = dp[prev][j - 1];
                }
                else if (s[i] == 'N') {
                    dp[now][j] = dp[prev][j + 1];
                }
                else if (s[i] == '?') {
                    dp[now][j] = (dp[prev][j] >> 1);
                    dp[now][j] |= (dp[prev][j] << 1);
					if ((j - 1) >= 0)
                    dp[now][j] |= dp[prev][j - 1];
					if ((j + 1) < n)
                    dp[now][j] |= dp[prev][j + 1];
                }
            }
            for (int j = 0 ; j < n ; j++) {
                dp[now][j] = dp[now][j] & d[j];
                dp[prev][j] = dp[now][j];
            }
			// for (int j = 0 ; j < n ; j++) {
			// 	dp[now][j].reset
			// }
        }
        int ans = 0;
        for (int i = 0 ; i < n ; i++) {
            for (int j = 0 ; j < m ; j++) {
                if (dp[(l - 1) & 1][i][j]) {
                    ans++;
                }
				//cout << dp[(l - 1) & 1][i][j] << " ";
            }
			//cout << '\n';
        }
        cout << ans;
    //}
    return 0;
}

// 1 1 0 0 0 0 1 1 0 
// 1 1 0 0 0 0 1 1 0 
// 1 1 0 1 1 1 1 0 0 
// 1 0 0 1 1 1 0 1 0 
// 1 0 1 1 0 1 1 1 1

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 939 ms 1504 KB Output is correct
23 Correct 876 ms 1764 KB Output is correct
24 Correct 841 ms 1756 KB Output is correct
25 Correct 859 ms 1868 KB Output is correct
26 Correct 865 ms 1752 KB Output is correct
27 Execution timed out 1076 ms 1748 KB Time limit exceeded
28 Halted 0 ms 0 KB -