Submission #1262200

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262200		PlayVoltz	Furniture (JOI20_furniture)	C++20	0 / 100	1 ms	464 KiB

furniture

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int n, m;
vector<int> cc;
vector<vector<int> > vect;
vector<vector<bool> > can;

int up(int x, int y){
	if (!can[x][y])return 1;
	if (cc[x+y]==1)return 0;
	queue<pii> q;
	q.push(mp(x, y));
	while (q.size()){
		x=q.front().fi, y=q.front().se;
		q.pop();
		if (x<0||y<0||x>=n||y>=m||!can[x][y])continue;
		can[x][y]=0;
		--cc[x+y];
		if (x&&y!=m-1&&!can[x-1][y+1])q.push(mp(x-1, y)), q.push(mp(x, y+1));
		if (x!=n-1&&y&&!can[x+1][y-1])q.push(mp(x+1, y)), q.push(mp(x, y-1));
	}
	return 1;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int q, a, b;
	cin>>n>>m;
	can.resize(n, vector<bool>(m, 1));
	cc.resize(n+m, 0);
	vect.resize(n, vector<int>(m));
	for (int i=0; i<n; ++i)for (int j=0; j<m; ++j)cin>>vect[i][j], ++cc[i+j];
	for (int i=0; i<n; ++i)for (int j=0; j<m; ++j)if (vect[i][j])up(i, j);
	cin>>q;
	while (q--){
		cin>>a>>b, --a, --b;
		cout<<up(a, b)<<"\n";
	}
}

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