oj.uz

답안 #153444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153444 2019-09-14T07:50:13 Z mhy908 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 1018 ms 257828 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][3], ans;
short int re[3010][3010];
vector<int> link[3000010], id;
int par[3500010];
bool used[3000010];
int dist[3000010];
int A[3000010], B[3000010];
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++){
        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].resize(0);
    if(x>=4000000){
        printf("FUCK Memory Limit\n");
        return 0;
    }
    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.resize(0);
    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:79: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

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 78 ms 70776 KB Output is correct
4 Correct 68 ms 70904 KB Output is correct
5 Correct 67 ms 70904 KB Output is correct
6 Correct 67 ms 70932 KB Output is correct
7 Correct 66 ms 70904 KB Output is correct
8 Correct 72 ms 71004 KB Output is correct
9 Correct 66 ms 70904 KB Output is correct
10 Correct 66 ms 71032 KB Output is correct
11 Correct 66 ms 70904 KB Output is correct
12 Correct 65 ms 70904 KB Output is correct
13 Correct 66 ms 70888 KB Output is correct
14 Correct 66 ms 70904 KB Output is correct
15 Correct 66 ms 70904 KB Output is correct
16 Correct 66 ms 70840 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 78 ms 70776 KB Output is correct
4 Correct 68 ms 70904 KB Output is correct
5 Correct 67 ms 70904 KB Output is correct
6 Correct 67 ms 70932 KB Output is correct
7 Correct 66 ms 70904 KB Output is correct
8 Correct 72 ms 71004 KB Output is correct
9 Correct 66 ms 70904 KB Output is correct
10 Correct 66 ms 71032 KB Output is correct
11 Correct 66 ms 70904 KB Output is correct
12 Correct 65 ms 70904 KB Output is correct
13 Correct 66 ms 70888 KB Output is correct
14 Correct 66 ms 70904 KB Output is correct
15 Correct 66 ms 70904 KB Output is correct
16 Correct 66 ms 70840 KB Output is correct
17 Correct 67 ms 71032 KB Output is correct
18 Correct 66 ms 71032 KB Output is correct
19 Correct 66 ms 70904 KB Output is correct
20 Correct 66 ms 70904 KB Output is correct
21 Correct 66 ms 70904 KB Output is correct
22 Correct 67 ms 70908 KB Output is correct
23 Correct 66 ms 70904 KB Output is correct
24 Correct 70 ms 70932 KB Output is correct
25 Correct 65 ms 70880 KB Output is correct
26 Correct 66 ms 70776 KB Output is correct
27 Correct 67 ms 70948 KB Output is correct
28 Correct 66 ms 70904 KB Output is correct
29 Correct 65 ms 71032 KB Output is correct
30 Correct 69 ms 70976 KB Output is correct
31 Correct 66 ms 70900 KB Output is correct
32 Correct 66 ms 70944 KB Output is correct
33 Correct 66 ms 70932 KB Output is correct
34 Correct 66 ms 71032 KB Output is correct
35 Correct 66 ms 71112 KB Output is correct
36 Correct 65 ms 70908 KB Output is correct
37 Correct 77 ms 70984 KB Output is correct
38 Correct 78 ms 71032 KB Output is correct
39 Correct 78 ms 71032 KB Output is correct
40 Correct 67 ms 70904 KB Output is correct
41 Correct 67 ms 70904 KB Output is correct
42 Correct 66 ms 70904 KB Output is correct
43 Correct 66 ms 70904 KB Output is correct
44 Correct 65 ms 70904 KB Output is correct
45 Correct 66 ms 70904 KB Output is correct
46 Correct 65 ms 70928 KB Output is correct
47 Correct 66 ms 70904 KB Output is correct
48 Correct 67 ms 71004 KB Output is correct
49 Correct 67 ms 70904 KB Output is correct
50 Correct 78 ms 71032 KB Output is correct
51 Correct 69 ms 71032 KB Output is correct
52 Correct 66 ms 71032 KB Output is correct
53 Correct 72 ms 70988 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 78 ms 70776 KB Output is correct
4 Correct 68 ms 70904 KB Output is correct
5 Correct 67 ms 70904 KB Output is correct
6 Correct 67 ms 70932 KB Output is correct
7 Correct 66 ms 70904 KB Output is correct
8 Correct 72 ms 71004 KB Output is correct
9 Correct 66 ms 70904 KB Output is correct
10 Correct 66 ms 71032 KB Output is correct
11 Correct 66 ms 70904 KB Output is correct
12 Correct 65 ms 70904 KB Output is correct
13 Correct 66 ms 70888 KB Output is correct
14 Correct 66 ms 70904 KB Output is correct
15 Correct 66 ms 70904 KB Output is correct
16 Correct 66 ms 70840 KB Output is correct
17 Correct 67 ms 71032 KB Output is correct
18 Correct 66 ms 71032 KB Output is correct
19 Correct 66 ms 70904 KB Output is correct
20 Correct 66 ms 70904 KB Output is correct
21 Correct 66 ms 70904 KB Output is correct
22 Correct 67 ms 70908 KB Output is correct
23 Correct 66 ms 70904 KB Output is correct
24 Correct 70 ms 70932 KB Output is correct
25 Correct 65 ms 70880 KB Output is correct
26 Correct 66 ms 70776 KB Output is correct
27 Correct 67 ms 70948 KB Output is correct
28 Correct 66 ms 70904 KB Output is correct
29 Correct 65 ms 71032 KB Output is correct
30 Correct 69 ms 70976 KB Output is correct
31 Correct 66 ms 70900 KB Output is correct
32 Correct 66 ms 70944 KB Output is correct
33 Correct 66 ms 70932 KB Output is correct
34 Correct 66 ms 71032 KB Output is correct
35 Correct 66 ms 71112 KB Output is correct
36 Correct 65 ms 70908 KB Output is correct
37 Correct 77 ms 70984 KB Output is correct
38 Correct 78 ms 71032 KB Output is correct
39 Correct 78 ms 71032 KB Output is correct
40 Correct 67 ms 70904 KB Output is correct
41 Correct 67 ms 70904 KB Output is correct
42 Correct 66 ms 70904 KB Output is correct
43 Correct 66 ms 70904 KB Output is correct
44 Correct 65 ms 70904 KB Output is correct
45 Correct 66 ms 70904 KB Output is correct
46 Correct 65 ms 70928 KB Output is correct
47 Correct 66 ms 70904 KB Output is correct
48 Correct 67 ms 71004 KB Output is correct
49 Correct 67 ms 70904 KB Output is correct
50 Correct 78 ms 71032 KB Output is correct
51 Correct 69 ms 71032 KB Output is correct
52 Correct 66 ms 71032 KB Output is correct
53 Correct 72 ms 70988 KB Output is correct
54 Correct 79 ms 70904 KB Output is correct
55 Correct 75 ms 73720 KB Output is correct
56 Correct 68 ms 71388 KB Output is correct
57 Correct 83 ms 87292 KB Output is correct
58 Correct 190 ms 99696 KB Output is correct
59 Correct 1018 ms 257620 KB Output is correct
60 Correct 1018 ms 257828 KB Output is correct
61 Correct 1016 ms 257632 KB Output is correct
62 Correct 66 ms 71160 KB Output is correct
63 Correct 972 ms 256224 KB Output is correct
64 Incorrect 785 ms 206664 KB Output isn't correct
65 Halted 0 ms 0 KB -