Submission #412256

#	Time	Username	Problem	Language	Result	Execution time	Memory
412256		CSQ31	Furniture (JOI20_furniture)	C++14	100 / 100	449 ms	20776 KiB

furniture

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
vii vis(1111,vector<int>(1111));
int n,m;
int main()
{
	owo
	cin>>n>>m;
	vector<int>cnt(n+m+1);
	vii f(n+1,vector<int>(m+1));
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>vis[i][j];	
			f[i][j] = 1;
			cnt[i+j]++;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(vis[i][j]){
				if(!f[i][j])continue;
				f[i][j]=0;
				cnt[i+j]--;
				queue<pii>q;
				q.push({i-1,j});
				q.push({i,j-1});
				while(!q.empty()){
					int x = q.front().fi;
					int y = q.front().se;
					q.pop();
					if(x<0 || x>n || y<0 || y>m || !f[x][y])continue;
					if( (x==n  || !f[x+1][y]) && (y ==m || !f[x][y+1])){
						f[x][y] = 0;
						cnt[x+y]--;
						q.push({x-1,y});
						q.push({x,y-1});
					}
				}	
				q.push({i+1,j});
				q.push({i,j+1});
				while(!q.empty()){
					int x = q.front().fi;
					int y = q.front().se;
					q.pop();
					if(x<0 || x>n || y<0 || y>m || !f[x][y])continue;
					if( (!x || !f[x-1][y]) && (!y || !f[x][y-1])){
						f[x][y] = 0;
						cnt[x+y]--;
						q.push({x+1,y});
						q.push({x,y+1});
					}
				}	
				
				
			}
			
		}
	}
	int Q;
	cin>>Q;
	while(Q--){
		int i,j;
		cin>>i>>j;
		if(!f[i][j] || cnt[i+j] > 1){
			cout<<1<<'\n';
			if(!f[i][j])continue;
			f[i][j]=0;
			cnt[i+j]--;
			queue<pii>q;
			q.push({i-1,j});
			q.push({i,j-1});
			while(!q.empty()){
				int x = q.front().fi;
				int y = q.front().se;
				q.pop();
				if(x<0 || x>n || y<0 || y>m || !f[x][y])continue;
				if( (x==n  || !f[x+1][y]) && (y ==m || !f[x][y+1])){
					f[x][y] = 0;
					cnt[x+y]--;
					q.push({x-1,y});
					q.push({x,y-1});
				}
			}	
			q.push({i+1,j});
			q.push({i,j+1});
			while(!q.empty()){
				int x = q.front().fi;
				int y = q.front().se;
				q.pop();
				if(x<0 || x>n || y<0 || y>m || !f[x][y])continue;
				if( (!x || !f[x-1][y]) && (!y || !f[x][y-1])){
					f[x][y] = 0;
					cnt[x+y]--;
					q.push({x+1,y});
					q.push({x,y+1});
				}
			}	
		}else cout<<0<<'\n';
	}

}

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