oj.uz

Submission #373779

# Submission time Handle Problem Language Result Execution time Memory
373779 2021-03-05T18:17:42 Z AmineWeslati Furniture (JOI20_furniture) C++14
100 / 100
 442 ms 23916 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e3 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int N,M,Q,g[MX][MX];
vi cnt(MX*2,0);

bool check(int x, int y){
	bool a=0,b=0;
	if(x==1 && y==1) a=1;
	if(x==N && y==M) b=1;

	if(x-1>=1) a|=(!g[x-1][y]);
	if(x+1<=N) b|=(!g[x+1][y]);
	if(y-1>=1) a|=(!g[x][y-1]);
	if(y+1<=M) b|=(!g[x][y+1]);

	return a&&b;
}

int query(int x, int y){
	if(g[x][y]==1) return 1;
	if(cnt[x+y]==1) return 0;

	queue<pi>q; 
	q.push({x,y});
	while(!q.empty()){
		int x=q.front().fi,y=q.front().se;
		q.pop();

		g[x][y]=1;
		cnt[x+y]--;

		if(x-1>=1 && !g[x-1][y] && !check(x-1,y)) 
			q.push({x-1,y});
		if(x+1<=N && !g[x+1][y] && !check(x+1,y)) 
			q.push({x+1,y});
		if(y-1>=1 && !g[x][y-1] && !check(x,y-1)) 
			q.push({x,y-1});
		if(y+1<=M && !g[x][y+1] && !check(x,y+1)) 
			q.push({x,y+1});
	}

	return 1;
}

int32_t main() {
    boost; IO();

    cin>>N>>M;
    FOR(i,1,N+1) FOR(j,1,M+1) cnt[i+j]++,g[i][j]=0;
    FOR(i,1,N+1) FOR(j,1,M+1){
    	int x; cin>>x;
    	if(x) query(i,j);
    }
    cin>>Q;
    FOR(i,0,Q){
    	int x,y; cin>>x>>y;
    	cout << query(x,y) << endl;
    }

    

    return 0;
}
//Change your approach

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 4 ms 876 KB Output is correct
5 Correct 5 ms 1004 KB Output is correct
6 Correct 5 ms 1004 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 4 ms 1004 KB Output is correct
9 Correct 6 ms 1004 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 4 ms 876 KB Output is correct
5 Correct 5 ms 1004 KB Output is correct
6 Correct 5 ms 1004 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 4 ms 1004 KB Output is correct
9 Correct 6 ms 1004 KB Output is correct
10 Correct 15 ms 1388 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 219 ms 16620 KB Output is correct
13 Correct 87 ms 13164 KB Output is correct
14 Correct 382 ms 20588 KB Output is correct
15 Correct 390 ms 20588 KB Output is correct
16 Correct 397 ms 22248 KB Output is correct
17 Correct 415 ms 23276 KB Output is correct
18 Correct 408 ms 22636 KB Output is correct
19 Correct 442 ms 23916 KB Output is correct
20 Correct 334 ms 23788 KB Output is correct
21 Correct 424 ms 23916 KB Output is correct