oj.uz

Submission #1102090

# Submission time Handle Problem Language Result Execution time Memory
1102090 2024-10-17T12:12:27 Z _8_8_ Dango Maker (JOI18_dango_maker) C++17
33 / 100
 44 ms 262144 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
    
const int  N = 3e3 + 12, MOD = 998244353;
    
char a[N][N];
int n, m, res = 0, res1 = 0, v[N][N], it = 1, h[N][N], dp[N][N];
vector<int> g[N * N];
void add(int x, int y) {
    g[x].push_back(y);
    g[y].push_back(x);
}
bool vis[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 34 ms 215888 KB Output is correct
2 Correct 33 ms 215888 KB Output is correct
3 Correct 33 ms 215888 KB Output is correct
4 Correct 36 ms 215888 KB Output is correct
5 Correct 35 ms 215900 KB Output is correct
6 Correct 38 ms 219984 KB Output is correct
7 Correct 37 ms 219976 KB Output is correct
8 Correct 38 ms 219984 KB Output is correct
9 Correct 35 ms 220060 KB Output is correct
10 Correct 37 ms 217936 KB Output is correct
11 Correct 39 ms 219984 KB Output is correct
12 Correct 39 ms 219984 KB Output is correct
13 Correct 35 ms 220136 KB Output is correct
14 Correct 35 ms 218104 KB Output is correct
15 Correct 37 ms 217928 KB Output is correct
16 Correct 38 ms 217936 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 215888 KB Output is correct
2 Correct 33 ms 215888 KB Output is correct
3 Correct 33 ms 215888 KB Output is correct
4 Correct 36 ms 215888 KB Output is correct
5 Correct 35 ms 215900 KB Output is correct
6 Correct 38 ms 219984 KB Output is correct
7 Correct 37 ms 219976 KB Output is correct
8 Correct 38 ms 219984 KB Output is correct
9 Correct 35 ms 220060 KB Output is correct
10 Correct 37 ms 217936 KB Output is correct
11 Correct 39 ms 219984 KB Output is correct
12 Correct 39 ms 219984 KB Output is correct
13 Correct 35 ms 220136 KB Output is correct
14 Correct 35 ms 218104 KB Output is correct
15 Correct 37 ms 217928 KB Output is correct
16 Correct 38 ms 217936 KB Output is correct
17 Correct 38 ms 219976 KB Output is correct
18 Correct 39 ms 220128 KB Output is correct
19 Correct 37 ms 219976 KB Output is correct
20 Correct 35 ms 219984 KB Output is correct
21 Correct 38 ms 219984 KB Output is correct
22 Correct 33 ms 220072 KB Output is correct
23 Correct 38 ms 219976 KB Output is correct
24 Correct 35 ms 217936 KB Output is correct
25 Correct 39 ms 215880 KB Output is correct
26 Correct 38 ms 215880 KB Output is correct
27 Correct 36 ms 222032 KB Output is correct
28 Correct 34 ms 222244 KB Output is correct
29 Correct 38 ms 220040 KB Output is correct
30 Correct 38 ms 218012 KB Output is correct
31 Correct 39 ms 218092 KB Output is correct
32 Correct 37 ms 217936 KB Output is correct
33 Correct 37 ms 222032 KB Output is correct
34 Correct 38 ms 222108 KB Output is correct
35 Correct 36 ms 222032 KB Output is correct
36 Correct 40 ms 222024 KB Output is correct
37 Correct 39 ms 222200 KB Output is correct
38 Correct 39 ms 222024 KB Output is correct
39 Correct 38 ms 219984 KB Output is correct
40 Correct 34 ms 222032 KB Output is correct
41 Correct 37 ms 219976 KB Output is correct
42 Correct 35 ms 219976 KB Output is correct
43 Correct 39 ms 219984 KB Output is correct
44 Correct 39 ms 219984 KB Output is correct
45 Correct 37 ms 220024 KB Output is correct
46 Correct 36 ms 219984 KB Output is correct
47 Correct 39 ms 219984 KB Output is correct
48 Correct 37 ms 219984 KB Output is correct
49 Correct 37 ms 219984 KB Output is correct
50 Correct 36 ms 219984 KB Output is correct
51 Correct 38 ms 219984 KB Output is correct
52 Correct 38 ms 219984 KB Output is correct
53 Correct 37 ms 219984 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 215888 KB Output is correct
2 Correct 33 ms 215888 KB Output is correct
3 Correct 33 ms 215888 KB Output is correct
4 Correct 36 ms 215888 KB Output is correct
5 Correct 35 ms 215900 KB Output is correct
6 Correct 38 ms 219984 KB Output is correct
7 Correct 37 ms 219976 KB Output is correct
8 Correct 38 ms 219984 KB Output is correct
9 Correct 35 ms 220060 KB Output is correct
10 Correct 37 ms 217936 KB Output is correct
11 Correct 39 ms 219984 KB Output is correct
12 Correct 39 ms 219984 KB Output is correct
13 Correct 35 ms 220136 KB Output is correct
14 Correct 35 ms 218104 KB Output is correct
15 Correct 37 ms 217928 KB Output is correct
16 Correct 38 ms 217936 KB Output is correct
17 Correct 38 ms 219976 KB Output is correct
18 Correct 39 ms 220128 KB Output is correct
19 Correct 37 ms 219976 KB Output is correct
20 Correct 35 ms 219984 KB Output is correct
21 Correct 38 ms 219984 KB Output is correct
22 Correct 33 ms 220072 KB Output is correct
23 Correct 38 ms 219976 KB Output is correct
24 Correct 35 ms 217936 KB Output is correct
25 Correct 39 ms 215880 KB Output is correct
26 Correct 38 ms 215880 KB Output is correct
27 Correct 36 ms 222032 KB Output is correct
28 Correct 34 ms 222244 KB Output is correct
29 Correct 38 ms 220040 KB Output is correct
30 Correct 38 ms 218012 KB Output is correct
31 Correct 39 ms 218092 KB Output is correct
32 Correct 37 ms 217936 KB Output is correct
33 Correct 37 ms 222032 KB Output is correct
34 Correct 38 ms 222108 KB Output is correct
35 Correct 36 ms 222032 KB Output is correct
36 Correct 40 ms 222024 KB Output is correct
37 Correct 39 ms 222200 KB Output is correct
38 Correct 39 ms 222024 KB Output is correct
39 Correct 38 ms 219984 KB Output is correct
40 Correct 34 ms 222032 KB Output is correct
41 Correct 37 ms 219976 KB Output is correct
42 Correct 35 ms 219976 KB Output is correct
43 Correct 39 ms 219984 KB Output is correct
44 Correct 39 ms 219984 KB Output is correct
45 Correct 37 ms 220024 KB Output is correct
46 Correct 36 ms 219984 KB Output is correct
47 Correct 39 ms 219984 KB Output is correct
48 Correct 37 ms 219984 KB Output is correct
49 Correct 37 ms 219984 KB Output is correct
50 Correct 36 ms 219984 KB Output is correct
51 Correct 38 ms 219984 KB Output is correct
52 Correct 38 ms 219984 KB Output is correct
53 Correct 37 ms 219984 KB Output is correct
54 Correct 36 ms 219984 KB Output is correct
55 Correct 44 ms 261368 KB Output is correct
56 Correct 41 ms 254892 KB Output is correct
57 Runtime error 36 ms 262144 KB Execution killed with signal 9
58 Halted 0 ms 0 KB -