oj.uz

답안 #684870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684870 2023-01-22T17:53:18 Z alvingogo Furniture (JOI20_furniture) C++14
100 / 100
 291 ms 39640 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

int main(){
    AquA;
    int n,m;
    cin >> n >> m;
    vector<pair<int,int> > g;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int a;
            cin >> a;
            if(a){
                g.push_back({i,j});
            }
        }
    }
    int q;
    cin >> q;
    int u=g.size();
    for(int i=0;i<q;i++){
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        g.push_back({a,b});
    }
    vector<int> ans;
    const int dx[8]={1,1,1,0,-1,-1,-1,0},dy[8]={-1,0,1,1,1,0,-1,-1};
    vector<vector<int> > ok(n,vector<int>(m)),d1(n,vector<int>(m)),d2=d1;
    vector<int> cnt(n+m);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cnt[i+j]++;
            if(i+1<n){
                d1[i+1][j]++;
            }
            if(j+1<m){
                d1[i][j+1]++;
            }
            if(i-1>=0){
                d2[i-1][j]++;
            }
            if(j-1>=0){
                d2[i][j-1]++;
            }
        }
    }
    function<void(int,int)> del=[&](int x,int y){
        cnt[x+y]--;
        ok[x][y]=1;
        if(x+1<n && !ok[x+1][y]){
            d1[x+1][y]--;
            if(d1[x+1][y]==0){
                del(x+1,y);
            }
        }
        if(y+1<m && !ok[x][y+1]){
            d1[x][y+1]--;
            if(d1[x][y+1]==0){
                del(x,y+1);
            }
        }
        if(y-1>=0 && !ok[x][y-1]){
            d2[x][y-1]--;
            if(d2[x][y-1]==0){
                del(x,y-1);
            }
        }
        if(x-1>=0 && !ok[x-1][y]){
            d2[x-1][y]--;
            if(d2[x-1][y]==0){
                del(x-1,y);
            }
        }
    };
    for(auto h:g){
        if(ok[h.fs][h.sc]){
            ans.push_back(1);
            continue;
        }
        if(cnt[h.fs+h.sc]>1){
            ans.push_back(1);
            del(h.fs,h.sc);
        }
        else{
            ans.push_back(0);
        }
    }
    for(int i=u;i<u+q;i++){
        cout << ans[i] << "\n";
    }
    return 0;
}

Compilation message

furniture.cpp: In function 'int main()':
furniture.cpp:34:15: warning: unused variable 'dx' [-Wunused-variable]
   34 |     const int dx[8]={1,1,1,0,-1,-1,-1,0},dy[8]={-1,0,1,1,1,0,-1,-1};
      |               ^~
furniture.cpp:34:42: warning: unused variable 'dy' [-Wunused-variable]
   34 |     const int dx[8]={1,1,1,0,-1,-1,-1,0},dy[8]={-1,0,1,1,1,0,-1,-1};
      |                                          ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 10 ms 1752 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 154 ms 22244 KB Output is correct
13 Correct 67 ms 14448 KB Output is correct
14 Correct 243 ms 34608 KB Output is correct
15 Correct 271 ms 34348 KB Output is correct
16 Correct 250 ms 36744 KB Output is correct
17 Correct 291 ms 38536 KB Output is correct
18 Correct 255 ms 37676 KB Output is correct
19 Correct 273 ms 39628 KB Output is correct
20 Correct 259 ms 39632 KB Output is correct
21 Correct 285 ms 39640 KB Output is correct