답안 #772810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772810 2023-07-04T11:28:59 Z Sam_a17 Furniture (JOI20_furniture) C++17
100 / 100
240 ms 19780 KB
#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;
int vis1[N][N], vis2[N][N];
int a[N][N];
int n, m;
pair<int, int> p[N][N];
int hs[N][N], dp[N][N];

int di[2 * N];

void ishak(int x, int y) {
  queue<pair<int, int>> q;
  q.push({x, y});

  while(!q.empty()) {
    auto u = q.front();
    q.pop();

    int xi = u.first, yi = u.second;
    if(dp[xi][yi] != false) {
      dp[xi][yi] = false;
      di[xi + yi]--;
      // continue;
    } else {
      continue;
    }

    if(!dp[xi - 1][yi + 1]) {
      q.push({xi - 1, yi});
      q.push({xi, yi + 1});
    }

    if(!dp[xi + 1][yi - 1]) {
      q.push({xi, yi - 1});
      q.push({xi + 1, yi});
    }
  }
}

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

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      dp[i][j] = 1;
      di[i + j]++;
    }
  }

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


  int q; cin >> q;
  for(int i = 1; i <= q; i++) {
    int x, y; cin >> x >> y;

    int ok = 1;
    
    if(!dp[x][y]) {
      cout << 1 << '\n';
      continue;
    }

    if(di[x + y] == 1) {
      cout << 0 << '\n';
      continue;
    }

    cout << 1 << '\n';
    ishak(x, y);
  }
}
 
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;
} 

Compilation message

furniture.cpp: In function 'void solve_()':
furniture.cpp:148:9: warning: unused variable 'ok' [-Wunused-variable]
  148 |     int ok = 1;
      |         ^~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 3 ms 984 KB Output is correct
4 Correct 2 ms 1160 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 1236 KB Output is correct
7 Correct 4 ms 1236 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 3 ms 984 KB Output is correct
4 Correct 2 ms 1160 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 1236 KB Output is correct
7 Correct 4 ms 1236 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 120 ms 12548 KB Output is correct
13 Correct 53 ms 9648 KB Output is correct
14 Correct 205 ms 13160 KB Output is correct
15 Correct 218 ms 13164 KB Output is correct
16 Correct 219 ms 13428 KB Output is correct
17 Correct 205 ms 19452 KB Output is correct
18 Correct 219 ms 18908 KB Output is correct
19 Correct 226 ms 19724 KB Output is correct
20 Correct 240 ms 19780 KB Output is correct
21 Correct 221 ms 19724 KB Output is correct