답안 #255791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255791 2020-08-01T20:47:40 Z mehrdad_sohrabi 다리 (APIO19_bridges) C++14
59 / 100
3000 ms 15696 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+2,sq=500;
vector <pair <int,pii > > yy,yal;
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());
    com.resize(unique(com.begin(),com.end())-com.begin());
    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){
        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;
        }
        yal.clear();
        for (int j=0;j<yy.size();j++){
            if (vis[j]) continue;
            yal.pb(yy[j]);
        }
        sort(yal.begin(),yal.end());
        sort(g.begin(),g.end());
        reverse(g.begin(),g.end());
        ll cnt=0;
        for (int j=yal.size()-1;j>-1;j--){
            while(cnt<g.size() && g[cnt].F>yal[j].F){
                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].S.F,yal[j].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;
                vis[q[j].S.F-1]=0;
            }

        }
    }
    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:67: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:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<yy.size();i++){
                  ~^~~~~~~~~~
bridges.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<q.size();i++){
                  ~^~~~~~~~~
bridges.cpp:74:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<q.size();i+=sq){
                  ~^~~~~~~~~
bridges.cpp:89: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>yal[j].F){
                   ~~~^~~~~~~~~
bridges.cpp:143:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(cnt<g.size()){
               ~~~^~~~~~~~~
bridges.cpp:192: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 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 64 ms 1512 KB Output is correct
4 Correct 33 ms 1528 KB Output is correct
5 Correct 55 ms 1528 KB Output is correct
6 Correct 55 ms 1152 KB Output is correct
7 Correct 50 ms 1116 KB Output is correct
8 Correct 55 ms 1372 KB Output is correct
9 Correct 51 ms 1244 KB Output is correct
10 Correct 56 ms 1552 KB Output is correct
11 Correct 55 ms 1496 KB Output is correct
12 Correct 56 ms 1492 KB Output is correct
13 Correct 63 ms 1496 KB Output is correct
14 Correct 63 ms 1496 KB Output is correct
15 Correct 63 ms 1484 KB Output is correct
16 Correct 48 ms 1116 KB Output is correct
17 Correct 50 ms 1116 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2208 ms 12540 KB Output is correct
2 Correct 2215 ms 12772 KB Output is correct
3 Correct 2242 ms 12708 KB Output is correct
4 Correct 2223 ms 12648 KB Output is correct
5 Correct 2237 ms 12680 KB Output is correct
6 Correct 2506 ms 11728 KB Output is correct
7 Correct 2456 ms 12184 KB Output is correct
8 Correct 2471 ms 12324 KB Output is correct
9 Correct 344 ms 7720 KB Output is correct
10 Correct 1969 ms 5708 KB Output is correct
11 Correct 2019 ms 5884 KB Output is correct
12 Correct 2239 ms 12504 KB Output is correct
13 Correct 1650 ms 12576 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1769 ms 10708 KB Output is correct
2 Correct 1033 ms 7436 KB Output is correct
3 Correct 1712 ms 9728 KB Output is correct
4 Correct 1691 ms 10896 KB Output is correct
5 Correct 335 ms 7844 KB Output is correct
6 Correct 1726 ms 10824 KB Output is correct
7 Correct 1644 ms 11088 KB Output is correct
8 Correct 1623 ms 10844 KB Output is correct
9 Correct 1623 ms 11172 KB Output is correct
10 Correct 1515 ms 11044 KB Output is correct
11 Correct 1099 ms 10656 KB Output is correct
12 Correct 1091 ms 10880 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3074 ms 15696 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2208 ms 12540 KB Output is correct
2 Correct 2215 ms 12772 KB Output is correct
3 Correct 2242 ms 12708 KB Output is correct
4 Correct 2223 ms 12648 KB Output is correct
5 Correct 2237 ms 12680 KB Output is correct
6 Correct 2506 ms 11728 KB Output is correct
7 Correct 2456 ms 12184 KB Output is correct
8 Correct 2471 ms 12324 KB Output is correct
9 Correct 344 ms 7720 KB Output is correct
10 Correct 1969 ms 5708 KB Output is correct
11 Correct 2019 ms 5884 KB Output is correct
12 Correct 2239 ms 12504 KB Output is correct
13 Correct 1650 ms 12576 KB Output is correct
14 Correct 1769 ms 10708 KB Output is correct
15 Correct 1033 ms 7436 KB Output is correct
16 Correct 1712 ms 9728 KB Output is correct
17 Correct 1691 ms 10896 KB Output is correct
18 Correct 335 ms 7844 KB Output is correct
19 Correct 1726 ms 10824 KB Output is correct
20 Correct 1644 ms 11088 KB Output is correct
21 Correct 1623 ms 10844 KB Output is correct
22 Correct 1623 ms 11172 KB Output is correct
23 Correct 1515 ms 11044 KB Output is correct
24 Correct 1099 ms 10656 KB Output is correct
25 Correct 1091 ms 10880 KB Output is correct
26 Correct 2244 ms 12576 KB Output is correct
27 Correct 2368 ms 11448 KB Output is correct
28 Correct 2324 ms 12780 KB Output is correct
29 Correct 2082 ms 12900 KB Output is correct
30 Correct 2478 ms 12424 KB Output is correct
31 Correct 2458 ms 12060 KB Output is correct
32 Correct 2437 ms 11980 KB Output is correct
33 Correct 2348 ms 12736 KB Output is correct
34 Correct 2335 ms 12964 KB Output is correct
35 Correct 2337 ms 12640 KB Output is correct
36 Correct 2182 ms 12572 KB Output is correct
37 Correct 2145 ms 12504 KB Output is correct
38 Correct 2124 ms 12572 KB Output is correct
39 Correct 1982 ms 12696 KB Output is correct
40 Correct 1972 ms 12836 KB Output is correct
41 Correct 1972 ms 12744 KB Output is correct
42 Correct 1600 ms 12544 KB Output is correct
43 Correct 1578 ms 12360 KB Output is correct
44 Correct 1591 ms 12708 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 64 ms 1512 KB Output is correct
4 Correct 33 ms 1528 KB Output is correct
5 Correct 55 ms 1528 KB Output is correct
6 Correct 55 ms 1152 KB Output is correct
7 Correct 50 ms 1116 KB Output is correct
8 Correct 55 ms 1372 KB Output is correct
9 Correct 51 ms 1244 KB Output is correct
10 Correct 56 ms 1552 KB Output is correct
11 Correct 55 ms 1496 KB Output is correct
12 Correct 56 ms 1492 KB Output is correct
13 Correct 63 ms 1496 KB Output is correct
14 Correct 63 ms 1496 KB Output is correct
15 Correct 63 ms 1484 KB Output is correct
16 Correct 48 ms 1116 KB Output is correct
17 Correct 50 ms 1116 KB Output is correct
18 Correct 2208 ms 12540 KB Output is correct
19 Correct 2215 ms 12772 KB Output is correct
20 Correct 2242 ms 12708 KB Output is correct
21 Correct 2223 ms 12648 KB Output is correct
22 Correct 2237 ms 12680 KB Output is correct
23 Correct 2506 ms 11728 KB Output is correct
24 Correct 2456 ms 12184 KB Output is correct
25 Correct 2471 ms 12324 KB Output is correct
26 Correct 344 ms 7720 KB Output is correct
27 Correct 1969 ms 5708 KB Output is correct
28 Correct 2019 ms 5884 KB Output is correct
29 Correct 2239 ms 12504 KB Output is correct
30 Correct 1650 ms 12576 KB Output is correct
31 Correct 1769 ms 10708 KB Output is correct
32 Correct 1033 ms 7436 KB Output is correct
33 Correct 1712 ms 9728 KB Output is correct
34 Correct 1691 ms 10896 KB Output is correct
35 Correct 335 ms 7844 KB Output is correct
36 Correct 1726 ms 10824 KB Output is correct
37 Correct 1644 ms 11088 KB Output is correct
38 Correct 1623 ms 10844 KB Output is correct
39 Correct 1623 ms 11172 KB Output is correct
40 Correct 1515 ms 11044 KB Output is correct
41 Correct 1099 ms 10656 KB Output is correct
42 Correct 1091 ms 10880 KB Output is correct
43 Execution timed out 3074 ms 15696 KB Time limit exceeded
44 Halted 0 ms 0 KB -