oj.uz

Submission #207404

# Submission time Handle Problem Language Result Execution time Memory
207404 2020-03-07T13:37:18 Z brcode Bridges (APIO19_bridges) C++14
100 / 100
 2943 ms 32984 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+10;
int  n,m,q;
stack<int> s1;
int sz[MAXN];

int par[MAXN];
void reset(){
    for(int i=1;i<MAXN;i++){
        par[i] = i;
    }
    for(int i=1;i<MAXN;i++){
        sz[i] = 1;
    }
}
int find(int a){
    while(par[a] !=a){
        a=par[a];
    }
    return a;
}
void merge(int a,int b){
    a =find(a);
    b = find(b);
    if(a==b){
        return;
    }
    if(sz[a]>sz[b]){
        swap(a,b);
    }
    s1.push(a);
    sz[b]+=sz[a];
    par[a] =par[b];
}
void rollback(int x){
    while(s1.size()>x){
        int k = s1.top();
        s1.pop();
        sz[par[k]]-=sz[k];
        par[k] = k;
    }
}
int u[MAXN],v[MAXN],w[MAXN],t[MAXN],x[MAXN],y[MAXN];
bool changed[MAXN];
vector<int> to_join[1010];
int ans[MAXN];
bool cmp(int a,int b){
    return y[a]>y[b];
}
bool cmp2(int a,int b){
    return w[a]>w[b];
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>u[i]>>v[i]>>w[i];
    }
    cin>>q;
    for(int i=1;i<=q;i++){
        cin>>t[i]>>x[i]>>y[i];
    }
    for(int l=1;l<=q;l+=1000){
        int r = min(q,l+1000-1);
        reset();
        vector<int> ask,update,unchanged;
        for(int i=0;i<=m;i++){
            changed[i] = false;
        }
        for(int i=l;i<=r;i++){
            if(t[i] == 1){
                changed[x[i]]=true;
                update.push_back(i);
            }else{
                ask.push_back(i);
                
            }
        }
        for(int i=1;i<=m;i++){
            if(!changed[i]){
                unchanged.push_back(i);
            }
        }
        for(int i=l;i<=r;i++){
            if(t[i] == 1){
                w[x[i]] = y[i];
            }else{
                to_join[i-l].clear();
                for(int j:update){
                    if(w[x[j]]>=y[i]){
                        to_join[i-l].push_back(x[j]);
                    }
                }
            }    
        }
        sort(ask.begin(),ask.end(),cmp);
        sort(unchanged.begin(),unchanged.end(),cmp2);
        int ptr = 0;
        for(int i:ask){
            while(ptr<unchanged.size() && w[unchanged[ptr]]>=y[i]){
                merge(u[unchanged[ptr]],v[unchanged[ptr]]);
                ptr++;
            }
            int prev_size = s1.size();
            for(int j:to_join[i-l]){
                merge(u[j],v[j]);
            }
            ans[i] = sz[find(x[i])];
            rollback(prev_size);
        }
    }
    for(int i=1;i<=q;i++){
        if(t[i] == 2){
            cout<<ans[i]<<endl;
        }
    }
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(s1.size()>x){
           ~~~~~~~~~^~
bridges.cpp: In function 'int main()':
bridges.cpp:101:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(ptr<unchanged.size() && w[unchanged[ptr]]>=y[i]){
                   ~~~^~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 65 ms 3448 KB Output is correct
4 Correct 37 ms 1528 KB Output is correct
5 Correct 63 ms 3832 KB Output is correct
6 Correct 55 ms 3576 KB Output is correct
7 Correct 57 ms 4400 KB Output is correct
8 Correct 63 ms 3576 KB Output is correct
9 Correct 69 ms 5368 KB Output is correct
10 Correct 65 ms 3704 KB Output is correct
11 Correct 65 ms 3576 KB Output is correct
12 Correct 74 ms 3832 KB Output is correct
13 Correct 72 ms 3704 KB Output is correct
14 Correct 67 ms 3576 KB Output is correct
15 Correct 74 ms 3576 KB Output is correct
16 Correct 65 ms 4856 KB Output is correct
17 Correct 64 ms 4344 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1843 ms 26684 KB Output is correct
2 Correct 1869 ms 29516 KB Output is correct
3 Correct 1884 ms 29444 KB Output is correct
4 Correct 1937 ms 29512 KB Output is correct
5 Correct 1941 ms 29880 KB Output is correct
6 Correct 2621 ms 31304 KB Output is correct
7 Correct 2593 ms 31048 KB Output is correct
8 Correct 2604 ms 31088 KB Output is correct
9 Correct 329 ms 4216 KB Output is correct
10 Correct 1567 ms 30268 KB Output is correct
11 Correct 1491 ms 30132 KB Output is correct
12 Correct 1740 ms 27716 KB Output is correct
13 Correct 1606 ms 30544 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1530 ms 19428 KB Output is correct
2 Correct 1138 ms 12152 KB Output is correct
3 Correct 1741 ms 23236 KB Output is correct
4 Correct 1492 ms 21988 KB Output is correct
5 Correct 337 ms 4216 KB Output is correct
6 Correct 1677 ms 21780 KB Output is correct
7 Correct 1430 ms 21564 KB Output is correct
8 Correct 1240 ms 21476 KB Output is correct
9 Correct 1138 ms 20060 KB Output is correct
10 Correct 1108 ms 19940 KB Output is correct
11 Correct 1051 ms 23036 KB Output is correct
12 Correct 956 ms 22836 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2461 ms 25308 KB Output is correct
2 Correct 342 ms 2936 KB Output is correct
3 Correct 326 ms 3516 KB Output is correct
4 Correct 236 ms 3548 KB Output is correct
5 Correct 1404 ms 25352 KB Output is correct
6 Correct 2369 ms 25484 KB Output is correct
7 Correct 1391 ms 25560 KB Output is correct
8 Correct 1295 ms 24576 KB Output is correct
9 Correct 1280 ms 24392 KB Output is correct
10 Correct 1275 ms 24744 KB Output is correct
11 Correct 1823 ms 25276 KB Output is correct
12 Correct 1882 ms 25376 KB Output is correct
13 Correct 1892 ms 25272 KB Output is correct
14 Correct 1336 ms 25508 KB Output is correct
15 Correct 1427 ms 25516 KB Output is correct
16 Correct 2377 ms 25684 KB Output is correct
17 Correct 2461 ms 25852 KB Output is correct
18 Correct 2545 ms 25728 KB Output is correct
19 Correct 2377 ms 25832 KB Output is correct
20 Correct 2036 ms 25644 KB Output is correct
21 Correct 2040 ms 25604 KB Output is correct
22 Correct 2279 ms 25432 KB Output is correct
23 Correct 1455 ms 23424 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1843 ms 26684 KB Output is correct
2 Correct 1869 ms 29516 KB Output is correct
3 Correct 1884 ms 29444 KB Output is correct
4 Correct 1937 ms 29512 KB Output is correct
5 Correct 1941 ms 29880 KB Output is correct
6 Correct 2621 ms 31304 KB Output is correct
7 Correct 2593 ms 31048 KB Output is correct
8 Correct 2604 ms 31088 KB Output is correct
9 Correct 329 ms 4216 KB Output is correct
10 Correct 1567 ms 30268 KB Output is correct
11 Correct 1491 ms 30132 KB Output is correct
12 Correct 1740 ms 27716 KB Output is correct
13 Correct 1606 ms 30544 KB Output is correct
14 Correct 1530 ms 19428 KB Output is correct
15 Correct 1138 ms 12152 KB Output is correct
16 Correct 1741 ms 23236 KB Output is correct
17 Correct 1492 ms 21988 KB Output is correct
18 Correct 337 ms 4216 KB Output is correct
19 Correct 1677 ms 21780 KB Output is correct
20 Correct 1430 ms 21564 KB Output is correct
21 Correct 1240 ms 21476 KB Output is correct
22 Correct 1138 ms 20060 KB Output is correct
23 Correct 1108 ms 19940 KB Output is correct
24 Correct 1051 ms 23036 KB Output is correct
25 Correct 956 ms 22836 KB Output is correct
26 Correct 1993 ms 29384 KB Output is correct
27 Correct 2325 ms 30964 KB Output is correct
28 Correct 1931 ms 29516 KB Output is correct
29 Correct 1458 ms 28872 KB Output is correct
30 Correct 2187 ms 31084 KB Output is correct
31 Correct 2226 ms 30980 KB Output is correct
32 Correct 2240 ms 31028 KB Output is correct
33 Correct 1940 ms 29252 KB Output is correct
34 Correct 1945 ms 29396 KB Output is correct
35 Correct 1962 ms 29492 KB Output is correct
36 Correct 1540 ms 29092 KB Output is correct
37 Correct 1517 ms 29000 KB Output is correct
38 Correct 1497 ms 29076 KB Output is correct
39 Correct 1419 ms 27688 KB Output is correct
40 Correct 1395 ms 27580 KB Output is correct
41 Correct 1395 ms 27544 KB Output is correct
42 Correct 1228 ms 29644 KB Output is correct
43 Correct 1214 ms 29644 KB Output is correct
44 Correct 1217 ms 29532 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 65 ms 3448 KB Output is correct
4 Correct 37 ms 1528 KB Output is correct
5 Correct 63 ms 3832 KB Output is correct
6 Correct 55 ms 3576 KB Output is correct
7 Correct 57 ms 4400 KB Output is correct
8 Correct 63 ms 3576 KB Output is correct
9 Correct 69 ms 5368 KB Output is correct
10 Correct 65 ms 3704 KB Output is correct
11 Correct 65 ms 3576 KB Output is correct
12 Correct 74 ms 3832 KB Output is correct
13 Correct 72 ms 3704 KB Output is correct
14 Correct 67 ms 3576 KB Output is correct
15 Correct 74 ms 3576 KB Output is correct
16 Correct 65 ms 4856 KB Output is correct
17 Correct 64 ms 4344 KB Output is correct
18 Correct 1843 ms 26684 KB Output is correct
19 Correct 1869 ms 29516 KB Output is correct
20 Correct 1884 ms 29444 KB Output is correct
21 Correct 1937 ms 29512 KB Output is correct
22 Correct 1941 ms 29880 KB Output is correct
23 Correct 2621 ms 31304 KB Output is correct
24 Correct 2593 ms 31048 KB Output is correct
25 Correct 2604 ms 31088 KB Output is correct
26 Correct 329 ms 4216 KB Output is correct
27 Correct 1567 ms 30268 KB Output is correct
28 Correct 1491 ms 30132 KB Output is correct
29 Correct 1740 ms 27716 KB Output is correct
30 Correct 1606 ms 30544 KB Output is correct
31 Correct 1530 ms 19428 KB Output is correct
32 Correct 1138 ms 12152 KB Output is correct
33 Correct 1741 ms 23236 KB Output is correct
34 Correct 1492 ms 21988 KB Output is correct
35 Correct 337 ms 4216 KB Output is correct
36 Correct 1677 ms 21780 KB Output is correct
37 Correct 1430 ms 21564 KB Output is correct
38 Correct 1240 ms 21476 KB Output is correct
39 Correct 1138 ms 20060 KB Output is correct
40 Correct 1108 ms 19940 KB Output is correct
41 Correct 1051 ms 23036 KB Output is correct
42 Correct 956 ms 22836 KB Output is correct
43 Correct 2461 ms 25308 KB Output is correct
44 Correct 342 ms 2936 KB Output is correct
45 Correct 326 ms 3516 KB Output is correct
46 Correct 236 ms 3548 KB Output is correct
47 Correct 1404 ms 25352 KB Output is correct
48 Correct 2369 ms 25484 KB Output is correct
49 Correct 1391 ms 25560 KB Output is correct
50 Correct 1295 ms 24576 KB Output is correct
51 Correct 1280 ms 24392 KB Output is correct
52 Correct 1275 ms 24744 KB Output is correct
53 Correct 1823 ms 25276 KB Output is correct
54 Correct 1882 ms 25376 KB Output is correct
55 Correct 1892 ms 25272 KB Output is correct
56 Correct 1336 ms 25508 KB Output is correct
57 Correct 1427 ms 25516 KB Output is correct
58 Correct 2377 ms 25684 KB Output is correct
59 Correct 2461 ms 25852 KB Output is correct
60 Correct 2545 ms 25728 KB Output is correct
61 Correct 2377 ms 25832 KB Output is correct
62 Correct 2036 ms 25644 KB Output is correct
63 Correct 2040 ms 25604 KB Output is correct
64 Correct 2279 ms 25432 KB Output is correct
65 Correct 1455 ms 23424 KB Output is correct
66 Correct 1993 ms 29384 KB Output is correct
67 Correct 2325 ms 30964 KB Output is correct
68 Correct 1931 ms 29516 KB Output is correct
69 Correct 1458 ms 28872 KB Output is correct
70 Correct 2187 ms 31084 KB Output is correct
71 Correct 2226 ms 30980 KB Output is correct
72 Correct 2240 ms 31028 KB Output is correct
73 Correct 1940 ms 29252 KB Output is correct
74 Correct 1945 ms 29396 KB Output is correct
75 Correct 1962 ms 29492 KB Output is correct
76 Correct 1540 ms 29092 KB Output is correct
77 Correct 1517 ms 29000 KB Output is correct
78 Correct 1497 ms 29076 KB Output is correct
79 Correct 1419 ms 27688 KB Output is correct
80 Correct 1395 ms 27580 KB Output is correct
81 Correct 1395 ms 27544 KB Output is correct
82 Correct 1228 ms 29644 KB Output is correct
83 Correct 1214 ms 29644 KB Output is correct
84 Correct 1217 ms 29532 KB Output is correct
85 Correct 2792 ms 31688 KB Output is correct
86 Correct 358 ms 7344 KB Output is correct
87 Correct 275 ms 8980 KB Output is correct
88 Correct 1764 ms 31516 KB Output is correct
89 Correct 2804 ms 31616 KB Output is correct
90 Correct 1827 ms 31872 KB Output is correct
91 Correct 1998 ms 29256 KB Output is correct
92 Correct 1997 ms 29256 KB Output is correct
93 Correct 2711 ms 30912 KB Output is correct
94 Correct 2384 ms 31104 KB Output is correct
95 Correct 2338 ms 31164 KB Output is correct
96 Correct 2694 ms 32596 KB Output is correct
97 Correct 1485 ms 28164 KB Output is correct
98 Correct 1438 ms 31512 KB Output is correct
99 Correct 2818 ms 31948 KB Output is correct
100 Correct 2797 ms 31584 KB Output is correct
101 Correct 2900 ms 31960 KB Output is correct
102 Correct 2870 ms 31876 KB Output is correct
103 Correct 2943 ms 32984 KB Output is correct
104 Correct 2924 ms 32884 KB Output is correct
105 Correct 2245 ms 32584 KB Output is correct
106 Correct 1816 ms 32224 KB Output is correct
107 Correct 2246 ms 29468 KB Output is correct
108 Correct 2799 ms 31728 KB Output is correct
109 Correct 2045 ms 29428 KB Output is correct