oj.uz

Submission #712538

# Submission time Handle Problem Language Result Execution time Memory
712538 2023-03-19T06:18:33 Z HuyQuang_re_Zero Bridges (APIO19_bridges) C++17
100 / 100
 2926 ms 15016 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define N 400002
#define II pair <int,int>
#define fst first
#define snd second
using namespace std;
set <II> done;
II edge[N];
vector <II> roll;
struct pt { int lb,x,k; };
pt even[N];
struct Edge { int u,v,k; };
Edge bri[N];
int n,m,q,i,u,v,sz[N],r[N],updated[N],cur[N],res[N];
int root(int u) { return (u==r[u]) ? u : root(r[u]); }
void join(int u,int v)
{
    if(u==v) return ;
    if(sz[u]>sz[v]) swap(u,v);
    r[u]=v; sz[v]+=sz[u];
}
void roll_back()
{
    reverse(roll.begin(),roll.end());
    for(II a:roll) r[a.fst]=a.fst,sz[a.fst]=a.snd;
}
void solve(int l,int r)
{
    vector <pt> change,qr;
    for(i=l;i<=r;i++)
        if(even[i].lb==1)
        {
            if(updated[even[i].x]==1) continue;
            updated[even[i].x]=1;
            done.erase({ bri[even[i].x].k,even[i].x });
            change.push_back({ l-1,even[i].x,bri[even[i].x].k });
        }
        else qr.push_back({ i,even[i].x,even[i].k });
    for(i=l;i<=r;i++)
        if(even[i].lb==1) change.push_back({ i,even[i].x,even[i].k }),bri[even[i].x].k=even[i].k;
    sort(qr.begin(),qr.end(),[&](pt a,pt b){ return a.k>b.k;  });
    reverse(change.begin(),change.end());
    int cnt=0;
    for(auto tg:done) edge[++cnt]=tg;
    int j=cnt;
    for(auto tg:qr)
    {
        while(j>0 && edge[j].fst>=tg.k)
        {
            join(root(bri[edge[j].snd].u),root(bri[edge[j].snd].v));
            j--;
        }
        roll.clear();
        for(auto a:change)
        {
            if(a.lb>tg.lb || cur[a.x]==tg.lb) continue;
            cur[a.x]=tg.lb;
            if(a.k<tg.k) continue;
            int u=root(bri[a.x].u),v=root(bri[a.x].v);
            if(u!=v)
            {
                if(sz[u]>sz[v]) swap(u,v);
                roll.push_back({ u,sz[u] });
                roll.push_back({ v,sz[v] });
                join(u,v);
            }
        }
        int u=root(tg.x);
        res[tg.lb]=sz[u];
        roll_back();
    }
    for(auto tg:change)
    {
        if(updated[tg.x]==0) continue;
        updated[tg.x]=0;
        done.insert({ tg.k,tg.x });
    }
}
int main()
{
  //  freopen("ntu.inp","r",stdin);
   // freopen("ntu.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>m;
    for(i=1;i<=m;i++) cin>>bri[i].u>>bri[i].v>>bri[i].k,even[i].k,even[i]={ 1,i,bri[i].k };
    cin>>q;
    for(i=m+1;i<=m+q;i++) cin>>even[i].lb>>even[i].x>>even[i].k;
    for(i=1;i<=m;i++) done.insert({ even[i].k,i });
    int can=trunc(sqrt(q));
    for(int l=m+1;l<=m+q;l+=can)
    {
        for(u=1;u<=n;u++) r[u]=u,sz[u]=1;
        solve(l,min(l+can-1,m+q));
    }
    for(i=m+1;i<=m+q;i++)
        if(even[i].lb==2) cout<<res[i]<<'\n';
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:88:65: warning: right operand of comma operator has no effect [-Wunused-value]
   88 |     for(i=1;i<=m;i++) cin>>bri[i].u>>bri[i].v>>bri[i].k,even[i].k,even[i]={ 1,i,bri[i].k };
      |                                                         ~~~~~~~~^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 13 ms 772 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 10 ms 628 KB Output is correct
8 Correct 12 ms 596 KB Output is correct
9 Correct 10 ms 596 KB Output is correct
10 Correct 10 ms 676 KB Output is correct
11 Correct 9 ms 596 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 10 ms 596 KB Output is correct
14 Correct 9 ms 604 KB Output is correct
15 Correct 11 ms 592 KB Output is correct
16 Correct 12 ms 596 KB Output is correct
17 Correct 11 ms 604 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1247 ms 9456 KB Output is correct
2 Correct 1256 ms 9540 KB Output is correct
3 Correct 1243 ms 9452 KB Output is correct
4 Correct 1240 ms 9604 KB Output is correct
5 Correct 1311 ms 9616 KB Output is correct
6 Correct 1450 ms 9648 KB Output is correct
7 Correct 1477 ms 9428 KB Output is correct
8 Correct 1634 ms 9664 KB Output is correct
9 Correct 33 ms 3404 KB Output is correct
10 Correct 814 ms 8412 KB Output is correct
11 Correct 847 ms 8412 KB Output is correct
12 Correct 1047 ms 9764 KB Output is correct
13 Correct 1257 ms 9440 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 7480 KB Output is correct
2 Correct 390 ms 4356 KB Output is correct
3 Correct 907 ms 7340 KB Output is correct
4 Correct 826 ms 7628 KB Output is correct
5 Correct 33 ms 3424 KB Output is correct
6 Correct 876 ms 7392 KB Output is correct
7 Correct 775 ms 7456 KB Output is correct
8 Correct 775 ms 7444 KB Output is correct
9 Correct 623 ms 7576 KB Output is correct
10 Correct 612 ms 7576 KB Output is correct
11 Correct 667 ms 7276 KB Output is correct
12 Correct 664 ms 7460 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2529 ms 14504 KB Output is correct
2 Correct 35 ms 3440 KB Output is correct
3 Correct 717 ms 10220 KB Output is correct
4 Correct 327 ms 10296 KB Output is correct
5 Correct 1987 ms 12948 KB Output is correct
6 Correct 2629 ms 14352 KB Output is correct
7 Correct 1895 ms 12972 KB Output is correct
8 Correct 1178 ms 9172 KB Output is correct
9 Correct 1027 ms 9372 KB Output is correct
10 Correct 1165 ms 9152 KB Output is correct
11 Correct 1803 ms 11656 KB Output is correct
12 Correct 1744 ms 11872 KB Output is correct
13 Correct 1704 ms 11716 KB Output is correct
14 Correct 1460 ms 12996 KB Output is correct
15 Correct 1672 ms 13108 KB Output is correct
16 Correct 2714 ms 14348 KB Output is correct
17 Correct 2201 ms 14316 KB Output is correct
18 Correct 2847 ms 14320 KB Output is correct
19 Correct 2478 ms 14280 KB Output is correct
20 Correct 1958 ms 12588 KB Output is correct
21 Correct 1943 ms 12560 KB Output is correct
22 Correct 2305 ms 14028 KB Output is correct
23 Correct 2171 ms 11520 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1247 ms 9456 KB Output is correct
2 Correct 1256 ms 9540 KB Output is correct
3 Correct 1243 ms 9452 KB Output is correct
4 Correct 1240 ms 9604 KB Output is correct
5 Correct 1311 ms 9616 KB Output is correct
6 Correct 1450 ms 9648 KB Output is correct
7 Correct 1477 ms 9428 KB Output is correct
8 Correct 1634 ms 9664 KB Output is correct
9 Correct 33 ms 3404 KB Output is correct
10 Correct 814 ms 8412 KB Output is correct
11 Correct 847 ms 8412 KB Output is correct
12 Correct 1047 ms 9764 KB Output is correct
13 Correct 1257 ms 9440 KB Output is correct
14 Correct 849 ms 7480 KB Output is correct
15 Correct 390 ms 4356 KB Output is correct
16 Correct 907 ms 7340 KB Output is correct
17 Correct 826 ms 7628 KB Output is correct
18 Correct 33 ms 3424 KB Output is correct
19 Correct 876 ms 7392 KB Output is correct
20 Correct 775 ms 7456 KB Output is correct
21 Correct 775 ms 7444 KB Output is correct
22 Correct 623 ms 7576 KB Output is correct
23 Correct 612 ms 7576 KB Output is correct
24 Correct 667 ms 7276 KB Output is correct
25 Correct 664 ms 7460 KB Output is correct
26 Correct 1494 ms 9628 KB Output is correct
27 Correct 1384 ms 9544 KB Output is correct
28 Correct 1405 ms 9516 KB Output is correct
29 Correct 1384 ms 9596 KB Output is correct
30 Correct 1341 ms 9384 KB Output is correct
31 Correct 1340 ms 9348 KB Output is correct
32 Correct 1499 ms 9568 KB Output is correct
33 Correct 1598 ms 9660 KB Output is correct
34 Correct 1289 ms 9620 KB Output is correct
35 Correct 1544 ms 9664 KB Output is correct
36 Correct 1273 ms 9404 KB Output is correct
37 Correct 1362 ms 9488 KB Output is correct
38 Correct 1390 ms 9524 KB Output is correct
39 Correct 1251 ms 9540 KB Output is correct
40 Correct 1127 ms 9700 KB Output is correct
41 Correct 1085 ms 9628 KB Output is correct
42 Correct 1111 ms 9672 KB Output is correct
43 Correct 1027 ms 9392 KB Output is correct
44 Correct 994 ms 9344 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 13 ms 772 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 10 ms 628 KB Output is correct
8 Correct 12 ms 596 KB Output is correct
9 Correct 10 ms 596 KB Output is correct
10 Correct 10 ms 676 KB Output is correct
11 Correct 9 ms 596 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 10 ms 596 KB Output is correct
14 Correct 9 ms 604 KB Output is correct
15 Correct 11 ms 592 KB Output is correct
16 Correct 12 ms 596 KB Output is correct
17 Correct 11 ms 604 KB Output is correct
18 Correct 1247 ms 9456 KB Output is correct
19 Correct 1256 ms 9540 KB Output is correct
20 Correct 1243 ms 9452 KB Output is correct
21 Correct 1240 ms 9604 KB Output is correct
22 Correct 1311 ms 9616 KB Output is correct
23 Correct 1450 ms 9648 KB Output is correct
24 Correct 1477 ms 9428 KB Output is correct
25 Correct 1634 ms 9664 KB Output is correct
26 Correct 33 ms 3404 KB Output is correct
27 Correct 814 ms 8412 KB Output is correct
28 Correct 847 ms 8412 KB Output is correct
29 Correct 1047 ms 9764 KB Output is correct
30 Correct 1257 ms 9440 KB Output is correct
31 Correct 849 ms 7480 KB Output is correct
32 Correct 390 ms 4356 KB Output is correct
33 Correct 907 ms 7340 KB Output is correct
34 Correct 826 ms 7628 KB Output is correct
35 Correct 33 ms 3424 KB Output is correct
36 Correct 876 ms 7392 KB Output is correct
37 Correct 775 ms 7456 KB Output is correct
38 Correct 775 ms 7444 KB Output is correct
39 Correct 623 ms 7576 KB Output is correct
40 Correct 612 ms 7576 KB Output is correct
41 Correct 667 ms 7276 KB Output is correct
42 Correct 664 ms 7460 KB Output is correct
43 Correct 2529 ms 14504 KB Output is correct
44 Correct 35 ms 3440 KB Output is correct
45 Correct 717 ms 10220 KB Output is correct
46 Correct 327 ms 10296 KB Output is correct
47 Correct 1987 ms 12948 KB Output is correct
48 Correct 2629 ms 14352 KB Output is correct
49 Correct 1895 ms 12972 KB Output is correct
50 Correct 1178 ms 9172 KB Output is correct
51 Correct 1027 ms 9372 KB Output is correct
52 Correct 1165 ms 9152 KB Output is correct
53 Correct 1803 ms 11656 KB Output is correct
54 Correct 1744 ms 11872 KB Output is correct
55 Correct 1704 ms 11716 KB Output is correct
56 Correct 1460 ms 12996 KB Output is correct
57 Correct 1672 ms 13108 KB Output is correct
58 Correct 2714 ms 14348 KB Output is correct
59 Correct 2201 ms 14316 KB Output is correct
60 Correct 2847 ms 14320 KB Output is correct
61 Correct 2478 ms 14280 KB Output is correct
62 Correct 1958 ms 12588 KB Output is correct
63 Correct 1943 ms 12560 KB Output is correct
64 Correct 2305 ms 14028 KB Output is correct
65 Correct 2171 ms 11520 KB Output is correct
66 Correct 1494 ms 9628 KB Output is correct
67 Correct 1384 ms 9544 KB Output is correct
68 Correct 1405 ms 9516 KB Output is correct
69 Correct 1384 ms 9596 KB Output is correct
70 Correct 1341 ms 9384 KB Output is correct
71 Correct 1340 ms 9348 KB Output is correct
72 Correct 1499 ms 9568 KB Output is correct
73 Correct 1598 ms 9660 KB Output is correct
74 Correct 1289 ms 9620 KB Output is correct
75 Correct 1544 ms 9664 KB Output is correct
76 Correct 1273 ms 9404 KB Output is correct
77 Correct 1362 ms 9488 KB Output is correct
78 Correct 1390 ms 9524 KB Output is correct
79 Correct 1251 ms 9540 KB Output is correct
80 Correct 1127 ms 9700 KB Output is correct
81 Correct 1085 ms 9628 KB Output is correct
82 Correct 1111 ms 9672 KB Output is correct
83 Correct 1027 ms 9392 KB Output is correct
84 Correct 994 ms 9344 KB Output is correct
85 Correct 2808 ms 15016 KB Output is correct
86 Correct 674 ms 10944 KB Output is correct
87 Correct 363 ms 10992 KB Output is correct
88 Correct 1896 ms 13616 KB Output is correct
89 Correct 2831 ms 14916 KB Output is correct
90 Correct 2168 ms 13020 KB Output is correct
91 Correct 1306 ms 9320 KB Output is correct
92 Correct 1293 ms 9436 KB Output is correct
93 Correct 1445 ms 9440 KB Output is correct
94 Correct 1914 ms 12152 KB Output is correct
95 Correct 1895 ms 12328 KB Output is correct
96 Correct 1804 ms 12060 KB Output is correct
97 Correct 1710 ms 13472 KB Output is correct
98 Correct 2068 ms 13168 KB Output is correct
99 Correct 2926 ms 14876 KB Output is correct
100 Correct 2863 ms 14764 KB Output is correct
101 Correct 2632 ms 14872 KB Output is correct
102 Correct 2693 ms 14980 KB Output is correct
103 Correct 2423 ms 12768 KB Output is correct
104 Correct 2568 ms 12748 KB Output is correct
105 Correct 2332 ms 12628 KB Output is correct
106 Correct 1800 ms 11752 KB Output is correct
107 Correct 1990 ms 12964 KB Output is correct
108 Correct 2428 ms 13992 KB Output is correct
109 Correct 1803 ms 11276 KB Output is correct