oj.uz

답안 #255779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255779 2020-08-01T20:23:11 Z mehrdad_sohrabi 다리 (APIO19_bridges) C++14
46 / 100
 3000 ms 22172 KB 
#include <bits/stdc++.h>
typedef int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
//#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=5e4+100,sq=500;
vector <pair <int,pii > > yy,yal[N*4];
bool vis[N*2];
bool vis2[N*2];
ll par[N],sz[N];
ll getpar(ll v){
    if (par[v]==v) return v;
    return par[v]=getpar(par[v]);
}
inline void mrg(ll v,ll u){
    ll u1=getpar(u),v1=getpar(v);
    if (u1==v1) return ;
    if (sz[u1]>sz[v1])swap(u1,v1);
    par[u1]=v1;
    sz[v1]+=sz[u1];
}
ll pp[N],zz[N];
ll gg(ll v){
    if (pp[v]==v) return v;
    return pp[v]=gg(pp[v]);
}
inline void merg(ll v,ll u){
    ll v1=gg(v),u1=gg(u);
    if (v1==u1) return ;
    if (zz[u1]>zz[v1]) swap(v1,u1);
    pp[u1]=v1;
    zz[v1]+=zz[u1];
}
ll ans[N*2];
vector <pair <int,pii> > q;
vector <int> com;
map <int,int> mp;

int32_t main(){
    sync;
    ll n,m;
    scanf("%d %d",&n,&m);
    for (int i=1;i<=m;i++){
        ll u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        com.pb(w);
        yy.pb({w,{u,v}});
    }
    ll q1;
    scanf("%d",&q1);
    while(q1--){
        ll u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        com.pb(w);
        q.pb({u,{v,w}});
    }
    sort(com.begin(),com.end());
    for (int i=0;i<com.size();i++) mp[com[i]]=i;
    for (int i=0;i<yy.size();i++){
        yy[i].F=mp[yy[i].F];
    }
    for (int i=0;i<q.size();i++){
        q[i].S.S=mp[q[i].S.S];
    }
    for (int i=0;i<q.size();i+=sq){
        memset(vis,0,sizeof vis);
        memset(vis2,0,sizeof vis2);
        vector <pii> g;
        for (int j=i;j<min(i+sq,(int)q.size());j++){
            if (q[j].F==1) vis[q[j].S.F-1]=1;
            else{
                g.pb({q[j].S.S,j});
            }
        }
        memset(par,0,sizeof par);
        memset(sz,0,sizeof sz);
        for (int j=1;j<=n;j++){
            sz[j]=1;
            par[j]=j;
        }
        for (int i=0;i<N*4;i++) yal[i].clear();
        for (int j=0;j<yy.size();j++){
            if (vis[j]) continue;
            yal[yy[j].F].pb(yy[j]);
        }
        sort(g.begin(),g.end());
        reverse(g.begin(),g.end());
        ll cnt=0;
        for (int j=N*4-1;j>-1;j--){
            while(cnt<g.size() && g[cnt].F>j){
                for (int k=i;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F==1){
                        vis2[q[k].S.F-1]=0;
                        ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                        pp[v]=getpar(v);
                        pp[u]=getpar(u);
                        zz[pp[v]]=sz[pp[v]];
                        zz[pp[u]]=sz[pp[u]];
                        pp[pp[v]]=pp[v];
                        pp[pp[u]]=pp[u];
                    }
                    else{
                        ll v=q[k].S.F;
                        pp[v]=getpar(v);
                        zz[pp[v]]=sz[pp[v]];
                        pp[pp[v]]=pp[v];
                    }
                }
                ll id=g[cnt].S;
                for (int k=id;k>=i;k--){
                    if (q[k].F==2) continue;
                    ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                    if (vis2[q[k].S.F-1]) continue;
                    vis2[q[k].S.F-1]=1;
                    if (q[k].S.S>=g[cnt].F){
                        merg(u,v);
                    }
                }
                for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F==2) continue;
                    ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                    if (vis2[q[k].S.F-1]) continue;
                    vis2[q[k].S.F-1]=1;
                    if (yy[q[k].S.F-1].F>=g[cnt].F){
                        merg(u,v);
                    }
                }
                ans[id]=zz[gg(q[id].S.F)];
                cnt++;
            }
            for (int jj=0;jj<yal[j].size();jj++){
                mrg(yal[j][jj].S.F,yal[j][jj].S.S);
            }
        }
        while(cnt<g.size()){
                for (int k=i;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F==1){
                        vis2[q[k].S.F-1]=0;
                        ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                        pp[v]=getpar(v);
                        pp[u]=getpar(u);
                        zz[pp[v]]=sz[pp[v]];
                        zz[pp[u]]=sz[pp[u]];
                        pp[pp[u]]=pp[u];
                        pp[pp[v]]=pp[v];
                    }
                    else{
                        ll v=q[k].S.F;
                        pp[v]=getpar(v);
                        zz[pp[v]]=sz[pp[v]];
                        pp[pp[v]]=pp[v];
                    }
                }
                ll id=g[cnt].S;
                for (int k=id;k>=i;k--){
                    if (q[k].F==2) continue;
                    ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                    if (vis2[q[k].S.F-1]) continue;
                    vis2[q[k].S.F-1]=1;
                    if (q[k].S.S>=g[cnt].F){
                        merg(u,v);
                    }
                }
                for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F==2) continue;
                    ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
                    if (vis2[q[k].S.F-1]) continue;
                    vis2[q[k].S.F-1]=1;
                    if (yy[q[k].S.F-1].F>=g[cnt].F){
                        merg(u,v);
                    }
                }
                ans[id]=zz[gg(q[id].S.F)];
                cnt++;
        }
        for (int j=i;j<(min(i+sq,(ll)q.size()));j++){
            if (q[j].F==1){
                yy[q[j].S.F-1].F=q[j].S.S;
            }
        }
    }
    for (int i=0;i<q.size();i++){
        if (q[i].F==2)
        printf("%d \n",ans[i]);
    }
}

Compilation message

bridges.cpp: In function 'int32_t main()':
bridges.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<com.size();i++) mp[com[i]]=i;
                  ~^~~~~~~~~~~
bridges.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<yy.size();i++){
                  ~^~~~~~~~~~
bridges.cpp:70:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<q.size();i++){
                  ~^~~~~~~~~
bridges.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<q.size();i+=sq){
                  ~^~~~~~~~~
bridges.cpp:90:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j=0;j<yy.size();j++){
                      ~^~~~~~~~~~
bridges.cpp:98:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(cnt<g.size() && g[cnt].F>j){
                   ~~~^~~~~~~~~
bridges.cpp:139:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int jj=0;jj<yal[j].size();jj++){
                           ~~^~~~~~~~~~~~~~
bridges.cpp:143:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(cnt<g.size()){
               ~~~^~~~~~~~~
bridges.cpp:190:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<q.size();i++){
                  ~^~~~~~~~~
bridges.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
bridges.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&u,&v,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~
bridges.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q1);
     ~~~~~^~~~~~~~~~
bridges.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&u,&v,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5632 KB Output is correct
2 Correct 5 ms 5632 KB Output is correct
3 Correct 87 ms 6624 KB Output is correct
4 Correct 52 ms 6400 KB Output is correct
5 Correct 79 ms 6272 KB Output is correct
6 Correct 71 ms 6016 KB Output is correct
7 Correct 72 ms 6152 KB Output is correct
8 Correct 74 ms 6356 KB Output is correct
9 Correct 76 ms 5980 KB Output is correct
10 Correct 79 ms 6484 KB Output is correct
11 Correct 79 ms 6388 KB Output is correct
12 Correct 82 ms 6364 KB Output is correct
13 Correct 83 ms 6496 KB Output is correct
14 Correct 80 ms 6496 KB Output is correct
15 Correct 82 ms 6368 KB Output is correct
16 Correct 75 ms 5980 KB Output is correct
17 Correct 83 ms 6100 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2727 ms 19360 KB Output is correct
2 Correct 2571 ms 19260 KB Output is correct
3 Correct 2331 ms 19136 KB Output is correct
4 Correct 2416 ms 19328 KB Output is correct
5 Correct 2449 ms 19356 KB Output is correct
6 Correct 2440 ms 18508 KB Output is correct
7 Correct 2510 ms 18708 KB Output is correct
8 Correct 2531 ms 19032 KB Output is correct
9 Correct 520 ms 12712 KB Output is correct
10 Correct 1400 ms 10292 KB Output is correct
11 Correct 1373 ms 10532 KB Output is correct
12 Correct 2054 ms 17508 KB Output is correct
13 Correct 1913 ms 20260 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2008 ms 17444 KB Output is correct
2 Correct 1199 ms 13580 KB Output is correct
3 Correct 2073 ms 16348 KB Output is correct
4 Correct 2158 ms 17444 KB Output is correct
5 Correct 533 ms 12712 KB Output is correct
6 Correct 1887 ms 17696 KB Output is correct
7 Correct 1740 ms 17648 KB Output is correct
8 Correct 1750 ms 17440 KB Output is correct
9 Correct 1765 ms 16676 KB Output is correct
10 Correct 1797 ms 16292 KB Output is correct
11 Correct 1238 ms 18468 KB Output is correct
12 Correct 1176 ms 18596 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3080 ms 22172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2727 ms 19360 KB Output is correct
2 Correct 2571 ms 19260 KB Output is correct
3 Correct 2331 ms 19136 KB Output is correct
4 Correct 2416 ms 19328 KB Output is correct
5 Correct 2449 ms 19356 KB Output is correct
6 Correct 2440 ms 18508 KB Output is correct
7 Correct 2510 ms 18708 KB Output is correct
8 Correct 2531 ms 19032 KB Output is correct
9 Correct 520 ms 12712 KB Output is correct
10 Correct 1400 ms 10292 KB Output is correct
11 Correct 1373 ms 10532 KB Output is correct
12 Correct 2054 ms 17508 KB Output is correct
13 Correct 1913 ms 20260 KB Output is correct
14 Correct 2008 ms 17444 KB Output is correct
15 Correct 1199 ms 13580 KB Output is correct
16 Correct 2073 ms 16348 KB Output is correct
17 Correct 2158 ms 17444 KB Output is correct
18 Correct 533 ms 12712 KB Output is correct
19 Correct 1887 ms 17696 KB Output is correct
20 Correct 1740 ms 17648 KB Output is correct
21 Correct 1750 ms 17440 KB Output is correct
22 Correct 1765 ms 16676 KB Output is correct
23 Correct 1797 ms 16292 KB Output is correct
24 Correct 1238 ms 18468 KB Output is correct
25 Correct 1176 ms 18596 KB Output is correct
26 Correct 2665 ms 19272 KB Output is correct
27 Correct 2644 ms 18216 KB Output is correct
28 Correct 2622 ms 19412 KB Output is correct
29 Correct 2432 ms 19296 KB Output is correct
30 Correct 2751 ms 18704 KB Output is correct
31 Correct 2697 ms 18440 KB Output is correct
32 Execution timed out 3019 ms 18420 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5632 KB Output is correct
2 Correct 5 ms 5632 KB Output is correct
3 Correct 87 ms 6624 KB Output is correct
4 Correct 52 ms 6400 KB Output is correct
5 Correct 79 ms 6272 KB Output is correct
6 Correct 71 ms 6016 KB Output is correct
7 Correct 72 ms 6152 KB Output is correct
8 Correct 74 ms 6356 KB Output is correct
9 Correct 76 ms 5980 KB Output is correct
10 Correct 79 ms 6484 KB Output is correct
11 Correct 79 ms 6388 KB Output is correct
12 Correct 82 ms 6364 KB Output is correct
13 Correct 83 ms 6496 KB Output is correct
14 Correct 80 ms 6496 KB Output is correct
15 Correct 82 ms 6368 KB Output is correct
16 Correct 75 ms 5980 KB Output is correct
17 Correct 83 ms 6100 KB Output is correct
18 Correct 2727 ms 19360 KB Output is correct
19 Correct 2571 ms 19260 KB Output is correct
20 Correct 2331 ms 19136 KB Output is correct
21 Correct 2416 ms 19328 KB Output is correct
22 Correct 2449 ms 19356 KB Output is correct
23 Correct 2440 ms 18508 KB Output is correct
24 Correct 2510 ms 18708 KB Output is correct
25 Correct 2531 ms 19032 KB Output is correct
26 Correct 520 ms 12712 KB Output is correct
27 Correct 1400 ms 10292 KB Output is correct
28 Correct 1373 ms 10532 KB Output is correct
29 Correct 2054 ms 17508 KB Output is correct
30 Correct 1913 ms 20260 KB Output is correct
31 Correct 2008 ms 17444 KB Output is correct
32 Correct 1199 ms 13580 KB Output is correct
33 Correct 2073 ms 16348 KB Output is correct
34 Correct 2158 ms 17444 KB Output is correct
35 Correct 533 ms 12712 KB Output is correct
36 Correct 1887 ms 17696 KB Output is correct
37 Correct 1740 ms 17648 KB Output is correct
38 Correct 1750 ms 17440 KB Output is correct
39 Correct 1765 ms 16676 KB Output is correct
40 Correct 1797 ms 16292 KB Output is correct
41 Correct 1238 ms 18468 KB Output is correct
42 Correct 1176 ms 18596 KB Output is correct
43 Execution timed out 3080 ms 22172 KB Time limit exceeded
44 Halted 0 ms 0 KB -