oj.uz

답안 #153434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153434 2019-09-14T07:38:36 Z mhy908 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 450 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[4000010], id;
int par[4000010];
bool used[4000010];
int dist[4000010];
int A[4000010], B[4000010];
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;
            }
        }
    }
    if(x>=4000000){
        while(1){
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 94332 KB Output is correct
2 Correct 87 ms 94328 KB Output is correct
3 Correct 87 ms 94328 KB Output is correct
4 Correct 87 ms 94328 KB Output is correct
5 Correct 88 ms 94328 KB Output is correct
6 Correct 88 ms 94456 KB Output is correct
7 Correct 86 ms 94328 KB Output is correct
8 Correct 86 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 95 ms 94496 KB Output is correct
11 Correct 87 ms 94332 KB Output is correct
12 Correct 86 ms 94336 KB Output is correct
13 Correct 93 ms 94328 KB Output is correct
14 Correct 101 ms 94328 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94300 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 94332 KB Output is correct
2 Correct 87 ms 94328 KB Output is correct
3 Correct 87 ms 94328 KB Output is correct
4 Correct 87 ms 94328 KB Output is correct
5 Correct 88 ms 94328 KB Output is correct
6 Correct 88 ms 94456 KB Output is correct
7 Correct 86 ms 94328 KB Output is correct
8 Correct 86 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 95 ms 94496 KB Output is correct
11 Correct 87 ms 94332 KB Output is correct
12 Correct 86 ms 94336 KB Output is correct
13 Correct 93 ms 94328 KB Output is correct
14 Correct 101 ms 94328 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94300 KB Output is correct
17 Correct 96 ms 94456 KB Output is correct
18 Correct 103 ms 94456 KB Output is correct
19 Correct 87 ms 94316 KB Output is correct
20 Correct 103 ms 94456 KB Output is correct
21 Correct 99 ms 94552 KB Output is correct
22 Correct 92 ms 94428 KB Output is correct
23 Correct 86 ms 94456 KB Output is correct
24 Correct 86 ms 94328 KB Output is correct
25 Correct 88 ms 94352 KB Output is correct
26 Correct 88 ms 94200 KB Output is correct
27 Correct 88 ms 94456 KB Output is correct
28 Correct 88 ms 94556 KB Output is correct
29 Correct 88 ms 94456 KB Output is correct
30 Correct 86 ms 94456 KB Output is correct
31 Correct 87 ms 94328 KB Output is correct
32 Correct 90 ms 94456 KB Output is correct
33 Correct 87 ms 94456 KB Output is correct
34 Correct 87 ms 94456 KB Output is correct
35 Correct 87 ms 94504 KB Output is correct
36 Correct 87 ms 94456 KB Output is correct
37 Correct 88 ms 94456 KB Output is correct
38 Correct 88 ms 94456 KB Output is correct
39 Correct 98 ms 94428 KB Output is correct
40 Correct 104 ms 94456 KB Output is correct
41 Correct 88 ms 94456 KB Output is correct
42 Correct 111 ms 94616 KB Output is correct
43 Correct 87 ms 94456 KB Output is correct
44 Correct 88 ms 94460 KB Output is correct
45 Correct 87 ms 94456 KB Output is correct
46 Correct 87 ms 94456 KB Output is correct
47 Correct 90 ms 94376 KB Output is correct
48 Correct 92 ms 94584 KB Output is correct
49 Correct 104 ms 94456 KB Output is correct
50 Correct 87 ms 94456 KB Output is correct
51 Correct 88 ms 94516 KB Output is correct
52 Correct 88 ms 94464 KB Output is correct
53 Correct 86 ms 94456 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 94332 KB Output is correct
2 Correct 87 ms 94328 KB Output is correct
3 Correct 87 ms 94328 KB Output is correct
4 Correct 87 ms 94328 KB Output is correct
5 Correct 88 ms 94328 KB Output is correct
6 Correct 88 ms 94456 KB Output is correct
7 Correct 86 ms 94328 KB Output is correct
8 Correct 86 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 95 ms 94496 KB Output is correct
11 Correct 87 ms 94332 KB Output is correct
12 Correct 86 ms 94336 KB Output is correct
13 Correct 93 ms 94328 KB Output is correct
14 Correct 101 ms 94328 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94300 KB Output is correct
17 Correct 96 ms 94456 KB Output is correct
18 Correct 103 ms 94456 KB Output is correct
19 Correct 87 ms 94316 KB Output is correct
20 Correct 103 ms 94456 KB Output is correct
21 Correct 99 ms 94552 KB Output is correct
22 Correct 92 ms 94428 KB Output is correct
23 Correct 86 ms 94456 KB Output is correct
24 Correct 86 ms 94328 KB Output is correct
25 Correct 88 ms 94352 KB Output is correct
26 Correct 88 ms 94200 KB Output is correct
27 Correct 88 ms 94456 KB Output is correct
28 Correct 88 ms 94556 KB Output is correct
29 Correct 88 ms 94456 KB Output is correct
30 Correct 86 ms 94456 KB Output is correct
31 Correct 87 ms 94328 KB Output is correct
32 Correct 90 ms 94456 KB Output is correct
33 Correct 87 ms 94456 KB Output is correct
34 Correct 87 ms 94456 KB Output is correct
35 Correct 87 ms 94504 KB Output is correct
36 Correct 87 ms 94456 KB Output is correct
37 Correct 88 ms 94456 KB Output is correct
38 Correct 88 ms 94456 KB Output is correct
39 Correct 98 ms 94428 KB Output is correct
40 Correct 104 ms 94456 KB Output is correct
41 Correct 88 ms 94456 KB Output is correct
42 Correct 111 ms 94616 KB Output is correct
43 Correct 87 ms 94456 KB Output is correct
44 Correct 88 ms 94460 KB Output is correct
45 Correct 87 ms 94456 KB Output is correct
46 Correct 87 ms 94456 KB Output is correct
47 Correct 90 ms 94376 KB Output is correct
48 Correct 92 ms 94584 KB Output is correct
49 Correct 104 ms 94456 KB Output is correct
50 Correct 87 ms 94456 KB Output is correct
51 Correct 88 ms 94516 KB Output is correct
52 Correct 88 ms 94464 KB Output is correct
53 Correct 86 ms 94456 KB Output is correct
54 Correct 87 ms 94372 KB Output is correct
55 Correct 111 ms 105848 KB Output is correct
56 Correct 92 ms 94824 KB Output is correct
57 Correct 115 ms 116580 KB Output is correct
58 Correct 147 ms 125088 KB Output is correct
59 Runtime error 450 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -