oj.uz

Submission #1014859

# Submission time Handle Problem Language Result Execution time Memory
1014859 2024-07-05T15:58:02 Z ByeWorld Dango Maker (JOI18_dango_maker) C++14
100 / 100
 515 ms 262144 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<int, pii> ipii;
const int MAXN = 3002;

int n, m;
char a[MAXN][MAXN];
int b[MAXN][MAXN], cnt;
vector <vector<int>> adj;
void add(int x, int y){  adj[y].pb(x); }

int day;
vector <int> mat, vis;
vector<bool> done;
bool dfs(int nw){
    if(vis[nw] == day) return 0;
    vis[nw] = day;
    for(auto nx : adj[nw]){
        if(mat[nx]==0 || dfs(mat[nx])){
            mat[nx] = nw; return 1;
        }
    }
    return 0;
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) cin >> a[i][j];
    vector<int>te; adj.pb(te);
    int c1 = 0, c2 = 0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m-2; j++){
            if(a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W'){
                c1++;
            }
        }
    }
    for(int i=1; i<=n-2; i++){
        for(int j=1; j<=m; j++){
            if(a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W'){
                c2++;
            }
        }
    }

    int num = 0;
    if(c1 < c2){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=m-2; j++){
                if(a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W'){
                    adj.pb(te);
                    b[i][j] = ++cnt;
                    b[i][j+1] = cnt;
                    b[i][j+2] = cnt;
                }
            }
        }
        num = cnt;
        for(int i=1; i<=n-2; i++){
            for(int j=1; j<=m; j++){
                if(a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W'){
                    ++cnt;
                    add(cnt, b[i][j]);
                    add(cnt, b[i+1][j]);
                    add(cnt, b[i+2][j]);
                }
            }
        }
    } else {
        for(int i=1; i<=n-2; i++){
            for(int j=1; j<=m; j++){
                if(a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W'){
                    adj.pb(te);
                    ++cnt;
                    b[i][j] = cnt;
                    b[i+1][j] = cnt;
                    b[i+2][j] = cnt;
                }
            }
        }
        num = cnt;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=m-2; j++){
                if(a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W'){
                    ++cnt;
                    add(cnt, b[i][j]);
                    add(cnt, b[i][j+1]);
                    add(cnt, b[i][j+2]);
                }
            }
        }
    }
    mat.resize(cnt+2); vis.resize(cnt+2); done.resize(cnt+2);
    int ANS = 0;
    for(int i=1; i<=num; i++){
        for(auto nx : adj[i]){
            if(mat[nx] == 0){
                mat[nx] = i;
                done[i] = 1;
                ANS++;
                break;
            }
        }
    }
    for(int i=1; i<=num; i++){
        if(done[i]) continue;
        day++;
        ANS += dfs(i);
    }
    cout << cnt-ANS << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 460 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 460 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 3 ms 9176 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 5 ms 11356 KB Output is correct
58 Correct 32 ms 14640 KB Output is correct
59 Correct 259 ms 73888 KB Output is correct
60 Correct 254 ms 73920 KB Output is correct
61 Correct 279 ms 73976 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 244 ms 73124 KB Output is correct
64 Correct 395 ms 262144 KB Output is correct
65 Correct 447 ms 262144 KB Output is correct
66 Correct 515 ms 262144 KB Output is correct
67 Correct 141 ms 83864 KB Output is correct
68 Correct 149 ms 83836 KB Output is correct
69 Correct 153 ms 80956 KB Output is correct
70 Correct 45 ms 35804 KB Output is correct
71 Correct 42 ms 35772 KB Output is correct
72 Correct 48 ms 35768 KB Output is correct
73 Correct 45 ms 35764 KB Output is correct
74 Correct 46 ms 35840 KB Output is correct
75 Correct 48 ms 35744 KB Output is correct
76 Correct 49 ms 35752 KB Output is correct
77 Correct 47 ms 35836 KB Output is correct
78 Correct 52 ms 35744 KB Output is correct
79 Correct 54 ms 35772 KB Output is correct
80 Correct 50 ms 35756 KB Output is correct
81 Correct 61 ms 35748 KB Output is correct
82 Correct 56 ms 35772 KB Output is correct
83 Correct 45 ms 35768 KB Output is correct
84 Correct 52 ms 35748 KB Output is correct
85 Correct 46 ms 35780 KB Output is correct
86 Correct 50 ms 35752 KB Output is correct
87 Correct 48 ms 35768 KB Output is correct
88 Correct 52 ms 35768 KB Output is correct
89 Correct 50 ms 35772 KB Output is correct
90 Correct 50 ms 35748 KB Output is correct