oj.uz

Submission #269885

# Submission time Handle Problem Language Result Execution time Memory
269885 2020-08-17T11:01:42 Z evpipis Bridges (APIO19_bridges) C++11
100 / 100
 2554 ms 9372 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(m+n);
    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 2816 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 17 ms 2944 KB Output is correct
4 Correct 7 ms 2848 KB Output is correct
5 Correct 10 ms 2944 KB Output is correct
6 Correct 10 ms 2944 KB Output is correct
7 Correct 11 ms 2944 KB Output is correct
8 Correct 11 ms 2944 KB Output is correct
9 Correct 11 ms 2944 KB Output is correct
10 Correct 11 ms 2816 KB Output is correct
11 Correct 13 ms 2944 KB Output is correct
12 Correct 11 ms 2944 KB Output is correct
13 Correct 13 ms 2944 KB Output is correct
14 Correct 13 ms 2944 KB Output is correct
15 Correct 15 ms 2944 KB Output is correct
16 Correct 12 ms 2944 KB Output is correct
17 Correct 11 ms 2944 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1538 ms 7916 KB Output is correct
2 Correct 1412 ms 8084 KB Output is correct
3 Correct 1508 ms 7976 KB Output is correct
4 Correct 1446 ms 7932 KB Output is correct
5 Correct 1403 ms 8036 KB Output is correct
6 Correct 1641 ms 6856 KB Output is correct
7 Correct 1617 ms 6908 KB Output is correct
8 Correct 1749 ms 6788 KB Output is correct
9 Correct 63 ms 4472 KB Output is correct
10 Correct 1414 ms 7760 KB Output is correct
11 Correct 1382 ms 7880 KB Output is correct
12 Correct 1157 ms 6976 KB Output is correct
13 Correct 1173 ms 7168 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1136 ms 6876 KB Output is correct
2 Correct 507 ms 5112 KB Output is correct
3 Correct 1249 ms 7048 KB Output is correct
4 Correct 1143 ms 6840 KB Output is correct
5 Correct 55 ms 4472 KB Output is correct
6 Correct 1158 ms 6884 KB Output is correct
7 Correct 1140 ms 6720 KB Output is correct
8 Correct 987 ms 6964 KB Output is correct
9 Correct 857 ms 6468 KB Output is correct
10 Correct 821 ms 6408 KB Output is correct
11 Correct 867 ms 6668 KB Output is correct
12 Correct 812 ms 6956 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1443 ms 7660 KB Output is correct
2 Correct 53 ms 4472 KB Output is correct
3 Correct 187 ms 5376 KB Output is correct
4 Correct 114 ms 5460 KB Output is correct
5 Correct 1200 ms 7480 KB Output is correct
6 Correct 1491 ms 7712 KB Output is correct
7 Correct 1170 ms 7468 KB Output is correct
8 Correct 993 ms 6332 KB Output is correct
9 Correct 977 ms 6336 KB Output is correct
10 Correct 1010 ms 6228 KB Output is correct
11 Correct 1435 ms 7244 KB Output is correct
12 Correct 1457 ms 6904 KB Output is correct
13 Correct 1433 ms 7016 KB Output is correct
14 Correct 1091 ms 7500 KB Output is correct
15 Correct 1202 ms 7376 KB Output is correct
16 Correct 1572 ms 7424 KB Output is correct
17 Correct 1590 ms 7632 KB Output is correct
18 Correct 1607 ms 7632 KB Output is correct
19 Correct 1591 ms 7576 KB Output is correct
20 Correct 1501 ms 7056 KB Output is correct
21 Correct 1530 ms 7164 KB Output is correct
22 Correct 1573 ms 7476 KB Output is correct
23 Correct 1386 ms 6932 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1538 ms 7916 KB Output is correct
2 Correct 1412 ms 8084 KB Output is correct
3 Correct 1508 ms 7976 KB Output is correct
4 Correct 1446 ms 7932 KB Output is correct
5 Correct 1403 ms 8036 KB Output is correct
6 Correct 1641 ms 6856 KB Output is correct
7 Correct 1617 ms 6908 KB Output is correct
8 Correct 1749 ms 6788 KB Output is correct
9 Correct 63 ms 4472 KB Output is correct
10 Correct 1414 ms 7760 KB Output is correct
11 Correct 1382 ms 7880 KB Output is correct
12 Correct 1157 ms 6976 KB Output is correct
13 Correct 1173 ms 7168 KB Output is correct
14 Correct 1136 ms 6876 KB Output is correct
15 Correct 507 ms 5112 KB Output is correct
16 Correct 1249 ms 7048 KB Output is correct
17 Correct 1143 ms 6840 KB Output is correct
18 Correct 55 ms 4472 KB Output is correct
19 Correct 1158 ms 6884 KB Output is correct
20 Correct 1140 ms 6720 KB Output is correct
21 Correct 987 ms 6964 KB Output is correct
22 Correct 857 ms 6468 KB Output is correct
23 Correct 821 ms 6408 KB Output is correct
24 Correct 867 ms 6668 KB Output is correct
25 Correct 812 ms 6956 KB Output is correct
26 Correct 1563 ms 8052 KB Output is correct
27 Correct 1677 ms 7800 KB Output is correct
28 Correct 1554 ms 8092 KB Output is correct
29 Correct 1473 ms 7760 KB Output is correct
30 Correct 1746 ms 8144 KB Output is correct
31 Correct 1683 ms 8044 KB Output is correct
32 Correct 1696 ms 8124 KB Output is correct
33 Correct 1560 ms 8060 KB Output is correct
34 Correct 1564 ms 7892 KB Output is correct
35 Correct 1597 ms 7904 KB Output is correct
36 Correct 1394 ms 7900 KB Output is correct
37 Correct 1490 ms 7824 KB Output is correct
38 Correct 1385 ms 8116 KB Output is correct
39 Correct 1191 ms 7204 KB Output is correct
40 Correct 1198 ms 7116 KB Output is correct
41 Correct 1211 ms 7096 KB Output is correct
42 Correct 1129 ms 8068 KB Output is correct
43 Correct 1104 ms 7952 KB Output is correct
44 Correct 1104 ms 8044 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 17 ms 2944 KB Output is correct
4 Correct 7 ms 2848 KB Output is correct
5 Correct 10 ms 2944 KB Output is correct
6 Correct 10 ms 2944 KB Output is correct
7 Correct 11 ms 2944 KB Output is correct
8 Correct 11 ms 2944 KB Output is correct
9 Correct 11 ms 2944 KB Output is correct
10 Correct 11 ms 2816 KB Output is correct
11 Correct 13 ms 2944 KB Output is correct
12 Correct 11 ms 2944 KB Output is correct
13 Correct 13 ms 2944 KB Output is correct
14 Correct 13 ms 2944 KB Output is correct
15 Correct 15 ms 2944 KB Output is correct
16 Correct 12 ms 2944 KB Output is correct
17 Correct 11 ms 2944 KB Output is correct
18 Correct 1538 ms 7916 KB Output is correct
19 Correct 1412 ms 8084 KB Output is correct
20 Correct 1508 ms 7976 KB Output is correct
21 Correct 1446 ms 7932 KB Output is correct
22 Correct 1403 ms 8036 KB Output is correct
23 Correct 1641 ms 6856 KB Output is correct
24 Correct 1617 ms 6908 KB Output is correct
25 Correct 1749 ms 6788 KB Output is correct
26 Correct 63 ms 4472 KB Output is correct
27 Correct 1414 ms 7760 KB Output is correct
28 Correct 1382 ms 7880 KB Output is correct
29 Correct 1157 ms 6976 KB Output is correct
30 Correct 1173 ms 7168 KB Output is correct
31 Correct 1136 ms 6876 KB Output is correct
32 Correct 507 ms 5112 KB Output is correct
33 Correct 1249 ms 7048 KB Output is correct
34 Correct 1143 ms 6840 KB Output is correct
35 Correct 55 ms 4472 KB Output is correct
36 Correct 1158 ms 6884 KB Output is correct
37 Correct 1140 ms 6720 KB Output is correct
38 Correct 987 ms 6964 KB Output is correct
39 Correct 857 ms 6468 KB Output is correct
40 Correct 821 ms 6408 KB Output is correct
41 Correct 867 ms 6668 KB Output is correct
42 Correct 812 ms 6956 KB Output is correct
43 Correct 1443 ms 7660 KB Output is correct
44 Correct 53 ms 4472 KB Output is correct
45 Correct 187 ms 5376 KB Output is correct
46 Correct 114 ms 5460 KB Output is correct
47 Correct 1200 ms 7480 KB Output is correct
48 Correct 1491 ms 7712 KB Output is correct
49 Correct 1170 ms 7468 KB Output is correct
50 Correct 993 ms 6332 KB Output is correct
51 Correct 977 ms 6336 KB Output is correct
52 Correct 1010 ms 6228 KB Output is correct
53 Correct 1435 ms 7244 KB Output is correct
54 Correct 1457 ms 6904 KB Output is correct
55 Correct 1433 ms 7016 KB Output is correct
56 Correct 1091 ms 7500 KB Output is correct
57 Correct 1202 ms 7376 KB Output is correct
58 Correct 1572 ms 7424 KB Output is correct
59 Correct 1590 ms 7632 KB Output is correct
60 Correct 1607 ms 7632 KB Output is correct
61 Correct 1591 ms 7576 KB Output is correct
62 Correct 1501 ms 7056 KB Output is correct
63 Correct 1530 ms 7164 KB Output is correct
64 Correct 1573 ms 7476 KB Output is correct
65 Correct 1386 ms 6932 KB Output is correct
66 Correct 1563 ms 8052 KB Output is correct
67 Correct 1677 ms 7800 KB Output is correct
68 Correct 1554 ms 8092 KB Output is correct
69 Correct 1473 ms 7760 KB Output is correct
70 Correct 1746 ms 8144 KB Output is correct
71 Correct 1683 ms 8044 KB Output is correct
72 Correct 1696 ms 8124 KB Output is correct
73 Correct 1560 ms 8060 KB Output is correct
74 Correct 1564 ms 7892 KB Output is correct
75 Correct 1597 ms 7904 KB Output is correct
76 Correct 1394 ms 7900 KB Output is correct
77 Correct 1490 ms 7824 KB Output is correct
78 Correct 1385 ms 8116 KB Output is correct
79 Correct 1191 ms 7204 KB Output is correct
80 Correct 1198 ms 7116 KB Output is correct
81 Correct 1211 ms 7096 KB Output is correct
82 Correct 1129 ms 8068 KB Output is correct
83 Correct 1104 ms 7952 KB Output is correct
84 Correct 1104 ms 8044 KB Output is correct
85 Correct 2116 ms 9152 KB Output is correct
86 Correct 216 ms 6200 KB Output is correct
87 Correct 168 ms 6168 KB Output is correct
88 Correct 1849 ms 9028 KB Output is correct
89 Correct 2089 ms 9372 KB Output is correct
90 Correct 1842 ms 8500 KB Output is correct
91 Correct 1561 ms 7984 KB Output is correct
92 Correct 1591 ms 7960 KB Output is correct
93 Correct 1711 ms 7192 KB Output is correct
94 Correct 2035 ms 8992 KB Output is correct
95 Correct 2015 ms 9280 KB Output is correct
96 Correct 2163 ms 7624 KB Output is correct
97 Correct 1501 ms 7980 KB Output is correct
98 Correct 1611 ms 8776 KB Output is correct
99 Correct 2359 ms 9156 KB Output is correct
100 Correct 2554 ms 9192 KB Output is correct
101 Correct 2337 ms 9184 KB Output is correct
102 Correct 2548 ms 9180 KB Output is correct
103 Correct 2187 ms 7592 KB Output is correct
104 Correct 2158 ms 7732 KB Output is correct
105 Correct 1786 ms 8036 KB Output is correct
106 Correct 1672 ms 7844 KB Output is correct
107 Correct 1822 ms 7480 KB Output is correct
108 Correct 2190 ms 7876 KB Output is correct
109 Correct 2008 ms 7484 KB Output is correct