답안 #255792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255792 2020-08-01T20:49:52 Z mehrdad_sohrabi 다리 (APIO19_bridges) C++14
73 / 100
3000 ms 19716 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=700;
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 85 ms 1632 KB Output is correct
4 Correct 42 ms 1500 KB Output is correct
5 Correct 72 ms 1528 KB Output is correct
6 Correct 68 ms 1152 KB Output is correct
7 Correct 64 ms 1116 KB Output is correct
8 Correct 74 ms 1372 KB Output is correct
9 Correct 75 ms 1116 KB Output is correct
10 Correct 69 ms 1492 KB Output is correct
11 Correct 72 ms 1492 KB Output is correct
12 Correct 70 ms 1496 KB Output is correct
13 Correct 78 ms 1496 KB Output is correct
14 Correct 77 ms 1624 KB Output is correct
15 Correct 78 ms 1496 KB Output is correct
16 Correct 64 ms 1116 KB Output is correct
17 Correct 68 ms 1116 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2245 ms 12700 KB Output is correct
2 Correct 2251 ms 12600 KB Output is correct
3 Correct 2263 ms 12684 KB Output is correct
4 Correct 2324 ms 12628 KB Output is correct
5 Correct 2331 ms 12568 KB Output is correct
6 Correct 2645 ms 11700 KB Output is correct
7 Correct 2667 ms 12132 KB Output is correct
8 Correct 2653 ms 12444 KB Output is correct
9 Correct 429 ms 7716 KB Output is correct
10 Correct 2058 ms 5696 KB Output is correct
11 Correct 2031 ms 5660 KB Output is correct
12 Correct 2338 ms 12236 KB Output is correct
13 Correct 1478 ms 12448 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1927 ms 10788 KB Output is correct
2 Correct 1292 ms 7296 KB Output is correct
3 Correct 1901 ms 9636 KB Output is correct
4 Correct 1850 ms 10788 KB Output is correct
5 Correct 436 ms 7720 KB Output is correct
6 Correct 1939 ms 10788 KB Output is correct
7 Correct 1825 ms 10788 KB Output is correct
8 Correct 1731 ms 11088 KB Output is correct
9 Correct 1702 ms 11024 KB Output is correct
10 Correct 1586 ms 11044 KB Output is correct
11 Correct 1029 ms 10740 KB Output is correct
12 Correct 1037 ms 10700 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2849 ms 16136 KB Output is correct
2 Correct 441 ms 7996 KB Output is correct
3 Correct 314 ms 10280 KB Output is correct
4 Correct 291 ms 5160 KB Output is correct
5 Correct 2937 ms 6904 KB Output is correct
6 Correct 2809 ms 17384 KB Output is correct
7 Correct 2991 ms 7852 KB Output is correct
8 Correct 2003 ms 13888 KB Output is correct
9 Correct 1988 ms 14080 KB Output is correct
10 Correct 2364 ms 14028 KB Output is correct
11 Correct 2574 ms 15328 KB Output is correct
12 Correct 2513 ms 15268 KB Output is correct
13 Correct 2666 ms 15356 KB Output is correct
14 Correct 2916 ms 7964 KB Output is correct
15 Correct 2983 ms 7976 KB Output is correct
16 Correct 2887 ms 17272 KB Output is correct
17 Correct 2841 ms 17300 KB Output is correct
18 Correct 2907 ms 17076 KB Output is correct
19 Correct 2924 ms 17244 KB Output is correct
20 Correct 2665 ms 16184 KB Output is correct
21 Correct 2680 ms 15892 KB Output is correct
22 Correct 2866 ms 17308 KB Output is correct
23 Correct 2618 ms 7592 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2245 ms 12700 KB Output is correct
2 Correct 2251 ms 12600 KB Output is correct
3 Correct 2263 ms 12684 KB Output is correct
4 Correct 2324 ms 12628 KB Output is correct
5 Correct 2331 ms 12568 KB Output is correct
6 Correct 2645 ms 11700 KB Output is correct
7 Correct 2667 ms 12132 KB Output is correct
8 Correct 2653 ms 12444 KB Output is correct
9 Correct 429 ms 7716 KB Output is correct
10 Correct 2058 ms 5696 KB Output is correct
11 Correct 2031 ms 5660 KB Output is correct
12 Correct 2338 ms 12236 KB Output is correct
13 Correct 1478 ms 12448 KB Output is correct
14 Correct 1927 ms 10788 KB Output is correct
15 Correct 1292 ms 7296 KB Output is correct
16 Correct 1901 ms 9636 KB Output is correct
17 Correct 1850 ms 10788 KB Output is correct
18 Correct 436 ms 7720 KB Output is correct
19 Correct 1939 ms 10788 KB Output is correct
20 Correct 1825 ms 10788 KB Output is correct
21 Correct 1731 ms 11088 KB Output is correct
22 Correct 1702 ms 11024 KB Output is correct
23 Correct 1586 ms 11044 KB Output is correct
24 Correct 1029 ms 10740 KB Output is correct
25 Correct 1037 ms 10700 KB Output is correct
26 Correct 2286 ms 12804 KB Output is correct
27 Correct 2472 ms 11680 KB Output is correct
28 Correct 2341 ms 12744 KB Output is correct
29 Correct 2060 ms 12644 KB Output is correct
30 Correct 2575 ms 12072 KB Output is correct
31 Correct 2579 ms 11944 KB Output is correct
32 Correct 2532 ms 12280 KB Output is correct
33 Correct 2457 ms 12576 KB Output is correct
34 Correct 2434 ms 12648 KB Output is correct
35 Correct 2424 ms 12628 KB Output is correct
36 Correct 2174 ms 12632 KB Output is correct
37 Correct 2166 ms 12780 KB Output is correct
38 Correct 2134 ms 12572 KB Output is correct
39 Correct 1904 ms 12708 KB Output is correct
40 Correct 1875 ms 12884 KB Output is correct
41 Correct 1914 ms 12888 KB Output is correct
42 Correct 1387 ms 12392 KB Output is correct
43 Correct 1397 ms 12684 KB Output is correct
44 Correct 1367 ms 12452 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 85 ms 1632 KB Output is correct
4 Correct 42 ms 1500 KB Output is correct
5 Correct 72 ms 1528 KB Output is correct
6 Correct 68 ms 1152 KB Output is correct
7 Correct 64 ms 1116 KB Output is correct
8 Correct 74 ms 1372 KB Output is correct
9 Correct 75 ms 1116 KB Output is correct
10 Correct 69 ms 1492 KB Output is correct
11 Correct 72 ms 1492 KB Output is correct
12 Correct 70 ms 1496 KB Output is correct
13 Correct 78 ms 1496 KB Output is correct
14 Correct 77 ms 1624 KB Output is correct
15 Correct 78 ms 1496 KB Output is correct
16 Correct 64 ms 1116 KB Output is correct
17 Correct 68 ms 1116 KB Output is correct
18 Correct 2245 ms 12700 KB Output is correct
19 Correct 2251 ms 12600 KB Output is correct
20 Correct 2263 ms 12684 KB Output is correct
21 Correct 2324 ms 12628 KB Output is correct
22 Correct 2331 ms 12568 KB Output is correct
23 Correct 2645 ms 11700 KB Output is correct
24 Correct 2667 ms 12132 KB Output is correct
25 Correct 2653 ms 12444 KB Output is correct
26 Correct 429 ms 7716 KB Output is correct
27 Correct 2058 ms 5696 KB Output is correct
28 Correct 2031 ms 5660 KB Output is correct
29 Correct 2338 ms 12236 KB Output is correct
30 Correct 1478 ms 12448 KB Output is correct
31 Correct 1927 ms 10788 KB Output is correct
32 Correct 1292 ms 7296 KB Output is correct
33 Correct 1901 ms 9636 KB Output is correct
34 Correct 1850 ms 10788 KB Output is correct
35 Correct 436 ms 7720 KB Output is correct
36 Correct 1939 ms 10788 KB Output is correct
37 Correct 1825 ms 10788 KB Output is correct
38 Correct 1731 ms 11088 KB Output is correct
39 Correct 1702 ms 11024 KB Output is correct
40 Correct 1586 ms 11044 KB Output is correct
41 Correct 1029 ms 10740 KB Output is correct
42 Correct 1037 ms 10700 KB Output is correct
43 Correct 2849 ms 16136 KB Output is correct
44 Correct 441 ms 7996 KB Output is correct
45 Correct 314 ms 10280 KB Output is correct
46 Correct 291 ms 5160 KB Output is correct
47 Correct 2937 ms 6904 KB Output is correct
48 Correct 2809 ms 17384 KB Output is correct
49 Correct 2991 ms 7852 KB Output is correct
50 Correct 2003 ms 13888 KB Output is correct
51 Correct 1988 ms 14080 KB Output is correct
52 Correct 2364 ms 14028 KB Output is correct
53 Correct 2574 ms 15328 KB Output is correct
54 Correct 2513 ms 15268 KB Output is correct
55 Correct 2666 ms 15356 KB Output is correct
56 Correct 2916 ms 7964 KB Output is correct
57 Correct 2983 ms 7976 KB Output is correct
58 Correct 2887 ms 17272 KB Output is correct
59 Correct 2841 ms 17300 KB Output is correct
60 Correct 2907 ms 17076 KB Output is correct
61 Correct 2924 ms 17244 KB Output is correct
62 Correct 2665 ms 16184 KB Output is correct
63 Correct 2680 ms 15892 KB Output is correct
64 Correct 2866 ms 17308 KB Output is correct
65 Correct 2618 ms 7592 KB Output is correct
66 Correct 2286 ms 12804 KB Output is correct
67 Correct 2472 ms 11680 KB Output is correct
68 Correct 2341 ms 12744 KB Output is correct
69 Correct 2060 ms 12644 KB Output is correct
70 Correct 2575 ms 12072 KB Output is correct
71 Correct 2579 ms 11944 KB Output is correct
72 Correct 2532 ms 12280 KB Output is correct
73 Correct 2457 ms 12576 KB Output is correct
74 Correct 2434 ms 12648 KB Output is correct
75 Correct 2424 ms 12628 KB Output is correct
76 Correct 2174 ms 12632 KB Output is correct
77 Correct 2166 ms 12780 KB Output is correct
78 Correct 2134 ms 12572 KB Output is correct
79 Correct 1904 ms 12708 KB Output is correct
80 Correct 1875 ms 12884 KB Output is correct
81 Correct 1914 ms 12888 KB Output is correct
82 Correct 1387 ms 12392 KB Output is correct
83 Correct 1397 ms 12684 KB Output is correct
84 Correct 1367 ms 12452 KB Output is correct
85 Execution timed out 3083 ms 19716 KB Time limit exceeded
86 Halted 0 ms 0 KB -