oj.uz

Submission #791104

# Submission time Handle Problem Language Result Execution time Memory
791104 2023-07-23T12:19:36 Z christinelynn Furniture (JOI20_furniture) C++17
100 / 100
 2850 ms 27904 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
#define all(v) sort(v.begin(),v.end())
ll n,m,qq,x,y;
queue<pii> q;
ll grid[1010][1010],d[1000100];
bool vis[1010][1010];
ll tempd[1000100];
vector<pii> v;
vector<ll> idxV;
bool cek;
void bfs() {
  cek = false;
  while(!q.empty()) {
    pii x = q.front();
    q.pop();
    v.pb({x.fi,x.se});
    d[x.fi+x.se]--;
    if(d[x.fi+x.se] == 0){
    cek = true;
  }
  if(cek) continue; 
    if(vis[x.fi+1][x.se-1] && !vis[x.fi+1][x.se] && x.fi < n) 
    {
      q.push({x.fi+1,x.se});
      vis[x.fi+1][x.se] = true;
    }
    if(vis[x.fi+1][x.se-1] && !vis[x.fi][x.se-1] && x.fi < n) {
      q.push({x.fi,x.se-1});
      vis[x.fi][x.se-1] = true;
    }
    if(vis[x.fi-1][x.se+1] && !vis[x.fi][x.se+1] && x.se < m) {
      q.push({x.fi,x.se+1});
      vis[x.fi][x.se+1] = true;
    } 
    if(vis[x.fi-1][x.se+1] && !vis[x.fi-1][x.se] && x.se < m) {
      q.push({x.fi-1,x.se});
      vis[x.fi-1][x.se] = true;
    } 
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  FOR(1,i,n) {
    FOR(1,j,m) {
      cin >> grid[i][j];
      vis[i][j] = grid[i][j];
      if(vis[i][j]) q.push({i,j});
      d[i+j]++;
    } 
  }
  FOR(1,i,m) vis[0][i] = true;
  FOR(1,i,n) vis[i][0] = true;
  bfs();
  v.clear();
  cin >> qq;
  while(qq--) {
    cin >> x >> y;
    if(vis[x][y]) {
      cout << 1 << endl;
      continue;
    }
    vis[x][y] = true;
    q.push({x,y});
    bfs();
    if(cek) {
      cout << 0 << endl;
      for(auto i : v) {
        vis[i.fi][i.se] = false;
        d[i.fi+i.se]++;
      }
    }
    else {
      cout << 1 << endl;
    }
    v.clear();
  }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 15 ms 1620 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 106 ms 12808 KB Output is correct
13 Correct 46 ms 14836 KB Output is correct
14 Correct 211 ms 12852 KB Output is correct
15 Correct 200 ms 10800 KB Output is correct
16 Correct 206 ms 17376 KB Output is correct
17 Correct 268 ms 20852 KB Output is correct
18 Correct 213 ms 20040 KB Output is correct
19 Correct 224 ms 23948 KB Output is correct
20 Correct 2850 ms 27788 KB Output is correct
21 Correct 1722 ms 27904 KB Output is correct