제출 #1262204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262204		PlayVoltz	Furniture (JOI20_furniture)	C++20	100 / 100	146 ms	10540 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;
stack<pii> st;
vector<int> cc;
vector<vector<int> > vect;
vector<vector<bool> > can;

void insert(int x, int y){
	if (can[x][y])can[x][y]=0, --cc[x+y], st.push(mp(x, y));
}

int up(int x, int y){
	if (!can[x][y])return 1;
	if (cc[x+y]==1)return 0;
	insert(x, y);
	while (st.size()){
		x=st.top().fi, y=st.top().se;
		st.pop();
		if (!can[x-1][y+1])insert(x-1, y), insert(x, y+1);
		if (!can[x+1][y-1])insert(x+1, y), insert(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+2, vector<bool>(m+2, 0));
	cc.resize(n+m+2, 0);
	vect.resize(n+2, vector<int>(m+2, 1));
	for (int i=1; i<=n; ++i)for (int j=1; j<=m; ++j)cin>>vect[i][j], ++cc[i+j], can[i][j]=1;
	for (int i=1; i<=n; ++i)for (int j=1; j<=m; ++j)if (vect[i][j])up(i, j);
	cin>>q;
	while (q--){
		cin>>a>>b;
		cout<<up(a, b)<<"\n";
	}
}

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