oj.uz

답안 #836131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
836131 2023-08-24T07:48:22 Z 089487 Sirtet (CCO19_day1problem2) C++14
16 / 25
 149 ms 123168 KB 
#include<bits/stdc++.h>
#define int long long
#define Get(i,j) ((i-1)*m+j)
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=1e6+7;
const int INF=1e18;
int lp[N];
int lk[N];
int p[N];
int sz[N];
int add[N];
void init(int n){
    rep(i,1,n) p[i]=i,sz[i]=1,add[i]=INF,sz[i]=1;
}
int fp(int x){
    if(p[x]!=x) p[x]=fp(p[x]);
    return p[x];
}
void Union(int a,int b){
    a=fp(a),b=fp(b);
    if(sz[a]<sz[b]) swap(a,b);
    p[b]=a;
    sz[a]+=sz[b];
}
signed main(){
	quick
    double st=clock();
    int n,m;
    cin>>n>>m;
    vector<vector<bool> > v(n+5,vector<bool>(m+1));
    vector<vector<int> > f(n+5,vector<int>(m+1));
    init(n*m);
    rep(i,1,n){
        rep(j,1,m){
            char c;
            cin>>c;
            v[i][j]=(c=='#');
        }
    }
    rep(i,1,n){
        rep(j,1,m){
            if(!v[i][j]) continue;
            if(v[i-1][j]) Union(Get(i,j),Get(i-1,j));
            if(v[i][j-1]) Union(Get(i,j),Get(i,j-1));
        }
    }
    
    vector<pii> traverse;
    rep(t,1,3){
        rep(i,1,m) lp[i]=n+1,lk[i]=0;
        repd(i,n,1){
            rep(j,1,m) {
                if(!v[i][j]) continue;
                int k=fp(Get(i,j));
                add[k]=min(add[k],lp[j]+add[lk[j]]-i-1);
                lp[j]=i,lk[j]=k;
            }
        }
    }
    
    vector<vector<bool> > ans(n+5,vector<bool>(m+1));
    rep(i,1,n){
        rep(j,1,m){
            if(v[i][j]){
                int k=fp(Get(i,j));
                ans[i+add[k]][j]=1;
            }
        }
    }
    rep(i,1,n){
        rep(j,1,m) cout<<".#"[ans[i][j]];cout<<"\n";
        
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:5:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    5 | #define rep(x,a,b) for(int x=a;x<=b;x++)
      |                    ^~~
Main.cpp:89:9: note: in expansion of macro 'rep'
   89 |         rep(j,1,m) cout<<".#"[ans[i][j]];cout<<"\n";
      |         ^~~
Main.cpp:89:42: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   89 |         rep(j,1,m) cout<<".#"[ans[i][j]];cout<<"\n";
      |                                          ^~~~
Main.cpp:45:12: warning: unused variable 'st' [-Wunused-variable]
   45 |     double st=clock();
      |            ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 356 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 123136 KB Output is correct
2 Correct 149 ms 123168 KB Output is correct
3 Correct 147 ms 123084 KB Output is correct
4 Correct 144 ms 123152 KB Output is correct
5 Correct 130 ms 123092 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 356 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 148 ms 123136 KB Output is correct
25 Correct 149 ms 123168 KB Output is correct
26 Correct 147 ms 123084 KB Output is correct
27 Correct 144 ms 123152 KB Output is correct
28 Correct 130 ms 123092 KB Output is correct
29 Correct 52 ms 32432 KB Output is correct
30 Correct 52 ms 32428 KB Output is correct
31 Correct 49 ms 31184 KB Output is correct
32 Correct 29 ms 18684 KB Output is correct
33 Correct 65 ms 32332 KB Output is correct
34 Correct 70 ms 33148 KB Output is correct
35 Correct 58 ms 33156 KB Output is correct
36 Correct 62 ms 33160 KB Output is correct
37 Correct 56 ms 33160 KB Output is correct
38 Correct 59 ms 33160 KB Output is correct
39 Correct 50 ms 33432 KB Output is correct
40 Correct 56 ms 33052 KB Output is correct
41 Correct 60 ms 33012 KB Output is correct
42 Correct 60 ms 33020 KB Output is correct
43 Correct 54 ms 33052 KB Output is correct
44 Correct 55 ms 33076 KB Output is correct
45 Correct 47 ms 33056 KB Output is correct
46 Correct 60 ms 33060 KB Output is correct
47 Correct 53 ms 33080 KB Output is correct
48 Correct 65 ms 34808 KB Output is correct
49 Correct 59 ms 33040 KB Output is correct
50 Correct 71 ms 32016 KB Output is correct
51 Correct 85 ms 50632 KB Output is correct
52 Correct 103 ms 50700 KB Output is correct
53 Correct 81 ms 50688 KB Output is correct
54 Correct 86 ms 50636 KB Output is correct
55 Correct 95 ms 34396 KB Output is correct
56 Correct 77 ms 34476 KB Output is correct
57 Correct 57 ms 34380 KB Output is correct
58 Correct 68 ms 34392 KB Output is correct
59 Correct 70 ms 33064 KB Output is correct
60 Incorrect 68 ms 32964 KB Output isn't correct
61 Halted 0 ms 0 KB -