oj.uz

Submission #1102096

# Submission time Handle Problem Language Result Execution time Memory
1102096 2024-10-17T12:15:09 Z _8_8_ Dango Maker (JOI18_dango_maker) C++17
33 / 100
 350 ms 262144 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
    
const int  N = 3e3 + 12, MOD = 998244353, M = 3e6 + 12;
    
char a[N][N];
int n, m, res = 0, res1 = 0, v[N][N], it = 1, h[N][N], dp[M][2];
vector<int> g[M];   
void add(int x, int y) {
    g[x].push_back(y);
    g[y].push_back(x);
}
bool vis[N * N];
void dfs(int v, int pr = -1) {
    vis[v] = 1;
    dp[v][1] = 1;
    for(int to:g[v]) {
        if(to == pr || vis[to]) continue;
        dfs(to, v);
        dp[v][0] += max(dp[to][0], dp[to][1]);
        dp[v][1] += dp[to][0];
    }
}
void test() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(a[i][j] == 'G' && a[i][j - 1] == 'R' && a[i][j + 1] == 'W') {
                h[i][j - 1] = it++;
            }
            if(a[i][j] == 'G' && a[i - 1][j] == 'R' && a[i + 1][j] == 'W') {
                v[i - 1][j] = it++;
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(a[i][j] == 'G' && a[i][j - 1] == 'R' && a[i][j + 1] == 'W') {
                if(v[i][j - 1]) {
                    add(v[i][j - 1], h[i][j - 1]);
                }
                if(v[i - 1][j]) {
                    add(v[i - 1][j], h[i][j - 1]);
                }
                if(v[i - 2][j + 1]) {
                    add(v[i - 2][j + 1], h[i][j - 1]);
                }
            }
            if(a[i][j] == 'G' && a[i - 1][j] == 'R' && a[i + 1][j] == 'W') {
                if(h[i - 1][j]) {
                    add(v[i - 1][j], h[i - 1][j]);
                }
                if(h[i][j - 1]) {
                    add(v[i - 1][j], h[i][j - 1]);
                }
                if(h[i + 1][j - 2]) {
                    add(v[i - 1][j], h[i + 1][j - 2]);
                }
            }
        }
    }
    for(int i = 1; i < it; i++) {
        sort(g[i].begin(), g[i].end());
        g[i].resize(unique(g[i].begin(), g[i].end()) - g[i].begin());
    }
    for(int i = 1; i < it; i++) {
        if(!vis[i]) {
            dfs(i);
            res += max(dp[i][0], dp[i][1]);
        }
    }
    cout << res << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74320 KB Output is correct
2 Correct 12 ms 74212 KB Output is correct
3 Correct 12 ms 74320 KB Output is correct
4 Correct 12 ms 74320 KB Output is correct
5 Correct 12 ms 74320 KB Output is correct
6 Correct 13 ms 78416 KB Output is correct
7 Correct 13 ms 78644 KB Output is correct
8 Correct 13 ms 78348 KB Output is correct
9 Correct 17 ms 78380 KB Output is correct
10 Correct 14 ms 76368 KB Output is correct
11 Correct 12 ms 78288 KB Output is correct
12 Correct 14 ms 78416 KB Output is correct
13 Correct 14 ms 78416 KB Output is correct
14 Correct 13 ms 76368 KB Output is correct
15 Correct 13 ms 76368 KB Output is correct
16 Correct 14 ms 76368 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74320 KB Output is correct
2 Correct 12 ms 74212 KB Output is correct
3 Correct 12 ms 74320 KB Output is correct
4 Correct 12 ms 74320 KB Output is correct
5 Correct 12 ms 74320 KB Output is correct
6 Correct 13 ms 78416 KB Output is correct
7 Correct 13 ms 78644 KB Output is correct
8 Correct 13 ms 78348 KB Output is correct
9 Correct 17 ms 78380 KB Output is correct
10 Correct 14 ms 76368 KB Output is correct
11 Correct 12 ms 78288 KB Output is correct
12 Correct 14 ms 78416 KB Output is correct
13 Correct 14 ms 78416 KB Output is correct
14 Correct 13 ms 76368 KB Output is correct
15 Correct 13 ms 76368 KB Output is correct
16 Correct 14 ms 76368 KB Output is correct
17 Correct 14 ms 78416 KB Output is correct
18 Correct 14 ms 78416 KB Output is correct
19 Correct 13 ms 78416 KB Output is correct
20 Correct 13 ms 78416 KB Output is correct
21 Correct 13 ms 78416 KB Output is correct
22 Correct 14 ms 78416 KB Output is correct
23 Correct 13 ms 78300 KB Output is correct
24 Correct 12 ms 76352 KB Output is correct
25 Correct 13 ms 74264 KB Output is correct
26 Correct 13 ms 74320 KB Output is correct
27 Correct 13 ms 78296 KB Output is correct
28 Correct 12 ms 78416 KB Output is correct
29 Correct 14 ms 78416 KB Output is correct
30 Correct 13 ms 76368 KB Output is correct
31 Correct 14 ms 76336 KB Output is correct
32 Correct 16 ms 76368 KB Output is correct
33 Correct 13 ms 78416 KB Output is correct
34 Correct 14 ms 78416 KB Output is correct
35 Correct 13 ms 78444 KB Output is correct
36 Correct 13 ms 78428 KB Output is correct
37 Correct 13 ms 78584 KB Output is correct
38 Correct 14 ms 78416 KB Output is correct
39 Correct 13 ms 78416 KB Output is correct
40 Correct 13 ms 78284 KB Output is correct
41 Correct 13 ms 78424 KB Output is correct
42 Correct 14 ms 78416 KB Output is correct
43 Correct 14 ms 78416 KB Output is correct
44 Correct 13 ms 78416 KB Output is correct
45 Correct 13 ms 78416 KB Output is correct
46 Correct 13 ms 78280 KB Output is correct
47 Correct 13 ms 78416 KB Output is correct
48 Correct 13 ms 78312 KB Output is correct
49 Correct 14 ms 78416 KB Output is correct
50 Correct 14 ms 78380 KB Output is correct
51 Correct 14 ms 78416 KB Output is correct
52 Correct 13 ms 78416 KB Output is correct
53 Correct 14 ms 78416 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74320 KB Output is correct
2 Correct 12 ms 74212 KB Output is correct
3 Correct 12 ms 74320 KB Output is correct
4 Correct 12 ms 74320 KB Output is correct
5 Correct 12 ms 74320 KB Output is correct
6 Correct 13 ms 78416 KB Output is correct
7 Correct 13 ms 78644 KB Output is correct
8 Correct 13 ms 78348 KB Output is correct
9 Correct 17 ms 78380 KB Output is correct
10 Correct 14 ms 76368 KB Output is correct
11 Correct 12 ms 78288 KB Output is correct
12 Correct 14 ms 78416 KB Output is correct
13 Correct 14 ms 78416 KB Output is correct
14 Correct 13 ms 76368 KB Output is correct
15 Correct 13 ms 76368 KB Output is correct
16 Correct 14 ms 76368 KB Output is correct
17 Correct 14 ms 78416 KB Output is correct
18 Correct 14 ms 78416 KB Output is correct
19 Correct 13 ms 78416 KB Output is correct
20 Correct 13 ms 78416 KB Output is correct
21 Correct 13 ms 78416 KB Output is correct
22 Correct 14 ms 78416 KB Output is correct
23 Correct 13 ms 78300 KB Output is correct
24 Correct 12 ms 76352 KB Output is correct
25 Correct 13 ms 74264 KB Output is correct
26 Correct 13 ms 74320 KB Output is correct
27 Correct 13 ms 78296 KB Output is correct
28 Correct 12 ms 78416 KB Output is correct
29 Correct 14 ms 78416 KB Output is correct
30 Correct 13 ms 76368 KB Output is correct
31 Correct 14 ms 76336 KB Output is correct
32 Correct 16 ms 76368 KB Output is correct
33 Correct 13 ms 78416 KB Output is correct
34 Correct 14 ms 78416 KB Output is correct
35 Correct 13 ms 78444 KB Output is correct
36 Correct 13 ms 78428 KB Output is correct
37 Correct 13 ms 78584 KB Output is correct
38 Correct 14 ms 78416 KB Output is correct
39 Correct 13 ms 78416 KB Output is correct
40 Correct 13 ms 78284 KB Output is correct
41 Correct 13 ms 78424 KB Output is correct
42 Correct 14 ms 78416 KB Output is correct
43 Correct 14 ms 78416 KB Output is correct
44 Correct 13 ms 78416 KB Output is correct
45 Correct 13 ms 78416 KB Output is correct
46 Correct 13 ms 78280 KB Output is correct
47 Correct 13 ms 78416 KB Output is correct
48 Correct 13 ms 78312 KB Output is correct
49 Correct 14 ms 78416 KB Output is correct
50 Correct 14 ms 78380 KB Output is correct
51 Correct 14 ms 78416 KB Output is correct
52 Correct 13 ms 78416 KB Output is correct
53 Correct 14 ms 78416 KB Output is correct
54 Correct 13 ms 76368 KB Output is correct
55 Correct 18 ms 117328 KB Output is correct
56 Correct 14 ms 78416 KB Output is correct
57 Correct 18 ms 129764 KB Output is correct
58 Correct 43 ms 106828 KB Output is correct
59 Correct 243 ms 173900 KB Output is correct
60 Correct 240 ms 174036 KB Output is correct
61 Correct 234 ms 173900 KB Output is correct
62 Correct 12 ms 76260 KB Output is correct
63 Correct 213 ms 173524 KB Output is correct
64 Runtime error 350 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -