oj.uz

Submission #140763

# Submission time Handle Problem Language Result Execution time Memory
140763 2019-08-05T01:03:41 Z WannnabeIOI Bridges (APIO19_bridges) C++14
100 / 100
 2329 ms 35272 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 50500;
const int M = N + N;
const int Q = N + N;
const int MAGIC = 800;
 
struct Edge {
   int l, r;
   int from, to, lim;
   Edge(int l = 0, int r = 0, int from = 0, int to = 0, int lim = 0) :
      l(l), r(r), from(from), to(to), lim(lim) {}
   bool operator < (const Edge &e) const {
      return lim > e.lim;
   }
};
 
vector<Edge> es;
 
struct Query {
   int from, cost, id;
   Query(int from = 0, int cost = 0, int id = 0) :
      from(from), cost(cost), id(id) {}
   bool operator < (const Query &q) const {
      return cost > q.cost;
   }
};
 
vector<Query> qs;
 
int par[N];
int sz[N];
 
int find(int u) {
   if (par[u] != u) {
      par[u] = find(par[u]);
   }
   return par[u];
}
 
void merge(int u, int v) {
   u = find(u);
   v = find(v);
   if (u ^ v) {
      par[v] = u;
      sz[u] += sz[v];
   }
}
 
int from[M];
int to[M];
int lim[M];
int last[M];
int op[Q];
int ans[Q];
vector<int> g[N];
bool visit[N];
 
struct MyVector {
   int sz = 0;
   int a[N];
   bool has[N];
   void add(int u) {
      if (!has[u]) {
         has[u] = true;
         a[++sz] = u;
      }
   }
   void reset() {
      for (int i = 1; i <= sz; ++i) {
         int u = a[i];
         has[u] = false;
         g[u].clear();
         visit[u] = false;
      }
      sz = 0;
   }
} mv;
 
void dfs(int u, int &ans) {
   visit[u] = true;
   ans += sz[u];
   for (int v : g[u]) {
      if (!visit[v]) {
         dfs(v, ans);
      }
   }
}
 
int main() {
   int n, m;
   scanf("%d %d", &n, &m);
   for (int i = 1; i <= m; ++i) {
      scanf("%d %d %d", from + i, to + i, lim + i);
   }
   int q;
   scanf("%d", &q);
   for (int i = 1; i <= q; ++i) {
      scanf("%d", op + i);
      if (op[i] == 1) {
         int id, nlim;
         scanf("%d %d", &id, &nlim);
         es.emplace_back(last[id], i, from[id], to[id], lim[id]);
         lim[id] = nlim;
         last[id] = i;
      } else {
         int from, cost;
         scanf("%d %d", &from, &cost);
         qs.emplace_back(from, cost, i);
      }
   }
   for (int i = 1; i <= m; ++i) {
      if (last[i] != q) {
         es.emplace_back(last[i], q + 1, from[i], to[i], lim[i]);
      }
   }
   sort(es.begin(), es.end());
   sort(qs.begin(), qs.end());
   for (int l = 0; l < q + 1; l += MAGIC) {
      int r = min(l + MAGIC, q + 1);
      vector<Edge> all_es;
      vector<Edge> cand_es;
      for (auto e : es) {
         if (e.l <= l && r <= e.r) {
            all_es.push_back(e);
         } else if (e.l < r && l < e.r) {
            cand_es.push_back(e);
         }
      }
      vector<Query> cqs;
      for (auto qe : qs) {
         if (l <= qe.id && qe.id < r) {
            cqs.push_back(qe);
         }
      }
      for (int i = 1; i <= n; ++i) {
         par[i] = i;
         sz[i] = 1;
      }
      int ptr = 0;
      for (auto qe : cqs) {
         while (ptr < all_es.size() && all_es[ptr].lim >= qe.cost) {
            merge(all_es[ptr].from, all_es[ptr].to);
            ptr++;
         }
         mv.add(find(qe.from));
         for (auto e : cand_es) {
            if (e.lim >= qe.cost) {
               if (e.l <= qe.id && qe.id < e.r) {
                  int u = find(e.from);
                  int v = find(e.to);
                  mv.add(u);
                  mv.add(v);
                  g[u].push_back(v);
                  g[v].push_back(u);
               }
            } else {
               break;
            }
         }
         dfs(mv.a[1], ans[qe.id]);
         mv.reset();
      }
   }
   for (int i = 1; i <= q; ++i) if (op[i] == 2) {
      printf("%d\n", ans[i]);
   }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:144:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          while (ptr < all_es.size() && all_es[ptr].lim >= qe.cost) {
                 ~~~~^~~~~~~~~~~~~~~
bridges.cpp:94:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d", &n, &m);
    ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:96:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d %d", from + i, to + i, lim + i);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:99:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &q);
    ~~~~~^~~~~~~~~~
bridges.cpp:101:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", op + i);
       ~~~~~^~~~~~~~~~~~~~
bridges.cpp:104:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
          scanf("%d %d", &id, &nlim);
          ~~~~~^~~~~~~~~~~~~~~~~~~~~
bridges.cpp:110:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
          scanf("%d %d", &from, &cost);
          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 36 ms 2040 KB Output is correct
4 Correct 9 ms 1852 KB Output is correct
5 Correct 22 ms 2040 KB Output is correct
6 Correct 20 ms 1984 KB Output is correct
7 Correct 23 ms 1888 KB Output is correct
8 Correct 23 ms 1912 KB Output is correct
9 Correct 30 ms 1916 KB Output is correct
10 Correct 24 ms 1888 KB Output is correct
11 Correct 23 ms 1912 KB Output is correct
12 Correct 28 ms 1912 KB Output is correct
13 Correct 30 ms 2040 KB Output is correct
14 Correct 28 ms 2040 KB Output is correct
15 Correct 26 ms 2040 KB Output is correct
16 Correct 24 ms 2024 KB Output is correct
17 Correct 24 ms 2044 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1340 ms 10020 KB Output is correct
2 Correct 1341 ms 10020 KB Output is correct
3 Correct 1375 ms 9976 KB Output is correct
4 Correct 1268 ms 9904 KB Output is correct
5 Correct 1311 ms 9944 KB Output is correct
6 Correct 2169 ms 9704 KB Output is correct
7 Correct 2084 ms 12084 KB Output is correct
8 Correct 1998 ms 12316 KB Output is correct
9 Correct 106 ms 5224 KB Output is correct
10 Correct 1553 ms 11536 KB Output is correct
11 Correct 1419 ms 11536 KB Output is correct
12 Correct 909 ms 11008 KB Output is correct
13 Correct 1074 ms 13280 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1036 ms 7832 KB Output is correct
2 Correct 845 ms 5156 KB Output is correct
3 Correct 1200 ms 8064 KB Output is correct
4 Correct 1000 ms 7916 KB Output is correct
5 Correct 106 ms 3812 KB Output is correct
6 Correct 1125 ms 7996 KB Output is correct
7 Correct 866 ms 7740 KB Output is correct
8 Correct 727 ms 7764 KB Output is correct
9 Correct 508 ms 7064 KB Output is correct
10 Correct 449 ms 6972 KB Output is correct
11 Correct 706 ms 8176 KB Output is correct
12 Correct 603 ms 8176 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1567 ms 12040 KB Output is correct
2 Correct 106 ms 3816 KB Output is correct
3 Correct 111 ms 9580 KB Output is correct
4 Correct 99 ms 9420 KB Output is correct
5 Correct 1458 ms 11732 KB Output is correct
6 Correct 1471 ms 11824 KB Output is correct
7 Correct 1410 ms 11916 KB Output is correct
8 Correct 602 ms 8056 KB Output is correct
9 Correct 592 ms 7988 KB Output is correct
10 Correct 607 ms 7932 KB Output is correct
11 Correct 1018 ms 10604 KB Output is correct
12 Correct 988 ms 10500 KB Output is correct
13 Correct 1014 ms 10592 KB Output is correct
14 Correct 1415 ms 11828 KB Output is correct
15 Correct 1445 ms 11852 KB Output is correct
16 Correct 1417 ms 11884 KB Output is correct
17 Correct 1417 ms 11860 KB Output is correct
18 Correct 1371 ms 11876 KB Output is correct
19 Correct 1362 ms 11856 KB Output is correct
20 Correct 1137 ms 11108 KB Output is correct
21 Correct 1104 ms 11172 KB Output is correct
22 Correct 1383 ms 11668 KB Output is correct
23 Correct 1139 ms 10848 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1340 ms 10020 KB Output is correct
2 Correct 1341 ms 10020 KB Output is correct
3 Correct 1375 ms 9976 KB Output is correct
4 Correct 1268 ms 9904 KB Output is correct
5 Correct 1311 ms 9944 KB Output is correct
6 Correct 2169 ms 9704 KB Output is correct
7 Correct 2084 ms 12084 KB Output is correct
8 Correct 1998 ms 12316 KB Output is correct
9 Correct 106 ms 5224 KB Output is correct
10 Correct 1553 ms 11536 KB Output is correct
11 Correct 1419 ms 11536 KB Output is correct
12 Correct 909 ms 11008 KB Output is correct
13 Correct 1074 ms 13280 KB Output is correct
14 Correct 1036 ms 7832 KB Output is correct
15 Correct 845 ms 5156 KB Output is correct
16 Correct 1200 ms 8064 KB Output is correct
17 Correct 1000 ms 7916 KB Output is correct
18 Correct 106 ms 3812 KB Output is correct
19 Correct 1125 ms 7996 KB Output is correct
20 Correct 866 ms 7740 KB Output is correct
21 Correct 727 ms 7764 KB Output is correct
22 Correct 508 ms 7064 KB Output is correct
23 Correct 449 ms 6972 KB Output is correct
24 Correct 706 ms 8176 KB Output is correct
25 Correct 603 ms 8176 KB Output is correct
26 Correct 1485 ms 12488 KB Output is correct
27 Correct 2005 ms 15648 KB Output is correct
28 Correct 1773 ms 21196 KB Output is correct
29 Correct 1224 ms 15448 KB Output is correct
30 Correct 1981 ms 12580 KB Output is correct
31 Correct 1988 ms 12564 KB Output is correct
32 Correct 2041 ms 12488 KB Output is correct
33 Correct 1649 ms 12820 KB Output is correct
34 Correct 1697 ms 12736 KB Output is correct
35 Correct 1686 ms 12868 KB Output is correct
36 Correct 1164 ms 12624 KB Output is correct
37 Correct 1201 ms 12732 KB Output is correct
38 Correct 1147 ms 12716 KB Output is correct
39 Correct 826 ms 11708 KB Output is correct
40 Correct 782 ms 11624 KB Output is correct
41 Correct 782 ms 11728 KB Output is correct
42 Correct 795 ms 13288 KB Output is correct
43 Correct 804 ms 13184 KB Output is correct
44 Correct 779 ms 13292 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 36 ms 2040 KB Output is correct
4 Correct 9 ms 1852 KB Output is correct
5 Correct 22 ms 2040 KB Output is correct
6 Correct 20 ms 1984 KB Output is correct
7 Correct 23 ms 1888 KB Output is correct
8 Correct 23 ms 1912 KB Output is correct
9 Correct 30 ms 1916 KB Output is correct
10 Correct 24 ms 1888 KB Output is correct
11 Correct 23 ms 1912 KB Output is correct
12 Correct 28 ms 1912 KB Output is correct
13 Correct 30 ms 2040 KB Output is correct
14 Correct 28 ms 2040 KB Output is correct
15 Correct 26 ms 2040 KB Output is correct
16 Correct 24 ms 2024 KB Output is correct
17 Correct 24 ms 2044 KB Output is correct
18 Correct 1340 ms 10020 KB Output is correct
19 Correct 1341 ms 10020 KB Output is correct
20 Correct 1375 ms 9976 KB Output is correct
21 Correct 1268 ms 9904 KB Output is correct
22 Correct 1311 ms 9944 KB Output is correct
23 Correct 2169 ms 9704 KB Output is correct
24 Correct 2084 ms 12084 KB Output is correct
25 Correct 1998 ms 12316 KB Output is correct
26 Correct 106 ms 5224 KB Output is correct
27 Correct 1553 ms 11536 KB Output is correct
28 Correct 1419 ms 11536 KB Output is correct
29 Correct 909 ms 11008 KB Output is correct
30 Correct 1074 ms 13280 KB Output is correct
31 Correct 1036 ms 7832 KB Output is correct
32 Correct 845 ms 5156 KB Output is correct
33 Correct 1200 ms 8064 KB Output is correct
34 Correct 1000 ms 7916 KB Output is correct
35 Correct 106 ms 3812 KB Output is correct
36 Correct 1125 ms 7996 KB Output is correct
37 Correct 866 ms 7740 KB Output is correct
38 Correct 727 ms 7764 KB Output is correct
39 Correct 508 ms 7064 KB Output is correct
40 Correct 449 ms 6972 KB Output is correct
41 Correct 706 ms 8176 KB Output is correct
42 Correct 603 ms 8176 KB Output is correct
43 Correct 1567 ms 12040 KB Output is correct
44 Correct 106 ms 3816 KB Output is correct
45 Correct 111 ms 9580 KB Output is correct
46 Correct 99 ms 9420 KB Output is correct
47 Correct 1458 ms 11732 KB Output is correct
48 Correct 1471 ms 11824 KB Output is correct
49 Correct 1410 ms 11916 KB Output is correct
50 Correct 602 ms 8056 KB Output is correct
51 Correct 592 ms 7988 KB Output is correct
52 Correct 607 ms 7932 KB Output is correct
53 Correct 1018 ms 10604 KB Output is correct
54 Correct 988 ms 10500 KB Output is correct
55 Correct 1014 ms 10592 KB Output is correct
56 Correct 1415 ms 11828 KB Output is correct
57 Correct 1445 ms 11852 KB Output is correct
58 Correct 1417 ms 11884 KB Output is correct
59 Correct 1417 ms 11860 KB Output is correct
60 Correct 1371 ms 11876 KB Output is correct
61 Correct 1362 ms 11856 KB Output is correct
62 Correct 1137 ms 11108 KB Output is correct
63 Correct 1104 ms 11172 KB Output is correct
64 Correct 1383 ms 11668 KB Output is correct
65 Correct 1139 ms 10848 KB Output is correct
66 Correct 1485 ms 12488 KB Output is correct
67 Correct 2005 ms 15648 KB Output is correct
68 Correct 1773 ms 21196 KB Output is correct
69 Correct 1224 ms 15448 KB Output is correct
70 Correct 1981 ms 12580 KB Output is correct
71 Correct 1988 ms 12564 KB Output is correct
72 Correct 2041 ms 12488 KB Output is correct
73 Correct 1649 ms 12820 KB Output is correct
74 Correct 1697 ms 12736 KB Output is correct
75 Correct 1686 ms 12868 KB Output is correct
76 Correct 1164 ms 12624 KB Output is correct
77 Correct 1201 ms 12732 KB Output is correct
78 Correct 1147 ms 12716 KB Output is correct
79 Correct 826 ms 11708 KB Output is correct
80 Correct 782 ms 11624 KB Output is correct
81 Correct 782 ms 11728 KB Output is correct
82 Correct 795 ms 13288 KB Output is correct
83 Correct 804 ms 13184 KB Output is correct
84 Correct 779 ms 13292 KB Output is correct
85 Correct 2144 ms 35272 KB Output is correct
86 Correct 145 ms 11756 KB Output is correct
87 Correct 155 ms 11820 KB Output is correct
88 Correct 2072 ms 15776 KB Output is correct
89 Correct 2185 ms 34744 KB Output is correct
90 Correct 2094 ms 15208 KB Output is correct
91 Correct 1595 ms 12628 KB Output is correct
92 Correct 1652 ms 12808 KB Output is correct
93 Correct 2329 ms 11832 KB Output is correct
94 Correct 1848 ms 16324 KB Output is correct
95 Correct 1883 ms 16952 KB Output is correct
96 Correct 1900 ms 14868 KB Output is correct
97 Correct 1615 ms 14664 KB Output is correct
98 Correct 1769 ms 15832 KB Output is correct
99 Correct 1987 ms 33268 KB Output is correct
100 Correct 1925 ms 33248 KB Output is correct
101 Correct 2037 ms 28552 KB Output is correct
102 Correct 2024 ms 28924 KB Output is correct
103 Correct 1902 ms 15388 KB Output is correct
104 Correct 1949 ms 15096 KB Output is correct
105 Correct 1539 ms 16016 KB Output is correct
106 Correct 1381 ms 15780 KB Output is correct
107 Correct 1359 ms 14608 KB Output is correct
108 Correct 2197 ms 27256 KB Output is correct
109 Correct 1836 ms 13612 KB Output is correct