제출 #714143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714143		089487	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	2041 ms	235656 KiB

dango_maker

#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 / 13
• Subtask 2: 20 / 20
• Subtask 3: 0 / 67