oj.uz

Submission #992060

# Submission time Handle Problem Language Result Execution time Memory
992060 2024-06-03T17:33:24 Z Trisanu_Das Sirtet (CCO19_day1problem2) C++17
25 / 25
 149 ms 128084 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,4){
        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 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 128084 KB Output is correct
2 Correct 134 ms 127920 KB Output is correct
3 Correct 149 ms 128080 KB Output is correct
4 Correct 133 ms 128084 KB Output is correct
5 Correct 124 ms 128080 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct
24 Correct 136 ms 128084 KB Output is correct
25 Correct 134 ms 127920 KB Output is correct
26 Correct 149 ms 128080 KB Output is correct
27 Correct 133 ms 128084 KB Output is correct
28 Correct 124 ms 128080 KB Output is correct
29 Correct 53 ms 37224 KB Output is correct
30 Correct 55 ms 37232 KB Output is correct
31 Correct 48 ms 36948 KB Output is correct
32 Correct 28 ms 28760 KB Output is correct
33 Correct 57 ms 37204 KB Output is correct
34 Correct 58 ms 37512 KB Output is correct
35 Correct 60 ms 37716 KB Output is correct
36 Correct 52 ms 37524 KB Output is correct
37 Correct 55 ms 37716 KB Output is correct
38 Correct 52 ms 37504 KB Output is correct
39 Correct 49 ms 37716 KB Output is correct
40 Correct 54 ms 37460 KB Output is correct
41 Correct 56 ms 37388 KB Output is correct
42 Correct 59 ms 37460 KB Output is correct
43 Correct 49 ms 37316 KB Output is correct
44 Correct 51 ms 37460 KB Output is correct
45 Correct 39 ms 37408 KB Output is correct
46 Correct 56 ms 37408 KB Output is correct
47 Correct 49 ms 37460 KB Output is correct
48 Correct 56 ms 39324 KB Output is correct
49 Correct 55 ms 37460 KB Output is correct
50 Correct 63 ms 37204 KB Output is correct
51 Correct 71 ms 55124 KB Output is correct
52 Correct 108 ms 55124 KB Output is correct
53 Correct 73 ms 55124 KB Output is correct
54 Correct 79 ms 55124 KB Output is correct
55 Correct 86 ms 38740 KB Output is correct
56 Correct 72 ms 38740 KB Output is correct
57 Correct 51 ms 38884 KB Output is correct
58 Correct 68 ms 38740 KB Output is correct
59 Correct 67 ms 37460 KB Output is correct
60 Correct 63 ms 37460 KB Output is correct
61 Correct 47 ms 41284 KB Output is correct
62 Correct 50 ms 39200 KB Output is correct
63 Correct 54 ms 37460 KB Output is correct
64 Correct 40 ms 39376 KB Output is correct
65 Correct 51 ms 46056 KB Output is correct
66 Correct 39 ms 37408 KB Output is correct
67 Correct 64 ms 74908 KB Output is correct
68 Correct 55 ms 52052 KB Output is correct
69 Correct 69 ms 74836 KB Output is correct
70 Correct 48 ms 46932 KB Output is correct