oj.uz

Submission #836134

# Submission time Handle Problem Language Result Execution time Memory
836134 2023-08-24T07:50:27 Z 089487 Sirtet (CCO19_day1problem2) C++14
25 / 25
 199 ms 123364 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,10){
        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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 324 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 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 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 332 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 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 123200 KB Output is correct
2 Correct 183 ms 123292 KB Output is correct
3 Correct 199 ms 123364 KB Output is correct
4 Correct 193 ms 123176 KB Output is correct
5 Correct 165 ms 123300 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 324 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 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 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 332 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 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 181 ms 123200 KB Output is correct
25 Correct 183 ms 123292 KB Output is correct
26 Correct 199 ms 123364 KB Output is correct
27 Correct 193 ms 123176 KB Output is correct
28 Correct 165 ms 123300 KB Output is correct
29 Correct 72 ms 32568 KB Output is correct
30 Correct 74 ms 32516 KB Output is correct
31 Correct 62 ms 31204 KB Output is correct
32 Correct 38 ms 18852 KB Output is correct
33 Correct 75 ms 32480 KB Output is correct
34 Correct 77 ms 33276 KB Output is correct
35 Correct 78 ms 33300 KB Output is correct
36 Correct 83 ms 33348 KB Output is correct
37 Correct 72 ms 33288 KB Output is correct
38 Correct 72 ms 33352 KB Output is correct
39 Correct 80 ms 33476 KB Output is correct
40 Correct 82 ms 33160 KB Output is correct
41 Correct 82 ms 33116 KB Output is correct
42 Correct 86 ms 33176 KB Output is correct
43 Correct 72 ms 33140 KB Output is correct
44 Correct 76 ms 33164 KB Output is correct
45 Correct 62 ms 33188 KB Output is correct
46 Correct 81 ms 33180 KB Output is correct
47 Correct 72 ms 33104 KB Output is correct
48 Correct 93 ms 35032 KB Output is correct
49 Correct 72 ms 33212 KB Output is correct
50 Correct 92 ms 32160 KB Output is correct
51 Correct 126 ms 50804 KB Output is correct
52 Correct 158 ms 50792 KB Output is correct
53 Correct 115 ms 50792 KB Output is correct
54 Correct 141 ms 50824 KB Output is correct
55 Correct 183 ms 34540 KB Output is correct
56 Correct 142 ms 34540 KB Output is correct
57 Correct 76 ms 34552 KB Output is correct
58 Correct 116 ms 34580 KB Output is correct
59 Correct 119 ms 33112 KB Output is correct
60 Correct 97 ms 33220 KB Output is correct
61 Correct 62 ms 38800 KB Output is correct
62 Correct 80 ms 35908 KB Output is correct
63 Correct 84 ms 33308 KB Output is correct
64 Correct 60 ms 35932 KB Output is correct
65 Correct 73 ms 41864 KB Output is correct
66 Correct 78 ms 33324 KB Output is correct
67 Correct 85 ms 70668 KB Output is correct
68 Correct 67 ms 47896 KB Output is correct
69 Correct 100 ms 70628 KB Output is correct
70 Correct 63 ms 42804 KB Output is correct