제출 #1273751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273751		thelegendary08	Furniture (JOI20_furniture)	C++17	0 / 100	2 ms	572 KiB

furniture

#include<bits/stdc++.h>
// #include<atcoder/modint>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rs resize
#define ft front()
#define bk back()
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define r0f(i,n) for(int i = n-1; i >= 0; i--)
#define R0F(i,k,n) for(int i = n-1; i >= k; i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.F<<' '<<a.S<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
#define p2(x) (1LL << (x))
#define pct(x) (__builtin_popcountll(x))
#define ist(x,y) ((x >> y) & 1)
template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } 
template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } 
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
// using namespace atcoder; 
// using mint = modint998244353;
const int mxn = 1e3 + 5; 
bool grid[mxn][mxn]; pii dad[mxn][mxn]; int l[mxn][mxn], r[mxn][mxn], u[mxn][mxn], d[mxn][mxn], sz[mxn][mxn], n, m; 
vpii adj(pii p){
	int x = p.F, y = p.S; vpii ret; 
	if(x != 0)ret.pb(mp(x-1,y)); 
	if(y != 0)ret.pb(mp(x,y-1));
	if(x != n+1)ret.pb(mp(x+1,y));
	if(y != m+1)ret.pb(mp(x,y+1));
	return ret; 
}
vpii king(pii p){
	int x = p.F, y = p.S; vpii ret = adj(p); 
	if(x != 0 && y != 0)ret.pb(mp(x-1,y-1)); 
	if(x != 0 && y != m+1)ret.pb(mp(x-1,y+1)); 
	if(x != n+1 && y != 0)ret.pb(mp(x+1,y-1)); 
	if(x != n+1 && y != m+1)ret.pb(mp(x+1,y+1));
	return ret; 
}
vpii up(pii p){
	int x = p.F, y = p.S; 
	vpii ret = {mp(x-1,y),mp(x,y-1)}; return ret; 
}
vpii down(pii p){
	int x = p.F, y = p.S; 
	vpii ret = {mp(x+1,y),mp(x,y+1)}; return ret; 
}

bool check(pii p){ //was this guy initially a 0 and now a 1?
	int i = p.F, j = p.S; 
	if(grid[i][j])return 0; 
	bool uok = 1, dok = 1; 
	for(auto &[x,y] : up(mp(i,j))){
		if(!grid[x][y])uok = 0; 
	}
	for(auto&[x,y] : down(mp(i,j))){
		if(!grid[x][y])dok = 0; 
	}
	return uok||dok; 
}
pii find(pii p){
	if(dad[p.F][p.S] == p)return p; 
	return dad[p.F][p.S] = find(dad[p.F][p.S]);
}
void unite(pii a, pii b){
	a = find(a), b = find(b); if(a == b)return; 
	if(sz[a.F][a.S] < sz[b.F][b.S])swap(a,b); 
	sz[a.F][a.S] += sz[b.F][b.S]; dad[b.F][b.S] = mp(a.F,a.S);
	ckmin(l[a.F][a.S], l[b.F][b.S]); ckmin(u[a.F][a.S], u[b.F][b.S]);
	ckmax(r[a.F][a.S], r[b.F][b.S]); ckmax(d[a.F][a.S], d[b.F][b.S]);
}
void fill(pii p){
	
	int x = p.F, y = p.S; if(x + y <= 1 || x + y >= n + m + 1)return; grid[x][y] = 1; 
	/*
	for(auto &[a,b] : adj(p)){
		if(grid[a][b])unite(mp(a,b), mp(x,y)); 
	}
	*/
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	cin>>n>>m; 
	f0r(i, n+2)f0r(j, m+2){
		// dad[i][j] = mp(i,j); sz[i][j] = 1; u[i][j] = d[i][j] = i; l[i][j] = r[i][j] = j;
	}
	f0r(i, n+2)fill(mp(i,0)), fill(mp(i,m+1)); f0r(i, m+2)fill(mp(0,i)), fill(mp(n+1,i)); 
	// grid[0][0] = 0, grid[0][1] = 0, grid[1][0] = 0, grid[n+1][m+1] = 0, grid[n+1][m] = 0, grid[n][m+1] = 0; 
	f0r(i, n)f0r(j,m){in(x); if(x == 1)grid[i+1][j+1] = 1, fill(mp(i+1,j+1));}
	deque<pii>q; FOR(i, 1, n+1)FOR(j, 1, m+1){
		if(check(mp(i,j)))grid[i][j] = 1, q.push_back(mp(i, j)), fill(mp(i,j)); 
	}
	while(!q.empty()){
		int a = q.front().F; int b = q.front().S; q.pop_front();
		for(auto &[x,y] : up(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_back(mp(x,y)), fill(mp(x,y)); 
		for(auto &[x,y] : down(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_back(mp(x,y)), fill(mp(x,y)); 
	}
	
	// f0r(i, n+2){
		// f0r(j,m+2)cout<<grid[i][j]<<' ';
		// cout<<'\n';
	// }
	// cout<<'\n';
	// pii fa = find(mp(1,3)); pout(fa); dout(sz[fa.F][fa.S]);
	set<pii>bad; bad.insert(mp(n+1,m+1));
	in(Q); while(Q--){
		in2(x,y); //x--; y--; 
		if(grid[x][y]){out(1); continue;}
		vpii tmp; 
		grid[x][y] = 1; q.push_back(mp(x,y)); tmp.pb(mp(x,y)); 
		bool ans = 1; 
		while(!q.empty()){
			int a = q.front().F; int b = q.front().S; q.pop_front(); if(bad.count(mp(a,b))){ans = 0; break;}
			for(auto &[x,y] : up(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_back(mp(x,y)), tmp.pb(mp(x,y)); 
			for(auto &[x,y] : down(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_front(mp(x,y)), tmp.pb(mp(x,y)); 
		}
		// f0r(i, n+2){
		// f0r(j,m+2)cout<<grid[i][j]<<' ';
		// cout<<'\n';
	// }
	// cout<<'\n';
		if(!ans){
			bad.insert(mp(x,y)); out(0); for(auto u : tmp)grid[u.first][u.second] = 0; 
		}
		else out(1); 
		/*
		int tu = x, td = x, tl = y, tr = y; 
		
		for(auto &[a,b] : king(mp(x,y))){
			pii fa = find(mp(a,b)); int g = fa.first, w = fa.second; 
			ckmin(tu, u[g][w]); ckmin(tl, l[g][w]); 
			ckmax(td, d[g][w]); ckmax(tr, r[g][w]);
		}
		dout2(tu, tr);
		if((tu <= 1 && tl <= 1) || (td >= n && tr >= m)){out(0);}
		else{
			out(1); grid[x][y] = 1; q.push_back(mp(x,y)); 
			while(!q.empty()){
				int a = q.front().F; int b = q.front().S; q.pop_front();
				for(auto &[x,y] : up(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_back(mp(x,y)), fill(mp(x,y)); 
				for(auto &[x,y] : up(mp(a,b)))if(check(mp(x,y)))grid[x][y] = 1, q.push_back(mp(x,y)), fill(mp(x,y)); 
			}
		}
		*/
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95