oj.uz

Submission #714143

# Submission time Handle Problem Language Result Execution time Memory
714143 2023-03-24T03:09:43 Z 089487 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 2000 ms 235656 KB 
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=3e3+7;
const int INF=1e18;
char c[N][N];
int col[N][N];
int row[N][N];
const int M=3e6+7;
vector<int> v[M];
int my[M];
bool vis[M];
bool dfs(int x){
	vis[x]=true;
	for(int i:v[x]){
		if(my[i]==-1||(!vis[my[i]]&&dfs(my[i]))){
			my[i]=x;
			return true;
		}
	}
	return false;
}
signed main(){
	quick
	int n,m;
	cin>>n>>m;
	rep(i,1,n){
		rep(j,1,m) cin>>c[i][j];
	}
	int Cc=0;
	int Cr=0;
	rep(i,1,n){
		rep(j,1,m){
			if(j+2<=m&&c[i][j]=='R'&&c[i][j+1]=='G'&&c[i][j+2]=='W'){
				++Cc;
				rep(jx,j,j+2){
					col[i][jx]=Cc;
				}
			}
			if(i+2<=n&&c[i][j]=='R'&&c[i+1][j]=='G'&&c[i+2][j]=='W'){
				++Cr;
				rep(ix,i,i+2){
					row[ix][j]=Cr;
				}
			}
		}
	}
	rep(i,1,n){
		rep(j,1,m){
			if(col[i][j]&&row[i][j]){
				v[col[i][j]].eb(row[i][j]);
			}
		}
	}
	fill(my,my+Cr+1,-1);
	int ans=0;
	rep(i,1,Cc){
		ans+=dfs(i);
		fill(vis,vis+Cc+1,0LL);
	}
	cout<<Cr+Cc-ans<<"\n";

	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70680 KB Output is correct
2 Correct 35 ms 70660 KB Output is correct
3 Correct 37 ms 70784 KB Output is correct
4 Correct 37 ms 70764 KB Output is correct
5 Correct 40 ms 70796 KB Output is correct
6 Correct 39 ms 70768 KB Output is correct
7 Correct 36 ms 70840 KB Output is correct
8 Correct 35 ms 70716 KB Output is correct
9 Correct 35 ms 70740 KB Output is correct
10 Correct 37 ms 70736 KB Output is correct
11 Correct 36 ms 70828 KB Output is correct
12 Correct 33 ms 70800 KB Output is correct
13 Correct 37 ms 70724 KB Output is correct
14 Correct 35 ms 70712 KB Output is correct
15 Correct 35 ms 70732 KB Output is correct
16 Correct 36 ms 70708 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70680 KB Output is correct
2 Correct 35 ms 70660 KB Output is correct
3 Correct 37 ms 70784 KB Output is correct
4 Correct 37 ms 70764 KB Output is correct
5 Correct 40 ms 70796 KB Output is correct
6 Correct 39 ms 70768 KB Output is correct
7 Correct 36 ms 70840 KB Output is correct
8 Correct 35 ms 70716 KB Output is correct
9 Correct 35 ms 70740 KB Output is correct
10 Correct 37 ms 70736 KB Output is correct
11 Correct 36 ms 70828 KB Output is correct
12 Correct 33 ms 70800 KB Output is correct
13 Correct 37 ms 70724 KB Output is correct
14 Correct 35 ms 70712 KB Output is correct
15 Correct 35 ms 70732 KB Output is correct
16 Correct 36 ms 70708 KB Output is correct
17 Correct 38 ms 70720 KB Output is correct
18 Correct 37 ms 70740 KB Output is correct
19 Correct 41 ms 70808 KB Output is correct
20 Correct 38 ms 70864 KB Output is correct
21 Correct 37 ms 70868 KB Output is correct
22 Correct 36 ms 70880 KB Output is correct
23 Correct 36 ms 70868 KB Output is correct
24 Correct 39 ms 70860 KB Output is correct
25 Correct 35 ms 70816 KB Output is correct
26 Correct 37 ms 70780 KB Output is correct
27 Correct 40 ms 70888 KB Output is correct
28 Correct 41 ms 70860 KB Output is correct
29 Correct 43 ms 70860 KB Output is correct
30 Correct 37 ms 70768 KB Output is correct
31 Correct 38 ms 70740 KB Output is correct
32 Correct 41 ms 70864 KB Output is correct
33 Correct 35 ms 70844 KB Output is correct
34 Correct 37 ms 70888 KB Output is correct
35 Correct 36 ms 70848 KB Output is correct
36 Correct 38 ms 70800 KB Output is correct
37 Correct 38 ms 70868 KB Output is correct
38 Correct 41 ms 70824 KB Output is correct
39 Correct 36 ms 70868 KB Output is correct
40 Correct 36 ms 70864 KB Output is correct
41 Correct 37 ms 70900 KB Output is correct
42 Correct 36 ms 70860 KB Output is correct
43 Correct 45 ms 70860 KB Output is correct
44 Correct 36 ms 70824 KB Output is correct
45 Correct 37 ms 70852 KB Output is correct
46 Correct 37 ms 70868 KB Output is correct
47 Correct 38 ms 70868 KB Output is correct
48 Correct 35 ms 70868 KB Output is correct
49 Correct 40 ms 70888 KB Output is correct
50 Correct 37 ms 70888 KB Output is correct
51 Correct 37 ms 70788 KB Output is correct
52 Correct 36 ms 70860 KB Output is correct
53 Correct 35 ms 70892 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70680 KB Output is correct
2 Correct 35 ms 70660 KB Output is correct
3 Correct 37 ms 70784 KB Output is correct
4 Correct 37 ms 70764 KB Output is correct
5 Correct 40 ms 70796 KB Output is correct
6 Correct 39 ms 70768 KB Output is correct
7 Correct 36 ms 70840 KB Output is correct
8 Correct 35 ms 70716 KB Output is correct
9 Correct 35 ms 70740 KB Output is correct
10 Correct 37 ms 70736 KB Output is correct
11 Correct 36 ms 70828 KB Output is correct
12 Correct 33 ms 70800 KB Output is correct
13 Correct 37 ms 70724 KB Output is correct
14 Correct 35 ms 70712 KB Output is correct
15 Correct 35 ms 70732 KB Output is correct
16 Correct 36 ms 70708 KB Output is correct
17 Correct 38 ms 70720 KB Output is correct
18 Correct 37 ms 70740 KB Output is correct
19 Correct 41 ms 70808 KB Output is correct
20 Correct 38 ms 70864 KB Output is correct
21 Correct 37 ms 70868 KB Output is correct
22 Correct 36 ms 70880 KB Output is correct
23 Correct 36 ms 70868 KB Output is correct
24 Correct 39 ms 70860 KB Output is correct
25 Correct 35 ms 70816 KB Output is correct
26 Correct 37 ms 70780 KB Output is correct
27 Correct 40 ms 70888 KB Output is correct
28 Correct 41 ms 70860 KB Output is correct
29 Correct 43 ms 70860 KB Output is correct
30 Correct 37 ms 70768 KB Output is correct
31 Correct 38 ms 70740 KB Output is correct
32 Correct 41 ms 70864 KB Output is correct
33 Correct 35 ms 70844 KB Output is correct
34 Correct 37 ms 70888 KB Output is correct
35 Correct 36 ms 70848 KB Output is correct
36 Correct 38 ms 70800 KB Output is correct
37 Correct 38 ms 70868 KB Output is correct
38 Correct 41 ms 70824 KB Output is correct
39 Correct 36 ms 70868 KB Output is correct
40 Correct 36 ms 70864 KB Output is correct
41 Correct 37 ms 70900 KB Output is correct
42 Correct 36 ms 70860 KB Output is correct
43 Correct 45 ms 70860 KB Output is correct
44 Correct 36 ms 70824 KB Output is correct
45 Correct 37 ms 70852 KB Output is correct
46 Correct 37 ms 70868 KB Output is correct
47 Correct 38 ms 70868 KB Output is correct
48 Correct 35 ms 70868 KB Output is correct
49 Correct 40 ms 70888 KB Output is correct
50 Correct 37 ms 70888 KB Output is correct
51 Correct 37 ms 70788 KB Output is correct
52 Correct 36 ms 70860 KB Output is correct
53 Correct 35 ms 70892 KB Output is correct
54 Correct 35 ms 70740 KB Output is correct
55 Correct 42 ms 81072 KB Output is correct
56 Correct 37 ms 71064 KB Output is correct
57 Correct 43 ms 89480 KB Output is correct
58 Correct 111 ms 97668 KB Output is correct
59 Execution timed out 2041 ms 235656 KB Time limit exceeded
60 Halted 0 ms 0 KB -