oj.uz

Submission #523197

# Submission time Handle Problem Language Result Execution time Memory
523197 2022-02-07T07:45:32 Z LptN21 Bridges (APIO19_bridges) C++14
100 / 100
 2478 ms 41516 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL);
#define PI acos(-1.0)
#define eps 1e-9
#define FF first
#define SS second
// VECTOR (6)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define uniq(v) sort(all( (v) )), (v).resize( unique(all( (v) )) - (v).begin() );
// BIT (6)
#define CNTBIT(x) __builtin_popcountll(x)
#define ODDBIT(x) __builtin_parityll(x)
#define MASK(i) (1LL<<(i))
#define BIT(x, i) (((x)>>(i))&1)
#define SUBSET(big, small) (((big)&(small))==(small))
#define MINBIT(x) (x)&(-x)
#define FIRSTBIT(x) __builtin_ctzll(x)
//typedef
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, int> ii;

/* */
template<class T>
bool minimize(T &a, const T &b) {
    if(a > b) {a = b; return 1;}
    return 0;
}
template<class T>
bool maximize(T &a, const T &b) {
    if(a < b) {a = b; return 1;}
    return 0;
}
/* */

/* CODE BELOW */
const int N = 5e4 + 7, M = 1e5 + 7;
const int oo = 1e9 + 7;
const int MOD = 1e9 + 7;

int n, m, q, t;

const int B = 1000; // size block

struct Edge{
    int u, v, w;
    bool operator<(const Edge &e) const {
        if(w != e.w) return w < e.w;
        if(u != e.u) return u < e.u;
        return v < e.v;
    }
} e[M];

struct Query{int t, u, w;} qry[M];
bool changedEdge[M];
vector<int> careEdge[B + 7];
int ans[M];

//
int dsu[N], vsz[N];
vector<int> rollback;
int root(int u) {
    while(dsu[u] != u) u = dsu[u];
    return u;
}
bool join(int u, int v) {
    if((u=root(u)) == (v=root(v))) return 0;
    if(dsu[u] < dsu[v]) swap(u, v);
    rollback.pb(v);
    vsz[u]+= vsz[v], dsu[v] = u;
    return 1;
}
void goback(int time) {
    while(sz(rollback)>time) {
        int v = rollback.back();
        vsz[dsu[v]]-=vsz[v];
        dsu[v] = v;
        rollback.pop_back();
    }
}
//

void init() {
    iota(dsu+1, dsu+n+1, 1);
    fill(vsz+1, vsz+n+1, 1);
    //rollback.clear();
}

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d%d", &n, &m);
    int u, v, w;
    for(int i=1;i<=m;i++) {
        scanf("%d%d%d", &u, &v, &w);
        e[i] = {u, v, w};
    }
    scanf("%d", &q);
    for(int i=1;i<=q;i++) {
        scanf("%d%d%d", &t, &u, &w);
        qry[i] = {t, u, w};
    }

    for(int r, l=1;l<=q;l = r+1) {
        r = min(q, l+B-1); init();
        vector<int> ask, update, unchanged;
        for(int i=l;i<=r;i++) {
            if(qry[i].t == 1) {
                update.pb(i);
                changedEdge[qry[i].u] = 1;
            } else ask.pb(i);
        }

        for(int i=l;i<=r;i++) {
            if(qry[i].t == 1) {
                e[qry[i].u].w = qry[i].w;
            } else {
                careEdge[i-l+1].clear();
                for(int j:update) {
                    if(e[qry[j].u].w>=qry[i].w) {
                        careEdge[i-l+1].pb(qry[j].u);
                    }
                }
            }
        }
        for(int i=1;i<=m;i++) if(!changedEdge[i]) unchanged.pb(i);

        sort(all(ask), [&] (int x, int y) {return qry[x].w > qry[y].w;});
        sort(all(unchanged), [&] (int x, int y) {return e[x].w > e[y].w;});

        int j = 0;
        for(int i:ask) {
            for(;j<sz(unchanged);j++) {
                int k = unchanged[j];
                if(e[k].w>=qry[i].w) join(e[k].u, e[k].v);
                else break;
            }
            int prvSize = sz(rollback);

            for(int k:careEdge[i-l+1]) {
                //printf("%d | %d %d\n", k, e[k].u, e[k].v);
                join(e[k].u, e[k].v);
            }
            ans[i] = vsz[root(qry[i].u)];
            goback(prvSize);
        }

        for(int i:update) changedEdge[qry[i].u] = 0;
    }

    for(int i=1;i<=q;i++) {
        if(qry[i].t == 2) printf("%d\n", ans[i]);
    }

    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         scanf("%d%d%d", &u, &v, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:105:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
bridges.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         scanf("%d%d%d", &t, &u, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 40 ms 2644 KB Output is correct
4 Correct 6 ms 436 KB Output is correct
5 Correct 43 ms 2756 KB Output is correct
6 Correct 32 ms 2472 KB Output is correct
7 Correct 46 ms 3440 KB Output is correct
8 Correct 42 ms 2580 KB Output is correct
9 Correct 54 ms 4164 KB Output is correct
10 Correct 43 ms 2700 KB Output is correct
11 Correct 43 ms 2504 KB Output is correct
12 Correct 52 ms 2752 KB Output is correct
13 Correct 61 ms 2704 KB Output is correct
14 Correct 50 ms 2604 KB Output is correct
15 Correct 61 ms 2684 KB Output is correct
16 Correct 53 ms 3904 KB Output is correct
17 Correct 48 ms 3392 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1414 ms 38760 KB Output is correct
2 Correct 1410 ms 38904 KB Output is correct
3 Correct 1425 ms 38756 KB Output is correct
4 Correct 1448 ms 38800 KB Output is correct
5 Correct 1436 ms 38880 KB Output is correct
6 Correct 2297 ms 40228 KB Output is correct
7 Correct 2311 ms 40168 KB Output is correct
8 Correct 2325 ms 40268 KB Output is correct
9 Correct 38 ms 2072 KB Output is correct
10 Correct 1448 ms 40372 KB Output is correct
11 Correct 1270 ms 40496 KB Output is correct
12 Correct 1336 ms 36636 KB Output is correct
13 Correct 1299 ms 40120 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1199 ms 21688 KB Output is correct
2 Correct 1144 ms 10308 KB Output is correct
3 Correct 1862 ms 23420 KB Output is correct
4 Correct 1205 ms 21740 KB Output is correct
5 Correct 37 ms 1988 KB Output is correct
6 Correct 1577 ms 21740 KB Output is correct
7 Correct 1265 ms 21440 KB Output is correct
8 Correct 1070 ms 21448 KB Output is correct
9 Correct 835 ms 19648 KB Output is correct
10 Correct 717 ms 19652 KB Output is correct
11 Correct 912 ms 23320 KB Output is correct
12 Correct 766 ms 23288 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1626 ms 37104 KB Output is correct
2 Correct 36 ms 1988 KB Output is correct
3 Correct 185 ms 2564 KB Output is correct
4 Correct 79 ms 2544 KB Output is correct
5 Correct 855 ms 37100 KB Output is correct
6 Correct 1579 ms 37204 KB Output is correct
7 Correct 851 ms 37140 KB Output is correct
8 Correct 800 ms 36016 KB Output is correct
9 Correct 782 ms 36024 KB Output is correct
10 Correct 795 ms 36040 KB Output is correct
11 Correct 1207 ms 36700 KB Output is correct
12 Correct 1186 ms 36700 KB Output is correct
13 Correct 1223 ms 36664 KB Output is correct
14 Correct 823 ms 37104 KB Output is correct
15 Correct 864 ms 37136 KB Output is correct
16 Correct 1657 ms 37088 KB Output is correct
17 Correct 1611 ms 37092 KB Output is correct
18 Correct 1626 ms 37192 KB Output is correct
19 Correct 1630 ms 37088 KB Output is correct
20 Correct 1363 ms 36848 KB Output is correct
21 Correct 1315 ms 36852 KB Output is correct
22 Correct 1547 ms 37076 KB Output is correct
23 Correct 953 ms 36868 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1414 ms 38760 KB Output is correct
2 Correct 1410 ms 38904 KB Output is correct
3 Correct 1425 ms 38756 KB Output is correct
4 Correct 1448 ms 38800 KB Output is correct
5 Correct 1436 ms 38880 KB Output is correct
6 Correct 2297 ms 40228 KB Output is correct
7 Correct 2311 ms 40168 KB Output is correct
8 Correct 2325 ms 40268 KB Output is correct
9 Correct 38 ms 2072 KB Output is correct
10 Correct 1448 ms 40372 KB Output is correct
11 Correct 1270 ms 40496 KB Output is correct
12 Correct 1336 ms 36636 KB Output is correct
13 Correct 1299 ms 40120 KB Output is correct
14 Correct 1199 ms 21688 KB Output is correct
15 Correct 1144 ms 10308 KB Output is correct
16 Correct 1862 ms 23420 KB Output is correct
17 Correct 1205 ms 21740 KB Output is correct
18 Correct 37 ms 1988 KB Output is correct
19 Correct 1577 ms 21740 KB Output is correct
20 Correct 1265 ms 21440 KB Output is correct
21 Correct 1070 ms 21448 KB Output is correct
22 Correct 835 ms 19648 KB Output is correct
23 Correct 717 ms 19652 KB Output is correct
24 Correct 912 ms 23320 KB Output is correct
25 Correct 766 ms 23288 KB Output is correct
26 Correct 1581 ms 38956 KB Output is correct
27 Correct 1879 ms 40468 KB Output is correct
28 Correct 1497 ms 38692 KB Output is correct
29 Correct 1114 ms 38424 KB Output is correct
30 Correct 1637 ms 40336 KB Output is correct
31 Correct 1683 ms 40396 KB Output is correct
32 Correct 1693 ms 40424 KB Output is correct
33 Correct 1440 ms 38796 KB Output is correct
34 Correct 1452 ms 38664 KB Output is correct
35 Correct 1474 ms 38804 KB Output is correct
36 Correct 1088 ms 38420 KB Output is correct
37 Correct 1090 ms 38484 KB Output is correct
38 Correct 1089 ms 38576 KB Output is correct
39 Correct 897 ms 36744 KB Output is correct
40 Correct 921 ms 36728 KB Output is correct
41 Correct 897 ms 36932 KB Output is correct
42 Correct 887 ms 39772 KB Output is correct
43 Correct 889 ms 39688 KB Output is correct
44 Correct 878 ms 39748 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 40 ms 2644 KB Output is correct
4 Correct 6 ms 436 KB Output is correct
5 Correct 43 ms 2756 KB Output is correct
6 Correct 32 ms 2472 KB Output is correct
7 Correct 46 ms 3440 KB Output is correct
8 Correct 42 ms 2580 KB Output is correct
9 Correct 54 ms 4164 KB Output is correct
10 Correct 43 ms 2700 KB Output is correct
11 Correct 43 ms 2504 KB Output is correct
12 Correct 52 ms 2752 KB Output is correct
13 Correct 61 ms 2704 KB Output is correct
14 Correct 50 ms 2604 KB Output is correct
15 Correct 61 ms 2684 KB Output is correct
16 Correct 53 ms 3904 KB Output is correct
17 Correct 48 ms 3392 KB Output is correct
18 Correct 1414 ms 38760 KB Output is correct
19 Correct 1410 ms 38904 KB Output is correct
20 Correct 1425 ms 38756 KB Output is correct
21 Correct 1448 ms 38800 KB Output is correct
22 Correct 1436 ms 38880 KB Output is correct
23 Correct 2297 ms 40228 KB Output is correct
24 Correct 2311 ms 40168 KB Output is correct
25 Correct 2325 ms 40268 KB Output is correct
26 Correct 38 ms 2072 KB Output is correct
27 Correct 1448 ms 40372 KB Output is correct
28 Correct 1270 ms 40496 KB Output is correct
29 Correct 1336 ms 36636 KB Output is correct
30 Correct 1299 ms 40120 KB Output is correct
31 Correct 1199 ms 21688 KB Output is correct
32 Correct 1144 ms 10308 KB Output is correct
33 Correct 1862 ms 23420 KB Output is correct
34 Correct 1205 ms 21740 KB Output is correct
35 Correct 37 ms 1988 KB Output is correct
36 Correct 1577 ms 21740 KB Output is correct
37 Correct 1265 ms 21440 KB Output is correct
38 Correct 1070 ms 21448 KB Output is correct
39 Correct 835 ms 19648 KB Output is correct
40 Correct 717 ms 19652 KB Output is correct
41 Correct 912 ms 23320 KB Output is correct
42 Correct 766 ms 23288 KB Output is correct
43 Correct 1626 ms 37104 KB Output is correct
44 Correct 36 ms 1988 KB Output is correct
45 Correct 185 ms 2564 KB Output is correct
46 Correct 79 ms 2544 KB Output is correct
47 Correct 855 ms 37100 KB Output is correct
48 Correct 1579 ms 37204 KB Output is correct
49 Correct 851 ms 37140 KB Output is correct
50 Correct 800 ms 36016 KB Output is correct
51 Correct 782 ms 36024 KB Output is correct
52 Correct 795 ms 36040 KB Output is correct
53 Correct 1207 ms 36700 KB Output is correct
54 Correct 1186 ms 36700 KB Output is correct
55 Correct 1223 ms 36664 KB Output is correct
56 Correct 823 ms 37104 KB Output is correct
57 Correct 864 ms 37136 KB Output is correct
58 Correct 1657 ms 37088 KB Output is correct
59 Correct 1611 ms 37092 KB Output is correct
60 Correct 1626 ms 37192 KB Output is correct
61 Correct 1630 ms 37088 KB Output is correct
62 Correct 1363 ms 36848 KB Output is correct
63 Correct 1315 ms 36852 KB Output is correct
64 Correct 1547 ms 37076 KB Output is correct
65 Correct 953 ms 36868 KB Output is correct
66 Correct 1581 ms 38956 KB Output is correct
67 Correct 1879 ms 40468 KB Output is correct
68 Correct 1497 ms 38692 KB Output is correct
69 Correct 1114 ms 38424 KB Output is correct
70 Correct 1637 ms 40336 KB Output is correct
71 Correct 1683 ms 40396 KB Output is correct
72 Correct 1693 ms 40424 KB Output is correct
73 Correct 1440 ms 38796 KB Output is correct
74 Correct 1452 ms 38664 KB Output is correct
75 Correct 1474 ms 38804 KB Output is correct
76 Correct 1088 ms 38420 KB Output is correct
77 Correct 1090 ms 38484 KB Output is correct
78 Correct 1089 ms 38576 KB Output is correct
79 Correct 897 ms 36744 KB Output is correct
80 Correct 921 ms 36728 KB Output is correct
81 Correct 897 ms 36932 KB Output is correct
82 Correct 887 ms 39772 KB Output is correct
83 Correct 889 ms 39688 KB Output is correct
84 Correct 878 ms 39748 KB Output is correct
85 Correct 2174 ms 39808 KB Output is correct
86 Correct 215 ms 4720 KB Output is correct
87 Correct 129 ms 5984 KB Output is correct
88 Correct 1412 ms 41516 KB Output is correct
89 Correct 2186 ms 39964 KB Output is correct
90 Correct 1450 ms 41488 KB Output is correct
91 Correct 1487 ms 38844 KB Output is correct
92 Correct 1458 ms 38760 KB Output is correct
93 Correct 1984 ms 39928 KB Output is correct
94 Correct 1744 ms 39656 KB Output is correct
95 Correct 1841 ms 39624 KB Output is correct
96 Correct 2214 ms 40868 KB Output is correct
97 Correct 1025 ms 37732 KB Output is correct
98 Correct 1124 ms 41392 KB Output is correct
99 Correct 2218 ms 39996 KB Output is correct
100 Correct 2114 ms 39776 KB Output is correct
101 Correct 2187 ms 39748 KB Output is correct
102 Correct 2204 ms 39872 KB Output is correct
103 Correct 2478 ms 41088 KB Output is correct
104 Correct 2453 ms 41116 KB Output is correct
105 Correct 1732 ms 40980 KB Output is correct
106 Correct 1368 ms 41088 KB Output is correct
107 Correct 1569 ms 37512 KB Output is correct
108 Correct 2459 ms 40176 KB Output is correct
109 Correct 1686 ms 41136 KB Output is correct