oj.uz

Submission #153429

# Submission time Handle Problem Language Result Execution time Memory
153429 2019-09-14T07:34:49 Z mhy908 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 269 ms 262148 KB 
#include <bits/stdc++.h>
#define pb push_back
#define INF 987654321
using namespace std;
typedef long long LL;
int n, m, x;
char str[3010][3010];
int col[3010][3010][3], ans;
short int re[3010][3010];
vector<int> link[9000010], id;
int par[9000010];
bool used[9000010];
int dist[9000010];
int A[9000010], B[9000010];
vector<vector<int> > vc;
int findpar(int num)
{
    if(num==par[num])return num;
    return par[num]=findpar(par[num]);
}
void mergepar(int a, int b)
{
    a=findpar(a);
    b=findpar(b);
    par[a]=par[b];
}
void bfs(int p)
{
    queue<int> Q;
    for(int i=0; i<vc[p].size(); i++){
        if(!used[vc[p][i]]){
            dist[vc[p][i]]=0;
            Q.push(vc[p][i]);
        }
        else dist[vc[p][i]]=INF;
    }
    while(!Q.empty()){
        int a=Q.front();
        Q.pop();
        for(int b: link[a]){
            if(B[b]!=-1&&dist[B[b]]==INF){
                dist[B[b]]=dist[a]+1;
                Q.push(B[b]);
            }
        }
    }
}
bool dfs(int a){
    for(int b: link[a]){
        if(B[b]==-1||dist[B[b]]==dist[a]+1&&dfs(B[b])){
            used[a]=true;
            A[a]=b;
            B[b]=a;
            return true;
        }
    }
    return false;
}
int hopcroft_carp(int p)
{
    int match=0;
    while(1){
        bfs(p);
        int flow = 0;
        for(int i=0; i<vc[p].size(); i++)
            if(!used[vc[p][i]] && dfs(vc[p][i]))flow++;
        if(!flow)break;
        match+=flow;
    }
    return match/2;
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++){
        scanf("%s", str[i]+1);
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(str[i][j]=='R'&&str[i][j+1]=='G'&&str[i][j+2]=='W'){
                ++x;
                col[i][j][++re[i][j]]=x;
                col[i][j+1][++re[i][j+1]]=x;
                col[i][j+2][++re[i][j+2]]=x;
            }
            if(str[i][j]=='R'&&str[i+1][j]=='G'&&str[i+2][j]=='W'){
                ++x;
                col[i][j][++re[i][j]]=x;
                col[i+1][j][++re[i+1][j]]=x;
                col[i+2][j][++re[i+2][j]]=x;
            }
        }
    }
    for(int i=1; i<=x; i++)par[i]=i;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(re[i][j]==2){
                mergepar(col[i][j][1], col[i][j][2]);
                link[col[i][j][1]].pb(col[i][j][2]);
                link[col[i][j][2]].pb(col[i][j][1]);
            }
        }
    }
    for(int i=1; i<=x; i++){
        id.pb(findpar(i));
    }
    sort(id.begin(), id.end());
    id.erase(unique(id.begin(), id.end()), id.end());
    int maxpar=1;
    for(int i=1; i<=x; i++){
        par[i]=lower_bound(id.begin(), id.end(), par[i])-id.begin();
        maxpar=max(maxpar, par[i]+1);
    }
    id.clear();
    vc.resize(maxpar);
    for(int i=1; i<=x; i++){
        vc[par[i]].pb(i);
    }
    fill(A+1, A+x+1, -1);
    fill(B+1, B+x+1, -1);
    for(int i=0; i<maxpar; i++){
        if(vc[i].size()==1)ans++;
        else ans+=vc[i].size()-hopcroft_carp(i);
    }
    printf("%d", ans);
}

Compilation message

dango_maker.cpp: In function 'void bfs(int)':
dango_maker.cpp:30:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<vc[p].size(); i++){
                  ~^~~~~~~~~~~~~
dango_maker.cpp: In function 'bool dfs(int)':
dango_maker.cpp:50:43: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
         if(B[b]==-1||dist[B[b]]==dist[a]+1&&dfs(B[b])){
                      ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
dango_maker.cpp: In function 'int hopcroft_carp(int)':
dango_maker.cpp:65:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<vc[p].size(); i++)
                      ~^~~~~~~~~~~~~
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", str[i]+1);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 211728 KB Output is correct
2 Correct 190 ms 211704 KB Output is correct
3 Correct 192 ms 211856 KB Output is correct
4 Correct 206 ms 211668 KB Output is correct
5 Correct 191 ms 211740 KB Output is correct
6 Correct 198 ms 211916 KB Output is correct
7 Correct 196 ms 211872 KB Output is correct
8 Correct 191 ms 211704 KB Output is correct
9 Correct 191 ms 211704 KB Output is correct
10 Correct 191 ms 211724 KB Output is correct
11 Correct 192 ms 211792 KB Output is correct
12 Correct 191 ms 211808 KB Output is correct
13 Correct 219 ms 211680 KB Output is correct
14 Correct 207 ms 211764 KB Output is correct
15 Correct 203 ms 211860 KB Output is correct
16 Correct 191 ms 211704 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 211728 KB Output is correct
2 Correct 190 ms 211704 KB Output is correct
3 Correct 192 ms 211856 KB Output is correct
4 Correct 206 ms 211668 KB Output is correct
5 Correct 191 ms 211740 KB Output is correct
6 Correct 198 ms 211916 KB Output is correct
7 Correct 196 ms 211872 KB Output is correct
8 Correct 191 ms 211704 KB Output is correct
9 Correct 191 ms 211704 KB Output is correct
10 Correct 191 ms 211724 KB Output is correct
11 Correct 192 ms 211792 KB Output is correct
12 Correct 191 ms 211808 KB Output is correct
13 Correct 219 ms 211680 KB Output is correct
14 Correct 207 ms 211764 KB Output is correct
15 Correct 203 ms 211860 KB Output is correct
16 Correct 191 ms 211704 KB Output is correct
17 Correct 199 ms 211816 KB Output is correct
18 Correct 191 ms 211704 KB Output is correct
19 Correct 192 ms 211872 KB Output is correct
20 Correct 189 ms 211812 KB Output is correct
21 Correct 192 ms 211868 KB Output is correct
22 Correct 191 ms 211944 KB Output is correct
23 Correct 191 ms 211756 KB Output is correct
24 Correct 190 ms 211704 KB Output is correct
25 Correct 192 ms 211744 KB Output is correct
26 Correct 192 ms 211804 KB Output is correct
27 Correct 251 ms 211932 KB Output is correct
28 Correct 195 ms 211968 KB Output is correct
29 Correct 198 ms 211996 KB Output is correct
30 Correct 191 ms 211832 KB Output is correct
31 Correct 201 ms 211896 KB Output is correct
32 Correct 190 ms 211852 KB Output is correct
33 Correct 190 ms 211880 KB Output is correct
34 Correct 200 ms 211884 KB Output is correct
35 Correct 191 ms 211944 KB Output is correct
36 Correct 203 ms 211864 KB Output is correct
37 Correct 196 ms 211972 KB Output is correct
38 Correct 242 ms 211960 KB Output is correct
39 Correct 194 ms 211960 KB Output is correct
40 Correct 194 ms 211964 KB Output is correct
41 Correct 192 ms 211808 KB Output is correct
42 Correct 192 ms 211892 KB Output is correct
43 Correct 194 ms 211964 KB Output is correct
44 Correct 192 ms 211924 KB Output is correct
45 Correct 212 ms 212052 KB Output is correct
46 Correct 195 ms 211832 KB Output is correct
47 Correct 193 ms 211832 KB Output is correct
48 Correct 194 ms 211832 KB Output is correct
49 Correct 193 ms 211980 KB Output is correct
50 Correct 193 ms 211832 KB Output is correct
51 Correct 195 ms 211832 KB Output is correct
52 Correct 196 ms 212088 KB Output is correct
53 Correct 192 ms 211812 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 211728 KB Output is correct
2 Correct 190 ms 211704 KB Output is correct
3 Correct 192 ms 211856 KB Output is correct
4 Correct 206 ms 211668 KB Output is correct
5 Correct 191 ms 211740 KB Output is correct
6 Correct 198 ms 211916 KB Output is correct
7 Correct 196 ms 211872 KB Output is correct
8 Correct 191 ms 211704 KB Output is correct
9 Correct 191 ms 211704 KB Output is correct
10 Correct 191 ms 211724 KB Output is correct
11 Correct 192 ms 211792 KB Output is correct
12 Correct 191 ms 211808 KB Output is correct
13 Correct 219 ms 211680 KB Output is correct
14 Correct 207 ms 211764 KB Output is correct
15 Correct 203 ms 211860 KB Output is correct
16 Correct 191 ms 211704 KB Output is correct
17 Correct 199 ms 211816 KB Output is correct
18 Correct 191 ms 211704 KB Output is correct
19 Correct 192 ms 211872 KB Output is correct
20 Correct 189 ms 211812 KB Output is correct
21 Correct 192 ms 211868 KB Output is correct
22 Correct 191 ms 211944 KB Output is correct
23 Correct 191 ms 211756 KB Output is correct
24 Correct 190 ms 211704 KB Output is correct
25 Correct 192 ms 211744 KB Output is correct
26 Correct 192 ms 211804 KB Output is correct
27 Correct 251 ms 211932 KB Output is correct
28 Correct 195 ms 211968 KB Output is correct
29 Correct 198 ms 211996 KB Output is correct
30 Correct 191 ms 211832 KB Output is correct
31 Correct 201 ms 211896 KB Output is correct
32 Correct 190 ms 211852 KB Output is correct
33 Correct 190 ms 211880 KB Output is correct
34 Correct 200 ms 211884 KB Output is correct
35 Correct 191 ms 211944 KB Output is correct
36 Correct 203 ms 211864 KB Output is correct
37 Correct 196 ms 211972 KB Output is correct
38 Correct 242 ms 211960 KB Output is correct
39 Correct 194 ms 211960 KB Output is correct
40 Correct 194 ms 211964 KB Output is correct
41 Correct 192 ms 211808 KB Output is correct
42 Correct 192 ms 211892 KB Output is correct
43 Correct 194 ms 211964 KB Output is correct
44 Correct 192 ms 211924 KB Output is correct
45 Correct 212 ms 212052 KB Output is correct
46 Correct 195 ms 211832 KB Output is correct
47 Correct 193 ms 211832 KB Output is correct
48 Correct 194 ms 211832 KB Output is correct
49 Correct 193 ms 211980 KB Output is correct
50 Correct 193 ms 211832 KB Output is correct
51 Correct 195 ms 211832 KB Output is correct
52 Correct 196 ms 212088 KB Output is correct
53 Correct 192 ms 211812 KB Output is correct
54 Correct 191 ms 211744 KB Output is correct
55 Correct 239 ms 223248 KB Output is correct
56 Correct 194 ms 212244 KB Output is correct
57 Correct 218 ms 234104 KB Output is correct
58 Correct 251 ms 242460 KB Output is correct
59 Runtime error 269 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -