oj.uz

Submission #341472

# Submission time Handle Problem Language Result Execution time Memory
341472 2020-12-29T19:51:04 Z ryansee Furniture (JOI20_furniture) C++14
5 / 100
 5000 ms 1900 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (1006)
ll n,m,q;
bool A[MAXN][MAXN], vis[MAXN][MAXN];
bool bfs() {
	mmst(vis,0);
	queue<pi> q;
	q.emplace(1,1), vis[1][1]=1;
	while(q.size()) {
		ll x=q.front().f, y=q.front().s;
		q.pop();
		ll dx[]={0,1};
		ll dy[]={1,0};
		FOR(i,0,1) {
			ll nx = x+dx[i], ny = y+dy[i];
			if(nx < 1 || ny < 1 || nx > n || ny > m || vis[nx][ny] || A[nx][ny]) continue;
			vis[nx][ny]=1;
			q.emplace(nx, ny);
		}
	}
	return vis[n][m];
}
int main() {
	FAST
	cin>>n>>m;
	FOR(i,1,n)FOR(j,1,m)cin>>A[i][j];
	cin>>q;
	while(q--){
		ll x, y;
		cin>>x>>y;
		A[x][y] = 1;
		if(!bfs()) {
			A[x][y] = 0;
		}
		cout<<A[x][y]<<'\n';
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1388 KB Output is correct
2 Correct 138 ms 1516 KB Output is correct
3 Correct 237 ms 1516 KB Output is correct
4 Correct 499 ms 1516 KB Output is correct
5 Correct 480 ms 1516 KB Output is correct
6 Correct 677 ms 1516 KB Output is correct
7 Correct 459 ms 1772 KB Output is correct
8 Correct 505 ms 1664 KB Output is correct
9 Correct 812 ms 1644 KB Output is correct

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1388 KB Output is correct
2 Correct 138 ms 1516 KB Output is correct
3 Correct 237 ms 1516 KB Output is correct
4 Correct 499 ms 1516 KB Output is correct
5 Correct 480 ms 1516 KB Output is correct
6 Correct 677 ms 1516 KB Output is correct
7 Correct 459 ms 1772 KB Output is correct
8 Correct 505 ms 1664 KB Output is correct
9 Correct 812 ms 1644 KB Output is correct
10 Execution timed out 5071 ms 1900 KB Time limit exceeded
11 Halted 0 ms 0 KB -