제출 #772564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772564		Sam_a17	Furniture (JOI20_furniture)	C++17	0 / 100	3 ms	2132 KiB

furniture

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  // if(str == "input") {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
  // } else if(str != "") {
    // freopen((str + ".in").c_str(), "r", stdin);
    // freopen((str + ".out").c_str(), "w", stdout);
  // }
}

const int inf = 1e9;
const long long mod = 1e9 + 7;
const int N = 1005;
bool vis[N][N];
int a[N][N];
int n, m, when[1005][1005];
pair<int, int> p[N][N];
int hs[N][N];
bool don[N][N];

void solve_() {
  cin >> n >> m;

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      cin >> a[i][j];
    }
  }

  int q; cin >> q;
  vector<pair<int, int>> qr;
  for(int i = 1; i <= q; i++) {
    int x, y; cin >> x >> y;
    when[x][y] = i;
    qr.emplace_back(x, y);
  }

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      if(!when[i][j]) {
        when[i][j] = inf;
      }
    }
  }

  priority_queue< pair< int, pair<int, int> > > pq;
  pq.push({when[1][1], {1, 1}});
  hs[1][1] = inf;
  while(!pq.empty()) {
    auto u = pq.top();
    pq.pop();
    int x = u.second.first, y = u.second.second;
    if(vis[x][y]) {
      continue;
    }
    vis[x][y] = true;
  
    if(x + 1 <= n && a[x + 1][y] != 1) {
      if(when[x][y] > hs[x + 1][y]) {
        hs[x + 1][y] = when[x][y];
        p[x + 1][y] = {x, y}; 
        pq.push({hs[x + 1][y], {x + 1, y}});
      }
    }
    
    if(y + 1 <= m && a[x][y + 1] != 1) {
      if(when[x][y] > hs[x][y + 1]) {
        hs[x][y + 1] = when[x][y];
        p[x][y + 1] = {x, y}; 
        pq.push({hs[x][y + 1], {x, y + 1}});
      }
    }
  }

  
  pair<int, int> cur;
  cur = {n, m};

  while (cur != make_pair(0, 0)) {
    don[cur.first][cur.second] = true;
    cur = p[cur.first][cur.second];
  }

  for(int i = 0; i < q; i++) {
    int x = qr[i].first, y = qr[i].second;
    if(don[x][y]) {
      cout << 0 << '\n';
    } else {
      cout << 1 << '\n';
    }
  }
  

}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
} 

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95