oj.uz

Submission #269861

# Submission time Handle Problem Language Result Execution time Memory
269861 2020-08-17T10:52:38 Z evpipis Bridges (APIO19_bridges) C++11
100 / 100
 2641 ms 9272 KB 
#include <bits/stdc++.h>
using namespace std;

#define ASK 2
#define UPD 1

#define pb push_back

const int len = 1e5+5;

int block[len], help_wei[len], vis[len], out[len], cnt, n;
vector<int> sorted, adj[len];

struct{
    int a, b, c;
} edge[len];

struct{
    int tp, a, b;
} query[len];

bool comp_edge(int a, int b){
    return (edge[a].c > edge[b].c);
}

bool comp_ask(int a, int b){
    return (query[a].b > query[b].b);
}

struct{
    int par[len], ran[len];

    void init(){
        for (int i = 1; i <= n; i++)
            par[i] = i, ran[i] = 1;
    }

    int fin(int i){
        if (i == par[i]) return i;
        return par[i] = fin(par[i]);
    }

    void join(int i, int j){
        i = fin(i), j = fin(j);
        if (i == j) return;

        if (ran[i] > ran[j])
            ran[i] += ran[j], par[j] = i;
        else
            ran[j] += ran[i], par[i] = j;
    }

    void print(){
        for (int i = 1; i <= n; i++)
            printf("par[%d] = %d\n", i, fin(i));
    }
} dsu;

int dfs(int u){
    vis[u] = cnt;

    int ans = dsu.ran[u];
    for (auto v: adj[u])
        if (vis[v] != cnt)
            ans += dfs(v);

    return ans;
}

void solve(int l, int r){
    vector<int> ask, spec;

    for (int i = l; i <= r; i++){
        int tp = query[i].tp, a = query[i].a, b = query[i].b;

        if (tp == ASK){
            ask.pb(i);
        }
        else{
            if (!block[a])
                spec.pb(a), block[a] = 1;
        }
    }

    dsu.init();

    sort(ask.begin(), ask.end(), comp_ask);
    for (int i = 0, j = 0; i < ask.size(); i++){
        int st = query[ask[i]].a, lo = query[ask[i]].b;

        while (j < sorted.size() && edge[sorted[j]].c >= lo){
            if (!block[sorted[j]])
                dsu.join(edge[sorted[j]].a, edge[sorted[j]].b);
            j++;
        }

        for (int d = 0; d < spec.size(); d++)
            help_wei[spec[d]] = edge[spec[d]].c;
        for (int d = l; d < ask[i]; d++)
            if (query[d].tp == UPD)
                help_wei[query[d].a] = query[d].b;
        for (int d = 0; d < spec.size(); d++){
            int a = edge[spec[d]].a, b = edge[spec[d]].b, c = help_wei[spec[d]];
            if (c >= lo)
                adj[dsu.fin(a)].pb(dsu.fin(b)), adj[dsu.fin(b)].pb(dsu.fin(a));
        }

        cnt++;
        out[ask[i]] = dfs(dsu.fin(st));

        for (int d = 0; d < spec.size(); d++){
            int a = dsu.fin(edge[spec[d]].a), b = dsu.fin(edge[spec[d]].b), c = help_wei[spec[d]];
            adj[a].clear();
            adj[b].clear();
        }
    }

    for (int i = l; i <= r; i++){
        int tp = query[i].tp, a = query[i].a, b = query[i].b;

        if (tp == UPD)
            edge[a].c = b;
    }

    vector<int> help;
    for (int i = 0; i < sorted.size(); i++)
        if (!block[sorted[i]])
            help.pb(sorted[i]);
    sorted.clear();

    sort(spec.begin(), spec.end(), comp_edge);
    for (int i = 0, j = 0; i < spec.size() || j < help.size(); ){
        if (j == help.size())
            sorted.pb(spec[i++]);
        else if (i == spec.size())
            sorted.pb(help[j++]);
        else if (edge[help[j]].c >= edge[spec[i]].c)
            sorted.pb(help[j++]);
        else
            sorted.pb(spec[i++]);
    }

    for (int i = 0; i < spec.size(); i++)
        block[spec[i]] = 0;
}

int main(){
    int m, q, k;
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= m; i++)
        scanf("%d %d %d", &edge[i].a, &edge[i].b, &edge[i].c);

    scanf("%d", &q);
    for (int i = 0; i < q; i++)
        scanf("%d %d %d", &query[i].tp, &query[i].a, &query[i].b);

    for (int i = 1; i <= m; i++)
        sorted.pb(i);
    sort(sorted.begin(), sorted.end(), comp_edge);

    k = sqrt(q);
    for (int i = 0; i < q; i+=k)
        solve(i, min(i+k-1, q-1));

    for (int i = 0; i < q; i++)
        if (query[i].tp == ASK)
            printf("%d\n", out[i]);
    return 0;
}

Compilation message

bridges.cpp: In function 'void solve(int, int)':
bridges.cpp:74:47: warning: unused variable 'b' [-Wunused-variable]
   74 |         int tp = query[i].tp, a = query[i].a, b = query[i].b;
      |                                               ^
bridges.cpp:88:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i = 0, j = 0; i < ask.size(); i++){
      |                            ~~^~~~~~~~~~~~
bridges.cpp:91:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         while (j < sorted.size() && edge[sorted[j]].c >= lo){
      |                ~~^~~~~~~~~~~~~~~
bridges.cpp:97:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for (int d = 0; d < spec.size(); d++)
      |                         ~~^~~~~~~~~~~~~
bridges.cpp:102:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         for (int d = 0; d < spec.size(); d++){
      |                         ~~^~~~~~~~~~~~~
bridges.cpp:111:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for (int d = 0; d < spec.size(); d++){
      |                         ~~^~~~~~~~~~~~~
bridges.cpp:112:77: warning: unused variable 'c' [-Wunused-variable]
  112 |             int a = dsu.fin(edge[spec[d]].a), b = dsu.fin(edge[spec[d]].b), c = help_wei[spec[d]];
      |                                                                             ^
bridges.cpp:126:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     for (int i = 0; i < sorted.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
bridges.cpp:132:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (int i = 0, j = 0; i < spec.size() || j < help.size(); ){
      |                            ~~^~~~~~~~~~~~~
bridges.cpp:132:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (int i = 0, j = 0; i < spec.size() || j < help.size(); ){
      |                                               ~~^~~~~~~~~~~~~
bridges.cpp:133:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |         if (j == help.size())
      |             ~~^~~~~~~~~~~~~~
bridges.cpp:135:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |         else if (i == spec.size())
      |                  ~~^~~~~~~~~~~~~~
bridges.cpp:143:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |     for (int i = 0; i < spec.size(); i++)
      |                     ~~^~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:149:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  149 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:151:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  151 |         scanf("%d %d %d", &edge[i].a, &edge[i].b, &edge[i].c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:153:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  153 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
bridges.cpp:155:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  155 |         scanf("%d %d %d", &query[i].tp, &query[i].a, &query[i].b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 25 ms 2944 KB Output is correct
4 Correct 9 ms 2816 KB Output is correct
5 Correct 15 ms 2944 KB Output is correct
6 Correct 14 ms 2944 KB Output is correct
7 Correct 15 ms 2944 KB Output is correct
8 Correct 20 ms 2944 KB Output is correct
9 Correct 16 ms 2944 KB Output is correct
10 Correct 17 ms 2816 KB Output is correct
11 Correct 18 ms 2816 KB Output is correct
12 Correct 16 ms 2944 KB Output is correct
13 Correct 17 ms 2944 KB Output is correct
14 Correct 17 ms 2944 KB Output is correct
15 Correct 16 ms 2944 KB Output is correct
16 Correct 15 ms 2904 KB Output is correct
17 Correct 16 ms 2944 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1509 ms 7868 KB Output is correct
2 Correct 1609 ms 7872 KB Output is correct
3 Correct 1476 ms 7844 KB Output is correct
4 Correct 1631 ms 7848 KB Output is correct
5 Correct 1480 ms 7868 KB Output is correct
6 Correct 1695 ms 6752 KB Output is correct
7 Correct 1679 ms 6828 KB Output is correct
8 Correct 1752 ms 6808 KB Output is correct
9 Correct 79 ms 4468 KB Output is correct
10 Correct 1356 ms 7620 KB Output is correct
11 Correct 1438 ms 7740 KB Output is correct
12 Correct 1300 ms 6652 KB Output is correct
13 Correct 1346 ms 7024 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1100 ms 6800 KB Output is correct
2 Correct 706 ms 5112 KB Output is correct
3 Correct 1267 ms 6732 KB Output is correct
4 Correct 1189 ms 6620 KB Output is correct
5 Correct 78 ms 4472 KB Output is correct
6 Correct 1177 ms 6764 KB Output is correct
7 Correct 1050 ms 6708 KB Output is correct
8 Correct 956 ms 6732 KB Output is correct
9 Correct 791 ms 6332 KB Output is correct
10 Correct 787 ms 6280 KB Output is correct
11 Correct 912 ms 6624 KB Output is correct
12 Correct 768 ms 6932 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1731 ms 7408 KB Output is correct
2 Correct 70 ms 4472 KB Output is correct
3 Correct 386 ms 5420 KB Output is correct
4 Correct 245 ms 5376 KB Output is correct
5 Correct 1411 ms 7564 KB Output is correct
6 Correct 1771 ms 7384 KB Output is correct
7 Correct 1516 ms 7376 KB Output is correct
8 Correct 1010 ms 6220 KB Output is correct
9 Correct 1006 ms 6268 KB Output is correct
10 Correct 1022 ms 6252 KB Output is correct
11 Correct 1598 ms 7116 KB Output is correct
12 Correct 1570 ms 6932 KB Output is correct
13 Correct 1637 ms 7004 KB Output is correct
14 Correct 1394 ms 7460 KB Output is correct
15 Correct 1407 ms 7388 KB Output is correct
16 Correct 1977 ms 7656 KB Output is correct
17 Correct 1935 ms 7556 KB Output is correct
18 Correct 1972 ms 7512 KB Output is correct
19 Correct 1940 ms 7508 KB Output is correct
20 Correct 1784 ms 7080 KB Output is correct
21 Correct 1753 ms 7136 KB Output is correct
22 Correct 1825 ms 7352 KB Output is correct
23 Correct 1564 ms 7140 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1509 ms 7868 KB Output is correct
2 Correct 1609 ms 7872 KB Output is correct
3 Correct 1476 ms 7844 KB Output is correct
4 Correct 1631 ms 7848 KB Output is correct
5 Correct 1480 ms 7868 KB Output is correct
6 Correct 1695 ms 6752 KB Output is correct
7 Correct 1679 ms 6828 KB Output is correct
8 Correct 1752 ms 6808 KB Output is correct
9 Correct 79 ms 4468 KB Output is correct
10 Correct 1356 ms 7620 KB Output is correct
11 Correct 1438 ms 7740 KB Output is correct
12 Correct 1300 ms 6652 KB Output is correct
13 Correct 1346 ms 7024 KB Output is correct
14 Correct 1100 ms 6800 KB Output is correct
15 Correct 706 ms 5112 KB Output is correct
16 Correct 1267 ms 6732 KB Output is correct
17 Correct 1189 ms 6620 KB Output is correct
18 Correct 78 ms 4472 KB Output is correct
19 Correct 1177 ms 6764 KB Output is correct
20 Correct 1050 ms 6708 KB Output is correct
21 Correct 956 ms 6732 KB Output is correct
22 Correct 791 ms 6332 KB Output is correct
23 Correct 787 ms 6280 KB Output is correct
24 Correct 912 ms 6624 KB Output is correct
25 Correct 768 ms 6932 KB Output is correct
26 Correct 1616 ms 7912 KB Output is correct
27 Correct 1812 ms 7788 KB Output is correct
28 Correct 1601 ms 8044 KB Output is correct
29 Correct 1316 ms 7820 KB Output is correct
30 Correct 1682 ms 7896 KB Output is correct
31 Correct 1710 ms 7812 KB Output is correct
32 Correct 1790 ms 7804 KB Output is correct
33 Correct 1572 ms 7972 KB Output is correct
34 Correct 1625 ms 7856 KB Output is correct
35 Correct 1543 ms 7812 KB Output is correct
36 Correct 1385 ms 7796 KB Output is correct
37 Correct 1441 ms 7820 KB Output is correct
38 Correct 1433 ms 7872 KB Output is correct
39 Correct 1219 ms 7252 KB Output is correct
40 Correct 1174 ms 7124 KB Output is correct
41 Correct 1164 ms 7212 KB Output is correct
42 Correct 1088 ms 8056 KB Output is correct
43 Correct 1095 ms 7936 KB Output is correct
44 Correct 1096 ms 8196 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 25 ms 2944 KB Output is correct
4 Correct 9 ms 2816 KB Output is correct
5 Correct 15 ms 2944 KB Output is correct
6 Correct 14 ms 2944 KB Output is correct
7 Correct 15 ms 2944 KB Output is correct
8 Correct 20 ms 2944 KB Output is correct
9 Correct 16 ms 2944 KB Output is correct
10 Correct 17 ms 2816 KB Output is correct
11 Correct 18 ms 2816 KB Output is correct
12 Correct 16 ms 2944 KB Output is correct
13 Correct 17 ms 2944 KB Output is correct
14 Correct 17 ms 2944 KB Output is correct
15 Correct 16 ms 2944 KB Output is correct
16 Correct 15 ms 2904 KB Output is correct
17 Correct 16 ms 2944 KB Output is correct
18 Correct 1509 ms 7868 KB Output is correct
19 Correct 1609 ms 7872 KB Output is correct
20 Correct 1476 ms 7844 KB Output is correct
21 Correct 1631 ms 7848 KB Output is correct
22 Correct 1480 ms 7868 KB Output is correct
23 Correct 1695 ms 6752 KB Output is correct
24 Correct 1679 ms 6828 KB Output is correct
25 Correct 1752 ms 6808 KB Output is correct
26 Correct 79 ms 4468 KB Output is correct
27 Correct 1356 ms 7620 KB Output is correct
28 Correct 1438 ms 7740 KB Output is correct
29 Correct 1300 ms 6652 KB Output is correct
30 Correct 1346 ms 7024 KB Output is correct
31 Correct 1100 ms 6800 KB Output is correct
32 Correct 706 ms 5112 KB Output is correct
33 Correct 1267 ms 6732 KB Output is correct
34 Correct 1189 ms 6620 KB Output is correct
35 Correct 78 ms 4472 KB Output is correct
36 Correct 1177 ms 6764 KB Output is correct
37 Correct 1050 ms 6708 KB Output is correct
38 Correct 956 ms 6732 KB Output is correct
39 Correct 791 ms 6332 KB Output is correct
40 Correct 787 ms 6280 KB Output is correct
41 Correct 912 ms 6624 KB Output is correct
42 Correct 768 ms 6932 KB Output is correct
43 Correct 1731 ms 7408 KB Output is correct
44 Correct 70 ms 4472 KB Output is correct
45 Correct 386 ms 5420 KB Output is correct
46 Correct 245 ms 5376 KB Output is correct
47 Correct 1411 ms 7564 KB Output is correct
48 Correct 1771 ms 7384 KB Output is correct
49 Correct 1516 ms 7376 KB Output is correct
50 Correct 1010 ms 6220 KB Output is correct
51 Correct 1006 ms 6268 KB Output is correct
52 Correct 1022 ms 6252 KB Output is correct
53 Correct 1598 ms 7116 KB Output is correct
54 Correct 1570 ms 6932 KB Output is correct
55 Correct 1637 ms 7004 KB Output is correct
56 Correct 1394 ms 7460 KB Output is correct
57 Correct 1407 ms 7388 KB Output is correct
58 Correct 1977 ms 7656 KB Output is correct
59 Correct 1935 ms 7556 KB Output is correct
60 Correct 1972 ms 7512 KB Output is correct
61 Correct 1940 ms 7508 KB Output is correct
62 Correct 1784 ms 7080 KB Output is correct
63 Correct 1753 ms 7136 KB Output is correct
64 Correct 1825 ms 7352 KB Output is correct
65 Correct 1564 ms 7140 KB Output is correct
66 Correct 1616 ms 7912 KB Output is correct
67 Correct 1812 ms 7788 KB Output is correct
68 Correct 1601 ms 8044 KB Output is correct
69 Correct 1316 ms 7820 KB Output is correct
70 Correct 1682 ms 7896 KB Output is correct
71 Correct 1710 ms 7812 KB Output is correct
72 Correct 1790 ms 7804 KB Output is correct
73 Correct 1572 ms 7972 KB Output is correct
74 Correct 1625 ms 7856 KB Output is correct
75 Correct 1543 ms 7812 KB Output is correct
76 Correct 1385 ms 7796 KB Output is correct
77 Correct 1441 ms 7820 KB Output is correct
78 Correct 1433 ms 7872 KB Output is correct
79 Correct 1219 ms 7252 KB Output is correct
80 Correct 1174 ms 7124 KB Output is correct
81 Correct 1164 ms 7212 KB Output is correct
82 Correct 1088 ms 8056 KB Output is correct
83 Correct 1095 ms 7936 KB Output is correct
84 Correct 1096 ms 8196 KB Output is correct
85 Correct 2530 ms 9204 KB Output is correct
86 Correct 422 ms 6280 KB Output is correct
87 Correct 258 ms 6152 KB Output is correct
88 Correct 2028 ms 8936 KB Output is correct
89 Correct 2439 ms 9208 KB Output is correct
90 Correct 2138 ms 8360 KB Output is correct
91 Correct 1576 ms 7840 KB Output is correct
92 Correct 1654 ms 7880 KB Output is correct
93 Correct 1721 ms 7060 KB Output is correct
94 Correct 2281 ms 8784 KB Output is correct
95 Correct 2152 ms 8744 KB Output is correct
96 Correct 2177 ms 7720 KB Output is correct
97 Correct 1657 ms 7928 KB Output is correct
98 Correct 1764 ms 8748 KB Output is correct
99 Correct 2599 ms 9180 KB Output is correct
100 Correct 2587 ms 9256 KB Output is correct
101 Correct 2641 ms 9272 KB Output is correct
102 Correct 2493 ms 9232 KB Output is correct
103 Correct 2350 ms 7564 KB Output is correct
104 Correct 2354 ms 7584 KB Output is correct
105 Correct 2017 ms 8128 KB Output is correct
106 Correct 1750 ms 7940 KB Output is correct
107 Correct 1993 ms 7620 KB Output is correct
108 Correct 2414 ms 8120 KB Output is correct
109 Correct 2124 ms 7456 KB Output is correct