oj.uz

Submission #340971

# Submission time Handle Problem Language Result Execution time Memory
340971 2020-12-28T18:45:26 Z saleh Bridges (APIO19_bridges) C++17
73 / 100
 3000 ms 6704 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,unroll-loops")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=5e4+2,sq=1000;
struct IO_Tp{
 bool is_digit(const char ch){
  return '0' <= ch && ch <= '9';
 }
 IO_Tp& operator>>(int& res){
  res = 0;
  static char ch;
  while (ch = getchar(), !is_digit(ch));
  do
   (res *= 10) += ch & 15;
  while (ch = getchar(), is_digit(ch));
  return *this;
 }
} IO;
 
vector <pair <int,pii > > yy,yal;
bitset<N*2> vis,vis2;
ll nxt[N*2],pre[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;
int main(){
    sync;
    ll n,m;
  IO >> n >> m;
    for (int i=1;i<=m;i++){
        ll u,v,w;
        IO >> u >> v >> w;
        yy.pb({w,{u,v}});
    }
    ll q1;
    IO >> q1;
    while(q1--){
        ll u,v,w;
        IO >> u >> v >> w;
        u--;
        q.pb({u,{v,w}});
    }
    pre[0]=-1;
    nxt[q.size()-1]=5e6;
    for (int j=1;j<q.size();j++){
        if (!q[j-1].F) pre[j]=j-1;
        else pre[j]=pre[j-1];
    }
    for (int j=(ll)q.size()-2;j>-1;j--){
        if (!q[j+1].F) nxt[j]=j+1;
        else nxt[j]=nxt[j+1];
    }
    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) 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])
            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){
                        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){
                 //       cout << k << " " << pre[k] << endl;
                        k=pre[k]+1;
                        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]){
                        k=pre[k]+1;
                        continue;
                    }
                    vis2[q[k].S.F-1]=1;
                    if (q[k].S.S>=g[cnt].F){
                        merg(u,v);
                    }
                    k=pre[k]+1;
                }
                for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F){
                        k=nxt[k]-1;
                        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]){
                        k=nxt[k]-1;
                        continue;
                    }
                    vis2[q[k].S.F-1]=1;
                    if (yy[q[k].S.F-1].F>=g[cnt].F){
                        merg(u,v);
                    }
                    k=nxt[k]-1;
                }
                ans[id]=zz[gg(q[id].S.F)];
                cnt++;
            }
            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){
                        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){
                        k=pre[k]+1;
                        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]){
                        k=pre[k]+1;
                        continue;
                    }
                    vis2[q[k].S.F-1]=1;
                    if (q[k].S.S>=g[cnt].F){
                        merg(u,v);
                    }
                    k=pre[k]+1;
                }
                for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
                    if (q[k].F) {
                        k=nxt[k]-1;
                        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]){
                        k=nxt[k]-1;
                        continue;
                    }
                    vis2[q[k].S.F-1]=1;
                    if (yy[q[k].S.F-1].F>=g[cnt].F){
                        merg(u,v);
                    }
                    k=nxt[k]-1;
                }
                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){
                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)
        printf("%d \n",ans[i]);
    }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:78:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int j=1;j<q.size();j++){
      |                  ~^~~~~~~~~
bridges.cpp:86:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for (int i=0;i<q.size();i+=sq){
      |                  ~^~~~~~~~~
bridges.cpp:101:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int j=0;j<yy.size();j++){
      |                      ~^~~~~~~~~~
bridges.cpp:110:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |             while(cnt<g.size() && g[cnt].F>yal[j].F){
      |                   ~~~^~~~~~~~~
bridges.cpp:168:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         while(cnt<g.size()){
      |               ~~~^~~~~~~~~
bridges.cpp:231:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  231 |     for (int i=0;i<q.size();i++){
      |                  ~^~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 114 ms 1336 KB Output is correct
4 Correct 42 ms 1196 KB Output is correct
5 Correct 87 ms 1200 KB Output is correct
6 Correct 84 ms 1200 KB Output is correct
7 Correct 91 ms 1200 KB Output is correct
8 Correct 88 ms 1200 KB Output is correct
9 Correct 90 ms 1200 KB Output is correct
10 Correct 90 ms 1200 KB Output is correct
11 Correct 88 ms 1200 KB Output is correct
12 Correct 96 ms 1200 KB Output is correct
13 Correct 99 ms 1200 KB Output is correct
14 Correct 105 ms 1200 KB Output is correct
15 Correct 91 ms 1176 KB Output is correct
16 Correct 87 ms 1200 KB Output is correct
17 Correct 89 ms 1200 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2411 ms 5600 KB Output is correct
2 Correct 2464 ms 5736 KB Output is correct
3 Correct 2526 ms 5576 KB Output is correct
4 Correct 2499 ms 5600 KB Output is correct
5 Correct 2510 ms 5728 KB Output is correct
6 Correct 2992 ms 5940 KB Output is correct
7 Correct 2922 ms 5796 KB Output is correct
8 Correct 2883 ms 5788 KB Output is correct
9 Correct 377 ms 3552 KB Output is correct
10 Correct 2440 ms 5728 KB Output is correct
11 Correct 2413 ms 5624 KB Output is correct
12 Correct 2572 ms 6072 KB Output is correct
13 Correct 1381 ms 5476 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2121 ms 4704 KB Output is correct
2 Correct 1617 ms 3872 KB Output is correct
3 Correct 2119 ms 5240 KB Output is correct
4 Correct 2057 ms 4704 KB Output is correct
5 Correct 444 ms 3680 KB Output is correct
6 Correct 2170 ms 4708 KB Output is correct
7 Correct 2071 ms 4704 KB Output is correct
8 Correct 1968 ms 4832 KB Output is correct
9 Correct 1976 ms 4960 KB Output is correct
10 Correct 1830 ms 5052 KB Output is correct
11 Correct 964 ms 4704 KB Output is correct
12 Correct 914 ms 4576 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2598 ms 6532 KB Output is correct
2 Correct 397 ms 3568 KB Output is correct
3 Correct 206 ms 4576 KB Output is correct
4 Correct 231 ms 4576 KB Output is correct
5 Correct 2768 ms 6684 KB Output is correct
6 Correct 2594 ms 6588 KB Output is correct
7 Correct 2779 ms 6628 KB Output is correct
8 Correct 2073 ms 5812 KB Output is correct
9 Correct 2009 ms 5824 KB Output is correct
10 Correct 2425 ms 5856 KB Output is correct
11 Correct 2540 ms 6100 KB Output is correct
12 Correct 2523 ms 5936 KB Output is correct
13 Correct 2500 ms 6052 KB Output is correct
14 Correct 2730 ms 6704 KB Output is correct
15 Correct 2788 ms 6624 KB Output is correct
16 Correct 2634 ms 6644 KB Output is correct
17 Correct 2603 ms 6640 KB Output is correct
18 Correct 2673 ms 6576 KB Output is correct
19 Correct 2666 ms 6680 KB Output is correct
20 Correct 2391 ms 6244 KB Output is correct
21 Correct 2416 ms 6244 KB Output is correct
22 Correct 2514 ms 6552 KB Output is correct
23 Correct 2439 ms 6184 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2411 ms 5600 KB Output is correct
2 Correct 2464 ms 5736 KB Output is correct
3 Correct 2526 ms 5576 KB Output is correct
4 Correct 2499 ms 5600 KB Output is correct
5 Correct 2510 ms 5728 KB Output is correct
6 Correct 2992 ms 5940 KB Output is correct
7 Correct 2922 ms 5796 KB Output is correct
8 Correct 2883 ms 5788 KB Output is correct
9 Correct 377 ms 3552 KB Output is correct
10 Correct 2440 ms 5728 KB Output is correct
11 Correct 2413 ms 5624 KB Output is correct
12 Correct 2572 ms 6072 KB Output is correct
13 Correct 1381 ms 5476 KB Output is correct
14 Correct 2121 ms 4704 KB Output is correct
15 Correct 1617 ms 3872 KB Output is correct
16 Correct 2119 ms 5240 KB Output is correct
17 Correct 2057 ms 4704 KB Output is correct
18 Correct 444 ms 3680 KB Output is correct
19 Correct 2170 ms 4708 KB Output is correct
20 Correct 2071 ms 4704 KB Output is correct
21 Correct 1968 ms 4832 KB Output is correct
22 Correct 1976 ms 4960 KB Output is correct
23 Correct 1830 ms 5052 KB Output is correct
24 Correct 964 ms 4704 KB Output is correct
25 Correct 914 ms 4576 KB Output is correct
26 Correct 2546 ms 5672 KB Output is correct
27 Correct 2614 ms 5768 KB Output is correct
28 Correct 2495 ms 5728 KB Output is correct
29 Correct 2261 ms 5748 KB Output is correct
30 Correct 2740 ms 5904 KB Output is correct
31 Correct 2805 ms 5612 KB Output is correct
32 Correct 2783 ms 5816 KB Output is correct
33 Correct 2652 ms 5600 KB Output is correct
34 Correct 2591 ms 5600 KB Output is correct
35 Correct 2668 ms 5880 KB Output is correct
36 Correct 2361 ms 5796 KB Output is correct
37 Correct 2355 ms 5624 KB Output is correct
38 Correct 2319 ms 6084 KB Output is correct
39 Correct 2025 ms 5728 KB Output is correct
40 Correct 2045 ms 5840 KB Output is correct
41 Correct 2089 ms 5984 KB Output is correct
42 Correct 1193 ms 5856 KB Output is correct
43 Correct 1184 ms 5600 KB Output is correct
44 Correct 1180 ms 5696 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 114 ms 1336 KB Output is correct
4 Correct 42 ms 1196 KB Output is correct
5 Correct 87 ms 1200 KB Output is correct
6 Correct 84 ms 1200 KB Output is correct
7 Correct 91 ms 1200 KB Output is correct
8 Correct 88 ms 1200 KB Output is correct
9 Correct 90 ms 1200 KB Output is correct
10 Correct 90 ms 1200 KB Output is correct
11 Correct 88 ms 1200 KB Output is correct
12 Correct 96 ms 1200 KB Output is correct
13 Correct 99 ms 1200 KB Output is correct
14 Correct 105 ms 1200 KB Output is correct
15 Correct 91 ms 1176 KB Output is correct
16 Correct 87 ms 1200 KB Output is correct
17 Correct 89 ms 1200 KB Output is correct
18 Correct 2411 ms 5600 KB Output is correct
19 Correct 2464 ms 5736 KB Output is correct
20 Correct 2526 ms 5576 KB Output is correct
21 Correct 2499 ms 5600 KB Output is correct
22 Correct 2510 ms 5728 KB Output is correct
23 Correct 2992 ms 5940 KB Output is correct
24 Correct 2922 ms 5796 KB Output is correct
25 Correct 2883 ms 5788 KB Output is correct
26 Correct 377 ms 3552 KB Output is correct
27 Correct 2440 ms 5728 KB Output is correct
28 Correct 2413 ms 5624 KB Output is correct
29 Correct 2572 ms 6072 KB Output is correct
30 Correct 1381 ms 5476 KB Output is correct
31 Correct 2121 ms 4704 KB Output is correct
32 Correct 1617 ms 3872 KB Output is correct
33 Correct 2119 ms 5240 KB Output is correct
34 Correct 2057 ms 4704 KB Output is correct
35 Correct 444 ms 3680 KB Output is correct
36 Correct 2170 ms 4708 KB Output is correct
37 Correct 2071 ms 4704 KB Output is correct
38 Correct 1968 ms 4832 KB Output is correct
39 Correct 1976 ms 4960 KB Output is correct
40 Correct 1830 ms 5052 KB Output is correct
41 Correct 964 ms 4704 KB Output is correct
42 Correct 914 ms 4576 KB Output is correct
43 Correct 2598 ms 6532 KB Output is correct
44 Correct 397 ms 3568 KB Output is correct
45 Correct 206 ms 4576 KB Output is correct
46 Correct 231 ms 4576 KB Output is correct
47 Correct 2768 ms 6684 KB Output is correct
48 Correct 2594 ms 6588 KB Output is correct
49 Correct 2779 ms 6628 KB Output is correct
50 Correct 2073 ms 5812 KB Output is correct
51 Correct 2009 ms 5824 KB Output is correct
52 Correct 2425 ms 5856 KB Output is correct
53 Correct 2540 ms 6100 KB Output is correct
54 Correct 2523 ms 5936 KB Output is correct
55 Correct 2500 ms 6052 KB Output is correct
56 Correct 2730 ms 6704 KB Output is correct
57 Correct 2788 ms 6624 KB Output is correct
58 Correct 2634 ms 6644 KB Output is correct
59 Correct 2603 ms 6640 KB Output is correct
60 Correct 2673 ms 6576 KB Output is correct
61 Correct 2666 ms 6680 KB Output is correct
62 Correct 2391 ms 6244 KB Output is correct
63 Correct 2416 ms 6244 KB Output is correct
64 Correct 2514 ms 6552 KB Output is correct
65 Correct 2439 ms 6184 KB Output is correct
66 Correct 2546 ms 5672 KB Output is correct
67 Correct 2614 ms 5768 KB Output is correct
68 Correct 2495 ms 5728 KB Output is correct
69 Correct 2261 ms 5748 KB Output is correct
70 Correct 2740 ms 5904 KB Output is correct
71 Correct 2805 ms 5612 KB Output is correct
72 Correct 2783 ms 5816 KB Output is correct
73 Correct 2652 ms 5600 KB Output is correct
74 Correct 2591 ms 5600 KB Output is correct
75 Correct 2668 ms 5880 KB Output is correct
76 Correct 2361 ms 5796 KB Output is correct
77 Correct 2355 ms 5624 KB Output is correct
78 Correct 2319 ms 6084 KB Output is correct
79 Correct 2025 ms 5728 KB Output is correct
80 Correct 2045 ms 5840 KB Output is correct
81 Correct 2089 ms 5984 KB Output is correct
82 Correct 1193 ms 5856 KB Output is correct
83 Correct 1184 ms 5600 KB Output is correct
84 Correct 1180 ms 5696 KB Output is correct
85 Correct 2968 ms 6240 KB Output is correct
86 Correct 245 ms 4576 KB Output is correct
87 Correct 277 ms 4576 KB Output is correct
88 Execution timed out 3053 ms 6240 KB Time limit exceeded
89 Halted 0 ms 0 KB -