oj.uz

Submission #889345

# Submission time Handle Problem Language Result Execution time Memory
889345 2023-12-19T11:34:10 Z alexander707070 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 65 ms 262144 KB 
#include<bits/stdc++.h>
#define MAXN 9000007
using namespace std;

struct edge{
    int to,flow,cap,rev;
};

int n,m;
char t[3007][3007];

vector<edge> v[MAXN];
int s[MAXN],cnt1,cnt2,ans;
int num[3007][3007],num2[3007][3007],total;

int flow,maxflow,source,sink;
int li[MAXN],tim,dist[MAXN],ind[MAXN];
queue<int> q;

void add_edge(int from,int to){
    v[from].push_back({to,0,1,int(v[to].size())});
    v[to].push_back({from,0,0,int(v[from].size())-1});
}

void bfs(int x){
    for(int i=0;i<v[x].size();i++){
        if(li[v[x][i].to]==tim or v[x][i].cap-v[x][i].flow<=0)continue;

        q.push(v[x][i].to);
        li[v[x][i].to]=tim;
        dist[v[x][i].to]=dist[x]+1;
    }
}

void do_bfs(){
    tim++; li[source]=tim;
    while(!q.empty())q.pop();
    
    q.push(source);

    while(!q.empty()){
        bfs(q.front());
        if(q.front()==sink)return;
        q.pop();
    }
}

int dfs(int x,int mins){
    if(x==sink)return mins;

    if(li[x]!=tim)ind[x]=0;
    li[x]=tim;

    for(int i=ind[x];i<v[x].size();i++){
        if(dist[v[x][i].to]!=dist[x]+1 or v[x][i].cap-v[x][i].flow<=0){
            ind[x]++; continue;
        }
        int curr=dfs(v[x][i].to,1);

        if(curr>0){
            v[x][i].flow+=curr;
            v[v[x][i].to][v[x][i].rev].flow-=curr;
            return curr;
        }

        ind[x]++;
        i=max(i,ind[x]-1);
    }

    return 0;
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m;

    for(int i=0;i<=n+1;i++){
        for(int f=0;f<=m+1;f++){
            t[i][f]='#';
        }
    }

    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){
            cin>>t[i][f];
        }
    }

    source=0; sink=n*m;
    
    total=0;
    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){

            if(t[i][f]=='R' and t[i][f+1]=='G' and t[i][f+2]=='W'){
                total++; num[i][f]=total;
                add_edge(source,total);
            }
            if(t[i][f]=='R' and t[i+1][f]=='G' and t[i+2][f]=='W'){
                total++; num2[i][f]=total;
                add_edge(total,sink);
            }

            if(t[i][f]=='R' and t[i][f+1]=='G' and t[i][f+2]=='W' and t[i+1][f]=='G' and t[i+2][f]=='W'){
                add_edge(num[i][f],num2[i][f]);
            }
        }
    }
    
    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){
            if(t[i][f]=='G' and t[i][f-1]=='R' and t[i][f+1]=='W' and t[i-1][f]=='R' and t[i+1][f]=='W'){
                add_edge(num[i][f-1],num2[i-1][f]);
            }
        }
    }

    for(int i=2;i<=n;i++){
        for(int f=2;f<=m;f++){
            if(t[i][f]=='W' and t[i][f-2]=='R' and t[i][f-1]=='G' and t[i-2][f]=='R' and t[i-1][f]=='G'){
                add_edge(num[i][f-2],num2[i-2][f]);
            }
        }
    }

    while(true){
        do_bfs();
        if(li[sink]!=tim)break;
        tim++;
        while(true){
            flow=dfs(source,1);
            if(flow==0)break;
            maxflow+=flow;
        }
    }

    cout<<total-maxflow<<"\n";

    return 0;
}

Compilation message

dango_maker.cpp: In function 'void bfs(int)':
dango_maker.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
dango_maker.cpp: In function 'int dfs(int, int)':
dango_maker.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=ind[x];i<v[x].size();i++){
      |                      ~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 215892 KB Output is correct
2 Correct 48 ms 215892 KB Output is correct
3 Correct 45 ms 215784 KB Output is correct
4 Correct 46 ms 215840 KB Output is correct
5 Correct 47 ms 215900 KB Output is correct
6 Correct 50 ms 217948 KB Output is correct
7 Correct 45 ms 217940 KB Output is correct
8 Correct 45 ms 217944 KB Output is correct
9 Correct 46 ms 217940 KB Output is correct
10 Correct 48 ms 215896 KB Output is correct
11 Correct 45 ms 217832 KB Output is correct
12 Correct 45 ms 217936 KB Output is correct
13 Correct 45 ms 217936 KB Output is correct
14 Correct 45 ms 215900 KB Output is correct
15 Correct 45 ms 215892 KB Output is correct
16 Correct 48 ms 215916 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 215892 KB Output is correct
2 Correct 48 ms 215892 KB Output is correct
3 Correct 45 ms 215784 KB Output is correct
4 Correct 46 ms 215840 KB Output is correct
5 Correct 47 ms 215900 KB Output is correct
6 Correct 50 ms 217948 KB Output is correct
7 Correct 45 ms 217940 KB Output is correct
8 Correct 45 ms 217944 KB Output is correct
9 Correct 46 ms 217940 KB Output is correct
10 Correct 48 ms 215896 KB Output is correct
11 Correct 45 ms 217832 KB Output is correct
12 Correct 45 ms 217936 KB Output is correct
13 Correct 45 ms 217936 KB Output is correct
14 Correct 45 ms 215900 KB Output is correct
15 Correct 45 ms 215892 KB Output is correct
16 Correct 48 ms 215916 KB Output is correct
17 Correct 45 ms 217940 KB Output is correct
18 Correct 45 ms 218148 KB Output is correct
19 Correct 45 ms 217940 KB Output is correct
20 Correct 45 ms 217940 KB Output is correct
21 Correct 45 ms 217968 KB Output is correct
22 Correct 46 ms 217820 KB Output is correct
23 Correct 47 ms 217908 KB Output is correct
24 Correct 46 ms 217944 KB Output is correct
25 Correct 46 ms 215740 KB Output is correct
26 Correct 45 ms 215752 KB Output is correct
27 Correct 45 ms 217960 KB Output is correct
28 Correct 45 ms 217940 KB Output is correct
29 Correct 45 ms 217940 KB Output is correct
30 Correct 50 ms 215912 KB Output is correct
31 Correct 44 ms 215900 KB Output is correct
32 Correct 45 ms 215900 KB Output is correct
33 Correct 45 ms 217936 KB Output is correct
34 Correct 46 ms 217948 KB Output is correct
35 Correct 46 ms 217988 KB Output is correct
36 Correct 46 ms 217948 KB Output is correct
37 Correct 46 ms 217948 KB Output is correct
38 Correct 45 ms 217896 KB Output is correct
39 Correct 46 ms 217948 KB Output is correct
40 Correct 45 ms 217940 KB Output is correct
41 Correct 45 ms 217936 KB Output is correct
42 Correct 45 ms 217804 KB Output is correct
43 Correct 47 ms 217976 KB Output is correct
44 Correct 45 ms 217948 KB Output is correct
45 Correct 44 ms 217940 KB Output is correct
46 Correct 46 ms 217944 KB Output is correct
47 Correct 47 ms 217936 KB Output is correct
48 Correct 44 ms 217944 KB Output is correct
49 Correct 45 ms 217948 KB Output is correct
50 Correct 45 ms 217804 KB Output is correct
51 Correct 46 ms 217948 KB Output is correct
52 Correct 47 ms 217848 KB Output is correct
53 Correct 45 ms 217944 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 215892 KB Output is correct
2 Correct 48 ms 215892 KB Output is correct
3 Correct 45 ms 215784 KB Output is correct
4 Correct 46 ms 215840 KB Output is correct
5 Correct 47 ms 215900 KB Output is correct
6 Correct 50 ms 217948 KB Output is correct
7 Correct 45 ms 217940 KB Output is correct
8 Correct 45 ms 217944 KB Output is correct
9 Correct 46 ms 217940 KB Output is correct
10 Correct 48 ms 215896 KB Output is correct
11 Correct 45 ms 217832 KB Output is correct
12 Correct 45 ms 217936 KB Output is correct
13 Correct 45 ms 217936 KB Output is correct
14 Correct 45 ms 215900 KB Output is correct
15 Correct 45 ms 215892 KB Output is correct
16 Correct 48 ms 215916 KB Output is correct
17 Correct 45 ms 217940 KB Output is correct
18 Correct 45 ms 218148 KB Output is correct
19 Correct 45 ms 217940 KB Output is correct
20 Correct 45 ms 217940 KB Output is correct
21 Correct 45 ms 217968 KB Output is correct
22 Correct 46 ms 217820 KB Output is correct
23 Correct 47 ms 217908 KB Output is correct
24 Correct 46 ms 217944 KB Output is correct
25 Correct 46 ms 215740 KB Output is correct
26 Correct 45 ms 215752 KB Output is correct
27 Correct 45 ms 217960 KB Output is correct
28 Correct 45 ms 217940 KB Output is correct
29 Correct 45 ms 217940 KB Output is correct
30 Correct 50 ms 215912 KB Output is correct
31 Correct 44 ms 215900 KB Output is correct
32 Correct 45 ms 215900 KB Output is correct
33 Correct 45 ms 217936 KB Output is correct
34 Correct 46 ms 217948 KB Output is correct
35 Correct 46 ms 217988 KB Output is correct
36 Correct 46 ms 217948 KB Output is correct
37 Correct 46 ms 217948 KB Output is correct
38 Correct 45 ms 217896 KB Output is correct
39 Correct 46 ms 217948 KB Output is correct
40 Correct 45 ms 217940 KB Output is correct
41 Correct 45 ms 217936 KB Output is correct
42 Correct 45 ms 217804 KB Output is correct
43 Correct 47 ms 217976 KB Output is correct
44 Correct 45 ms 217948 KB Output is correct
45 Correct 44 ms 217940 KB Output is correct
46 Correct 46 ms 217944 KB Output is correct
47 Correct 47 ms 217936 KB Output is correct
48 Correct 44 ms 217944 KB Output is correct
49 Correct 45 ms 217948 KB Output is correct
50 Correct 45 ms 217804 KB Output is correct
51 Correct 46 ms 217948 KB Output is correct
52 Correct 47 ms 217848 KB Output is correct
53 Correct 45 ms 217944 KB Output is correct
54 Correct 45 ms 217944 KB Output is correct
55 Correct 54 ms 257620 KB Output is correct
56 Correct 50 ms 218204 KB Output is correct
57 Runtime error 43 ms 262144 KB Execution killed with signal 9
58 Halted 0 ms 0 KB -