oj.uz

답안 #571789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571789 2022-06-02T18:01:36 Z Vanilla Furniture (JOI20_furniture) C++17
100 / 100
 228 ms 13968 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 1e3 + 2;
int diag[maxn * 2];
bool a [maxn][maxn];
bool reach [maxn][maxn];

void solve(int id){
    
    return;
}

void prop (int x, int y) {
    diag[x + y]--;
    reach[x][y] = 0;
    if (!reach[x + 1][y-1] && reach[x + 1][y]) prop(x + 1, y);
    if (!reach[x + 1][y-1] && reach[x][y-1]) prop(x, y - 1);
    if (!reach[x - 1][y+1] && reach[x][y + 1]) prop(x, y + 1);
    if (!reach[x-1][y + 1] && reach[x-1][y]) prop(x-1, y);
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    int n,m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++){
            reach[i][j] = 1;
            diag[i+j]++;
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cin >> a[i][j];
            if (a[i][j] && reach[i][j]) prop(i,j);
        }
    }
    int q;
    cin >> q;
    while (q--) {
        int x,y;
        cin >> x >> y;
        if (!reach[x][y]) {
            cout << "1\n";
        }
        else if (diag[x + y] == 1) {
            cout << "0\n";
        }
        else {
            cout << "1\n";
            prop(x,y);
        }
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 4 ms 624 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 596 KB Output is correct

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 4 ms 624 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 111 ms 6896 KB Output is correct
13 Correct 59 ms 4044 KB Output is correct
14 Correct 213 ms 11716 KB Output is correct
15 Correct 192 ms 12052 KB Output is correct
16 Correct 228 ms 12876 KB Output is correct
17 Correct 217 ms 13588 KB Output is correct
18 Correct 217 ms 13104 KB Output is correct
19 Correct 221 ms 13968 KB Output is correct
20 Correct 216 ms 13900 KB Output is correct
21 Correct 225 ms 13936 KB Output is correct