Submission #330366

#TimeUsernameProblemLanguageResultExecution timeMemory
330366YJUFurniture (JOI20_furniture)C++14
100 / 100
430 ms19920 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=1e3+5; const ll K=350; const ld pi=3.14159265359; const ll INF=(1LL<<40); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() ll n,m,vis[N][N],c[4*N],x,y,q; void DFS(ll a,ll b); void push(ll a,ll b){ if(vis[a][b]){ vis[a][b]=0; --c[a+b]; DFS(a,b); } } bool add(ll a,ll b){ if(!vis[a][b])return 1; if(c[a+b]==1)return 0; push(a,b); return 1; } void DFS(ll a,ll b){ if(!vis[a-1][b+1]){ push(a-1,b); push(a,b+1); } if(!vis[a+1][b-1]){ push(a+1,b); push(a,b-1); } } int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>n>>m; REP1(i,n)REP1(j,m)vis[i][j]=1,++c[i+j]; REP1(i,n)REP1(j,m){ cin>>x; if(x)add(i,j); } cin>>q; while(q--){ cin>>x>>y; cout<<add(x,y)<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...