oj.uz

답안 #915106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915106 2024-01-23T11:03:34 Z cig32 Furniture (JOI20_furniture) C++17
0 / 100
 3 ms 2396 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
const int MAXN = 5e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
  char *stack, *send;
  stack = (char *)malloc(stsize);
  send = stack + stsize - 16;
  send = (char *)((uintptr_t)send / 16 * 16);
  asm volatile(
    "mov %%rsp, (%0)\n"
    "mov %0, %%rsp\n"
    :
    : "r"(send));
  func();
  asm volatile("mov (%0), %%rsp\n" : : "r"(send));
  free(stack);
}
int dsu[1000002];
int set_of(int u) {
  if(dsu[u] == u) return u;
  return dsu[u] = set_of(dsu[u]);
}
void union_(int u, int v) {
  dsu[set_of(u)] = set_of(v); 
}
void solve(int tc) {
  int n, m;
  cin >> n >> m;
  int c[n][m];
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      cin >> c[i][j];
    }
  }
  int q;
  cin >> q;
  int x[q], y[q];
  for(int i=0; i<q; i++) {
    cin >> x[i] >> y[i];
    x[i]--;
    y[i]--;
    c[x[i]][y[i]] = 2 + i;
  }
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      if(c[i][j] == 0) c[i][j] = MOD;
    }
  }
  int lb = 0, rb = MOD;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    int give[n][m];
    for(int i=0; i<n; i++) {
      for(int j=0; j<m; j++) {
        give[i][j] = (c[i][j] >= mid);
      }
    }
    int dp[n][m];
    for(int i=0; i<n; i++) {
      for(int j=0; j<m; j++) {
        dp[i][j] = give[i][j];
        if(i > 0 && j > 0) dp[i][j] &= (dp[i-1][j] || dp[i][j-1]);
        else if(i > 0) dp[i][j] &= dp[i-1][j];
        else if(j > 0) dp[i][j] &= dp[i][j-1];
      }
    }
    if(dp[n-1][m-1]) lb = mid;
    else rb = mid - 1;
  }
  int k = lb;
  int give[n][m];
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      give[i][j] = (c[i][j] >= k);
    }
  }
  int dp[n][m];
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      dp[i][j] = give[i][j];
      if(i > 0 && j > 0) dp[i][j] &= (dp[i-1][j] || dp[i][j-1]);
      else if(i > 0) dp[i][j] &= dp[i-1][j];
      else if(j > 0) dp[i][j] &= dp[i][j-1];
    }
  }
  int R = n-1, C = m-1;
  int good[n][m];
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      good[i][j] = 0;
    }
  }
  good[n-1][m-1] = 1;
  for(int i=0; i<n+m-2; i++) {
    if(R > 0 && dp[R-1][C] == 1) {
      R--;
      good[R][C] = 1;
    }
    else {
      C--;
      good[R][C] = 1;
    }
  }
  for(int i=0; i<q; i++) {
    cout << (good[x[i]][y[i]] ^ 1) << '\n';
  }

}
void uwu() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t; 
  for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
  #ifdef ONLINE_JUDGE
  uwu();
  #endif
  #ifndef ONLINE_JUDGE
  run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
  #endif
}
/*
g++ C.cpp -std=c++17 -O2 -o C
./C < input.txt
*/

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 3 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 3 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -