Submission #1255392

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255392		thdh__	Furniture (JOI20_furniture)	C++20	100 / 100	738 ms	11344 KiB

furniture

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 1000+5;
const int B = 750;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n,m,q;	
int a[N][N], cnt[N*2];
bool check[N][N];

void update1(int x, int y) 
{
	if (x < 1 || y < 1 || check[x][y] || (x == 1 && y == 1) || (x == n && y == m)) return;
	bool can = 1;
	if (x < n) can &= check[x+1][y];
	if (y < m) can &= check[x][y+1];
	if (!can) return;
	check[x][y] = 1;
	cnt[x+y]--;
	update1(x-1, y); update1(x, y-1);
}

void update2(int x, int y) 
{
	if (x > n || y > m || check[x][y] || (x == 1 && y == 1) || (x == n && y == m)) return;
	bool can = 1;
	if (x > 1) can &= check[x-1][y];
	if (y > 1) can &= check[x][y-1];
	if (!can) return;
	check[x][y] = 1;
	cnt[x+y]--;
	update2(x+1, y); update2(x, y+1);
}

void solve()
{
	cin>>n>>m;
	vector<ii> fern;
	for (int i = 1; i <= n; i++) 
	{
		for (int j = 1; j <= m; j++) 
		{
			cin>>a[i][j];
			cnt[i+j]++;
			if (a[i][j]) fern.pb({i,j});
		}
	}
	for (auto i : fern) 
	{
		int x = i.fi, y = i.se;
		if (check[x][y]) continue;
		check[x][y] = 1;
		cnt[x+y]--;
		update1(x-1, y), update1(x, y-1);
		update2(x+1, y), update2(x, y+1);
	}
	// for (int i = 1; i <= n; i++) 
	// {
	// 	for (int j = 1; j <= m; j++) cout<<check[i][j]<<" ";
	// 	cout<<endl;
	// }
	cin>>q;
	while (q--) 
	{
		int x,y;
		cin>>x>>y;
		if (check[x][y]) 
		{
			cout<<1<<endl;
		} else if (cnt[x+y] <= 1) 
		{
			cout<<0<<endl;
		} else 
		{
			cout<<1<<endl;
			check[x][y] = 1;
			cnt[x+y]--;
			update1(x-1, y), update1(x, y-1);
			update2(x+1, y), update2(x, y+1);
		}
		// for (int i = 1; i <= n; i++) 
		// {
		// 	for (int j = 1; j <= m; j++) cout<<check[i][j]<<" ";
		// 	cout<<endl;
		// }
	}
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

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