oj.uz

Submission #1102088

# Submission time Handle Problem Language Result Execution time Memory
1102088 2024-10-17T12:11:44 Z _8_8_ Dango Maker (JOI18_dango_maker) C++17
13 / 100
 225 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];
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) 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 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6680 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 6712 KB Output is correct
12 Correct 1 ms 6480 KB Output is correct
13 Correct 1 ms 6480 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6680 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 6712 KB Output is correct
12 Correct 1 ms 6480 KB Output is correct
13 Correct 1 ms 6480 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 6480 KB Output is correct
18 Correct 1 ms 6480 KB Output is correct
19 Correct 1 ms 8528 KB Output is correct
20 Correct 2 ms 8528 KB Output is correct
21 Correct 2 ms 8532 KB Output is correct
22 Correct 2 ms 8532 KB Output is correct
23 Correct 1 ms 6484 KB Output is correct
24 Correct 1 ms 4436 KB Output is correct
25 Correct 1 ms 2388 KB Output is correct
26 Correct 1 ms 2388 KB Output is correct
27 Runtime error 225 ms 262144 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6680 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 6712 KB Output is correct
12 Correct 1 ms 6480 KB Output is correct
13 Correct 1 ms 6480 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 6480 KB Output is correct
18 Correct 1 ms 6480 KB Output is correct
19 Correct 1 ms 8528 KB Output is correct
20 Correct 2 ms 8528 KB Output is correct
21 Correct 2 ms 8532 KB Output is correct
22 Correct 2 ms 8532 KB Output is correct
23 Correct 1 ms 6484 KB Output is correct
24 Correct 1 ms 4436 KB Output is correct
25 Correct 1 ms 2388 KB Output is correct
26 Correct 1 ms 2388 KB Output is correct
27 Runtime error 225 ms 262144 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -