Submission #393814

#	Time	Username	Problem	Language	Result	Execution time	Memory
393814		arwaeystoamneg	Furniture (JOI20_furniture)	C++17	100 / 100	403 ms	12464 KiB

furniture

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 1005;
int n, m, q;
bitset<MAX> dp[MAX];
struct T
{
	int d;
	vpi path;
	bitset<MAX>b[MAX];
	T(int dir)
	{
		d = dir;
	}
	void init(int i, int j)
	{
		if (i < 0 || j < 0 || i >= n || j >= m || dp[i][j])return;
		path.pb({ i,j });
		b[i][j] = 1;
		int x = i + dx[d], y = j + dy[d];
		init(x, y);
		if (sz(path) == n + m - 1)return;
		dp[x][y] = 1;
		x = i + dx[d ^ 1], y = j + dy[d ^ 1];
		init(x, y);
		if (sz(path) == n + m - 1)return;
		dp[x][y] = 1;
		path.pop_back();
		b[i][j] = 0;
	}
	void init()
	{
		init(0, 0);
	}
	void upd(int x, int y)
	{
		int index = x + y;
		if (path[index].f != x || path[index].s != y)return;
		while (sz(path) > index)b[path.back().f][path.back().s] = 0, path.pop_back();
		while (1)
		{
			int x = path.back().f, y = path.back().s;
			path.pop_back();
			init(x, y);
			if (sz(path) == m + n - 1)return;
			dp[x][y] = 1;
		}
	}
};
int main() 
{
	setIO("test1");
	cin >> n >> m;
	F0R(i, n)F0R(j, m)
	{
		int t;
		cin >> t;
		dp[i][j] = t;
	}
	T top(1), bot(0);
	top.init();
	bot.init();
	cin >> q;
	while (q--)
	{
		int x, y;
		cin >> x >> y;
		x--, y--;
		if (top.b[x][y] && bot.b[x][y])
		{
			cout << "0" << endl;
			continue;
		}
		dp[x][y] = 1;
		cout << "1" << endl;
		top.upd(x, y);
		bot.upd(x, y);
	}
}

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