답안 #255781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255781 2020-08-01T20:25:57 Z mehrdad_sohrabi 다리 (APIO19_bridges) C++14
46 / 100
3000 ms 22488 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=700;
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);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5632 KB Output is correct
2 Correct 6 ms 5632 KB Output is correct
3 Correct 115 ms 6568 KB Output is correct
4 Correct 66 ms 6392 KB Output is correct
5 Correct 87 ms 6272 KB Output is correct
6 Correct 84 ms 6136 KB Output is correct
7 Correct 83 ms 6104 KB Output is correct
8 Correct 86 ms 6356 KB Output is correct
9 Correct 79 ms 5980 KB Output is correct
10 Correct 87 ms 6364 KB Output is correct
11 Correct 97 ms 6484 KB Output is correct
12 Correct 89 ms 6364 KB Output is correct
13 Correct 97 ms 6368 KB Output is correct
14 Correct 97 ms 6368 KB Output is correct
15 Correct 94 ms 6368 KB Output is correct
16 Correct 84 ms 5980 KB Output is correct
17 Correct 87 ms 5980 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2784 ms 19236 KB Output is correct
2 Correct 2455 ms 19468 KB Output is correct
3 Correct 2530 ms 19108 KB Output is correct
4 Correct 2570 ms 19412 KB Output is correct
5 Correct 2636 ms 19192 KB Output is correct
6 Correct 2907 ms 18348 KB Output is correct
7 Correct 2802 ms 18908 KB Output is correct
8 Correct 2830 ms 19336 KB Output is correct
9 Correct 566 ms 12664 KB Output is correct
10 Correct 1722 ms 10276 KB Output is correct
11 Correct 1646 ms 10268 KB Output is correct
12 Correct 2239 ms 17752 KB Output is correct
13 Correct 1750 ms 20460 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2196 ms 17444 KB Output is correct
2 Correct 1476 ms 14080 KB Output is correct
3 Correct 2036 ms 16388 KB Output is correct
4 Correct 2016 ms 17572 KB Output is correct
5 Correct 548 ms 12712 KB Output is correct
6 Correct 2218 ms 17572 KB Output is correct
7 Correct 1988 ms 17444 KB Output is correct
8 Correct 1967 ms 17428 KB Output is correct
9 Correct 1891 ms 16500 KB Output is correct
10 Correct 1801 ms 16400 KB Output is correct
11 Correct 1280 ms 18468 KB Output is correct
12 Correct 1263 ms 18592 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3060 ms 22488 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2784 ms 19236 KB Output is correct
2 Correct 2455 ms 19468 KB Output is correct
3 Correct 2530 ms 19108 KB Output is correct
4 Correct 2570 ms 19412 KB Output is correct
5 Correct 2636 ms 19192 KB Output is correct
6 Correct 2907 ms 18348 KB Output is correct
7 Correct 2802 ms 18908 KB Output is correct
8 Correct 2830 ms 19336 KB Output is correct
9 Correct 566 ms 12664 KB Output is correct
10 Correct 1722 ms 10276 KB Output is correct
11 Correct 1646 ms 10268 KB Output is correct
12 Correct 2239 ms 17752 KB Output is correct
13 Correct 1750 ms 20460 KB Output is correct
14 Correct 2196 ms 17444 KB Output is correct
15 Correct 1476 ms 14080 KB Output is correct
16 Correct 2036 ms 16388 KB Output is correct
17 Correct 2016 ms 17572 KB Output is correct
18 Correct 548 ms 12712 KB Output is correct
19 Correct 2218 ms 17572 KB Output is correct
20 Correct 1988 ms 17444 KB Output is correct
21 Correct 1967 ms 17428 KB Output is correct
22 Correct 1891 ms 16500 KB Output is correct
23 Correct 1801 ms 16400 KB Output is correct
24 Correct 1280 ms 18468 KB Output is correct
25 Correct 1263 ms 18592 KB Output is correct
26 Correct 2638 ms 19188 KB Output is correct
27 Correct 2765 ms 18100 KB Output is correct
28 Correct 2655 ms 19356 KB Output is correct
29 Correct 2418 ms 19288 KB Output is correct
30 Correct 2931 ms 18600 KB Output is correct
31 Correct 2876 ms 18428 KB Output is correct
32 Correct 2941 ms 18816 KB Output is correct
33 Execution timed out 3036 ms 19156 KB Time limit exceeded
34 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5632 KB Output is correct
2 Correct 6 ms 5632 KB Output is correct
3 Correct 115 ms 6568 KB Output is correct
4 Correct 66 ms 6392 KB Output is correct
5 Correct 87 ms 6272 KB Output is correct
6 Correct 84 ms 6136 KB Output is correct
7 Correct 83 ms 6104 KB Output is correct
8 Correct 86 ms 6356 KB Output is correct
9 Correct 79 ms 5980 KB Output is correct
10 Correct 87 ms 6364 KB Output is correct
11 Correct 97 ms 6484 KB Output is correct
12 Correct 89 ms 6364 KB Output is correct
13 Correct 97 ms 6368 KB Output is correct
14 Correct 97 ms 6368 KB Output is correct
15 Correct 94 ms 6368 KB Output is correct
16 Correct 84 ms 5980 KB Output is correct
17 Correct 87 ms 5980 KB Output is correct
18 Correct 2784 ms 19236 KB Output is correct
19 Correct 2455 ms 19468 KB Output is correct
20 Correct 2530 ms 19108 KB Output is correct
21 Correct 2570 ms 19412 KB Output is correct
22 Correct 2636 ms 19192 KB Output is correct
23 Correct 2907 ms 18348 KB Output is correct
24 Correct 2802 ms 18908 KB Output is correct
25 Correct 2830 ms 19336 KB Output is correct
26 Correct 566 ms 12664 KB Output is correct
27 Correct 1722 ms 10276 KB Output is correct
28 Correct 1646 ms 10268 KB Output is correct
29 Correct 2239 ms 17752 KB Output is correct
30 Correct 1750 ms 20460 KB Output is correct
31 Correct 2196 ms 17444 KB Output is correct
32 Correct 1476 ms 14080 KB Output is correct
33 Correct 2036 ms 16388 KB Output is correct
34 Correct 2016 ms 17572 KB Output is correct
35 Correct 548 ms 12712 KB Output is correct
36 Correct 2218 ms 17572 KB Output is correct
37 Correct 1988 ms 17444 KB Output is correct
38 Correct 1967 ms 17428 KB Output is correct
39 Correct 1891 ms 16500 KB Output is correct
40 Correct 1801 ms 16400 KB Output is correct
41 Correct 1280 ms 18468 KB Output is correct
42 Correct 1263 ms 18592 KB Output is correct
43 Execution timed out 3060 ms 22488 KB Time limit exceeded
44 Halted 0 ms 0 KB -