oj.uz

Submission #153540

# Submission time Handle Problem Language Result Execution time Memory
153540 2019-09-14T15:11:25 Z mhy908 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 944 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;
vector<char> str[3010];
int col[3010][3010][2], ans;
short re[3010][3010];
vector<int> link[6000001], id;
vector<int> par;
vector<bool> used;
vector<int> dist, A, B;
vector<vector<int> > vc;
map<int, int> mp;
queue<int> Q;
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)
{
    for(int i=0; i<vc[p].size(); i++){
        if(!used[i]){
            dist[i]=0;
            Q.push(i);
        }
        else dist[i]=INF;
    }
    while(!Q.empty()){
        int a=Q.front();
        Q.pop();
        for(int b: link[vc[p][a]]){
            b=mp[b];
            if(B[b]!=-1&&dist[B[b]]==INF){
                dist[B[b]]=dist[a]+1;
                Q.push(B[b]);
            }
        }
    }
}
bool dfs(int p, int a){
    for(int b: link[vc[p][a]]){
        b=mp[b];
        if(B[b]==-1||dist[B[b]]==dist[a]+1&&dfs(p, 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[i]&&dfs(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++){
        str[i].pb(0);
        for(int j=1; j<=m; j++){
            char y;
            scanf(" %c", &y);
            str[i].pb(y);
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(j+2<=m)
                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(i+2<=n)
                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<=n; i++){
        str[i].clear();
        vector<char>().swap(str[i]);
    }
    for(int i=0; i<=x; i++)par.pb(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][0]);
                link[col[i][j][1]].pb(col[i][j][0]);
                link[col[i][j][0]].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();
    vector<int>().swap(id);
    vc.resize(maxpar);
    for(int i=1; i<=x; i++){
        vc[par[i]].pb(i);
    }
    par.clear();
    vector<int>().swap(par);
    for(int i=0; i<maxpar; i++){
        if(vc[i].size()==1)ans++;
        else{
            for(int j=0; j<vc[i].size(); j++)mp[vc[i][j]]=j;
            used.resize(vc[i].size()+2);
            dist.resize(vc[i].size()+2);
            A.resize(vc[i].size()+2);
            B.resize(vc[i].size()+2);
            for(int j=0; j<A.size(); j++)A[j]=B[j]=-1;
            ans+=vc[i].size()-hopcroft_carp(i);
            mp.clear();
            dist.clear();
            A.clear();
            B.clear();
            used.clear();
            vector<int>().swap(dist);
            vector<int>().swap(A);
            vector<int>().swap(B);
            vector<bool>().swap(used);
        }
    }
    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, int)':
dango_maker.cpp:52:43: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
         if(B[b]==-1||dist[B[b]]==dist[a]+1&&dfs(p, B[b])){
dango_maker.cpp: In function 'int hopcroft_carp(int)':
dango_maker.cpp:67: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:138:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<vc[i].size(); j++)mp[vc[i][j]]=j;
                          ~^~~~~~~~~~~~~
dango_maker.cpp:143:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<A.size(); j++)A[j]=B[j]=-1;
                          ~^~~~~~~~~
dango_maker.cpp:76: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:81:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf(" %c", &y);
             ~~~~~^~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 141304 KB Output is correct
2 Correct 135 ms 141316 KB Output is correct
3 Correct 136 ms 141232 KB Output is correct
4 Correct 135 ms 141308 KB Output is correct
5 Correct 136 ms 141304 KB Output is correct
6 Correct 135 ms 141304 KB Output is correct
7 Correct 134 ms 141456 KB Output is correct
8 Correct 135 ms 141276 KB Output is correct
9 Correct 137 ms 141304 KB Output is correct
10 Correct 134 ms 141304 KB Output is correct
11 Correct 133 ms 141292 KB Output is correct
12 Correct 134 ms 141340 KB Output is correct
13 Correct 145 ms 141580 KB Output is correct
14 Correct 138 ms 141304 KB Output is correct
15 Correct 139 ms 141304 KB Output is correct
16 Correct 136 ms 141264 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 141304 KB Output is correct
2 Correct 135 ms 141316 KB Output is correct
3 Correct 136 ms 141232 KB Output is correct
4 Correct 135 ms 141308 KB Output is correct
5 Correct 136 ms 141304 KB Output is correct
6 Correct 135 ms 141304 KB Output is correct
7 Correct 134 ms 141456 KB Output is correct
8 Correct 135 ms 141276 KB Output is correct
9 Correct 137 ms 141304 KB Output is correct
10 Correct 134 ms 141304 KB Output is correct
11 Correct 133 ms 141292 KB Output is correct
12 Correct 134 ms 141340 KB Output is correct
13 Correct 145 ms 141580 KB Output is correct
14 Correct 138 ms 141304 KB Output is correct
15 Correct 139 ms 141304 KB Output is correct
16 Correct 136 ms 141264 KB Output is correct
17 Correct 135 ms 141304 KB Output is correct
18 Correct 134 ms 141396 KB Output is correct
19 Correct 136 ms 141304 KB Output is correct
20 Correct 134 ms 141392 KB Output is correct
21 Correct 141 ms 141476 KB Output is correct
22 Correct 134 ms 141432 KB Output is correct
23 Correct 135 ms 141436 KB Output is correct
24 Correct 149 ms 141304 KB Output is correct
25 Correct 137 ms 141404 KB Output is correct
26 Correct 134 ms 141340 KB Output is correct
27 Correct 134 ms 141340 KB Output is correct
28 Correct 135 ms 141392 KB Output is correct
29 Correct 135 ms 141468 KB Output is correct
30 Correct 145 ms 141420 KB Output is correct
31 Correct 136 ms 141432 KB Output is correct
32 Correct 135 ms 141432 KB Output is correct
33 Correct 135 ms 141428 KB Output is correct
34 Correct 135 ms 141472 KB Output is correct
35 Correct 137 ms 141356 KB Output is correct
36 Correct 134 ms 141340 KB Output is correct
37 Correct 135 ms 141432 KB Output is correct
38 Correct 135 ms 141432 KB Output is correct
39 Correct 133 ms 141432 KB Output is correct
40 Correct 134 ms 141436 KB Output is correct
41 Correct 133 ms 141432 KB Output is correct
42 Correct 133 ms 141396 KB Output is correct
43 Correct 134 ms 141432 KB Output is correct
44 Correct 138 ms 141416 KB Output is correct
45 Correct 135 ms 141240 KB Output is correct
46 Correct 135 ms 141432 KB Output is correct
47 Correct 136 ms 141404 KB Output is correct
48 Correct 148 ms 141484 KB Output is correct
49 Correct 152 ms 141436 KB Output is correct
50 Correct 136 ms 141560 KB Output is correct
51 Correct 137 ms 141432 KB Output is correct
52 Correct 133 ms 141560 KB Output is correct
53 Correct 136 ms 141416 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 141304 KB Output is correct
2 Correct 135 ms 141316 KB Output is correct
3 Correct 136 ms 141232 KB Output is correct
4 Correct 135 ms 141308 KB Output is correct
5 Correct 136 ms 141304 KB Output is correct
6 Correct 135 ms 141304 KB Output is correct
7 Correct 134 ms 141456 KB Output is correct
8 Correct 135 ms 141276 KB Output is correct
9 Correct 137 ms 141304 KB Output is correct
10 Correct 134 ms 141304 KB Output is correct
11 Correct 133 ms 141292 KB Output is correct
12 Correct 134 ms 141340 KB Output is correct
13 Correct 145 ms 141580 KB Output is correct
14 Correct 138 ms 141304 KB Output is correct
15 Correct 139 ms 141304 KB Output is correct
16 Correct 136 ms 141264 KB Output is correct
17 Correct 135 ms 141304 KB Output is correct
18 Correct 134 ms 141396 KB Output is correct
19 Correct 136 ms 141304 KB Output is correct
20 Correct 134 ms 141392 KB Output is correct
21 Correct 141 ms 141476 KB Output is correct
22 Correct 134 ms 141432 KB Output is correct
23 Correct 135 ms 141436 KB Output is correct
24 Correct 149 ms 141304 KB Output is correct
25 Correct 137 ms 141404 KB Output is correct
26 Correct 134 ms 141340 KB Output is correct
27 Correct 134 ms 141340 KB Output is correct
28 Correct 135 ms 141392 KB Output is correct
29 Correct 135 ms 141468 KB Output is correct
30 Correct 145 ms 141420 KB Output is correct
31 Correct 136 ms 141432 KB Output is correct
32 Correct 135 ms 141432 KB Output is correct
33 Correct 135 ms 141428 KB Output is correct
34 Correct 135 ms 141472 KB Output is correct
35 Correct 137 ms 141356 KB Output is correct
36 Correct 134 ms 141340 KB Output is correct
37 Correct 135 ms 141432 KB Output is correct
38 Correct 135 ms 141432 KB Output is correct
39 Correct 133 ms 141432 KB Output is correct
40 Correct 134 ms 141436 KB Output is correct
41 Correct 133 ms 141432 KB Output is correct
42 Correct 133 ms 141396 KB Output is correct
43 Correct 134 ms 141432 KB Output is correct
44 Correct 138 ms 141416 KB Output is correct
45 Correct 135 ms 141240 KB Output is correct
46 Correct 135 ms 141432 KB Output is correct
47 Correct 136 ms 141404 KB Output is correct
48 Correct 148 ms 141484 KB Output is correct
49 Correct 152 ms 141436 KB Output is correct
50 Correct 136 ms 141560 KB Output is correct
51 Correct 137 ms 141432 KB Output is correct
52 Correct 133 ms 141560 KB Output is correct
53 Correct 136 ms 141416 KB Output is correct
54 Correct 135 ms 141300 KB Output is correct
55 Correct 156 ms 144044 KB Output is correct
56 Correct 138 ms 141692 KB Output is correct
57 Correct 153 ms 157692 KB Output is correct
58 Correct 246 ms 164856 KB Output is correct
59 Runtime error 944 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -