oj.uz

답안 #393814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393814 2021-04-24T15:02:44 Z arwaeystoamneg Furniture (JOI20_furniture) C++17
100 / 100
 403 ms 12464 KB 
// 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.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 4 ms 664 KB Output is correct
9 Correct 4 ms 588 KB Output is correct

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 4 ms 664 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 15 ms 944 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 183 ms 4176 KB Output is correct
13 Correct 78 ms 2628 KB Output is correct
14 Correct 313 ms 10408 KB Output is correct
15 Correct 319 ms 10540 KB Output is correct
16 Correct 326 ms 11468 KB Output is correct
17 Correct 403 ms 12096 KB Output is correct
18 Correct 393 ms 11776 KB Output is correct
19 Correct 332 ms 12460 KB Output is correct
20 Correct 319 ms 12388 KB Output is correct
21 Correct 338 ms 12464 KB Output is correct