oj.uz

Submission #140651

# Submission time Handle Problem Language Result Execution time Memory
140651 2019-08-04T04:04:11 Z HellAngel Bridges (APIO19_bridges) C++14
100 / 100
 2344 ms 34972 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 1532 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 36 ms 2168 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 23 ms 2168 KB Output is correct
6 Correct 19 ms 2040 KB Output is correct
7 Correct 24 ms 2016 KB Output is correct
8 Correct 23 ms 2040 KB Output is correct
9 Correct 32 ms 2024 KB Output is correct
10 Correct 26 ms 2016 KB Output is correct
11 Correct 27 ms 2040 KB Output is correct
12 Correct 31 ms 2040 KB Output is correct
13 Correct 32 ms 2140 KB Output is correct
14 Correct 29 ms 2168 KB Output is correct
15 Correct 30 ms 2296 KB Output is correct
16 Correct 25 ms 2100 KB Output is correct
17 Correct 25 ms 2040 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1379 ms 10240 KB Output is correct
2 Correct 1344 ms 10256 KB Output is correct
3 Correct 1336 ms 10076 KB Output is correct
4 Correct 1380 ms 9984 KB Output is correct
5 Correct 1298 ms 10020 KB Output is correct
6 Correct 2197 ms 9724 KB Output is correct
7 Correct 2084 ms 9916 KB Output is correct
8 Correct 2023 ms 9704 KB Output is correct
9 Correct 106 ms 3964 KB Output is correct
10 Correct 1550 ms 9900 KB Output is correct
11 Correct 1435 ms 10056 KB Output is correct
12 Correct 941 ms 8792 KB Output is correct
13 Correct 1073 ms 10604 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1028 ms 8128 KB Output is correct
2 Correct 853 ms 5360 KB Output is correct
3 Correct 1198 ms 8088 KB Output is correct
4 Correct 995 ms 7888 KB Output is correct
5 Correct 107 ms 4128 KB Output is correct
6 Correct 1121 ms 8072 KB Output is correct
7 Correct 864 ms 7932 KB Output is correct
8 Correct 750 ms 7864 KB Output is correct
9 Correct 507 ms 7184 KB Output is correct
10 Correct 441 ms 7056 KB Output is correct
11 Correct 714 ms 8244 KB Output is correct
12 Correct 600 ms 8188 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1590 ms 12148 KB Output is correct
2 Correct 107 ms 3956 KB Output is correct
3 Correct 116 ms 9588 KB Output is correct
4 Correct 106 ms 9624 KB Output is correct
5 Correct 1477 ms 12004 KB Output is correct
6 Correct 1533 ms 12148 KB Output is correct
7 Correct 1490 ms 12032 KB Output is correct
8 Correct 590 ms 8044 KB Output is correct
9 Correct 591 ms 8104 KB Output is correct
10 Correct 601 ms 8116 KB Output is correct
11 Correct 1022 ms 10608 KB Output is correct
12 Correct 1022 ms 10884 KB Output is correct
13 Correct 1022 ms 10600 KB Output is correct
14 Correct 1475 ms 12036 KB Output is correct
15 Correct 1491 ms 12012 KB Output is correct
16 Correct 1488 ms 11984 KB Output is correct
17 Correct 1424 ms 12032 KB Output is correct
18 Correct 1396 ms 11944 KB Output is correct
19 Correct 1383 ms 15540 KB Output is correct
20 Correct 1147 ms 14288 KB Output is correct
21 Correct 1149 ms 14360 KB Output is correct
22 Correct 1438 ms 15088 KB Output is correct
23 Correct 1198 ms 12976 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1379 ms 10240 KB Output is correct
2 Correct 1344 ms 10256 KB Output is correct
3 Correct 1336 ms 10076 KB Output is correct
4 Correct 1380 ms 9984 KB Output is correct
5 Correct 1298 ms 10020 KB Output is correct
6 Correct 2197 ms 9724 KB Output is correct
7 Correct 2084 ms 9916 KB Output is correct
8 Correct 2023 ms 9704 KB Output is correct
9 Correct 106 ms 3964 KB Output is correct
10 Correct 1550 ms 9900 KB Output is correct
11 Correct 1435 ms 10056 KB Output is correct
12 Correct 941 ms 8792 KB Output is correct
13 Correct 1073 ms 10604 KB Output is correct
14 Correct 1028 ms 8128 KB Output is correct
15 Correct 853 ms 5360 KB Output is correct
16 Correct 1198 ms 8088 KB Output is correct
17 Correct 995 ms 7888 KB Output is correct
18 Correct 107 ms 4128 KB Output is correct
19 Correct 1121 ms 8072 KB Output is correct
20 Correct 864 ms 7932 KB Output is correct
21 Correct 750 ms 7864 KB Output is correct
22 Correct 507 ms 7184 KB Output is correct
23 Correct 441 ms 7056 KB Output is correct
24 Correct 714 ms 8244 KB Output is correct
25 Correct 600 ms 8188 KB Output is correct
26 Correct 1533 ms 9928 KB Output is correct
27 Correct 1989 ms 13288 KB Output is correct
28 Correct 1738 ms 18832 KB Output is correct
29 Correct 1217 ms 12780 KB Output is correct
30 Correct 1966 ms 9960 KB Output is correct
31 Correct 1974 ms 10028 KB Output is correct
32 Correct 1987 ms 10268 KB Output is correct
33 Correct 1664 ms 10180 KB Output is correct
34 Correct 1697 ms 10248 KB Output is correct
35 Correct 1730 ms 10120 KB Output is correct
36 Correct 1187 ms 9968 KB Output is correct
37 Correct 1177 ms 10068 KB Output is correct
38 Correct 1140 ms 10160 KB Output is correct
39 Correct 793 ms 9076 KB Output is correct
40 Correct 815 ms 9096 KB Output is correct
41 Correct 788 ms 9156 KB Output is correct
42 Correct 782 ms 10596 KB Output is correct
43 Correct 786 ms 10604 KB Output is correct
44 Correct 781 ms 10596 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1532 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 36 ms 2168 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 23 ms 2168 KB Output is correct
6 Correct 19 ms 2040 KB Output is correct
7 Correct 24 ms 2016 KB Output is correct
8 Correct 23 ms 2040 KB Output is correct
9 Correct 32 ms 2024 KB Output is correct
10 Correct 26 ms 2016 KB Output is correct
11 Correct 27 ms 2040 KB Output is correct
12 Correct 31 ms 2040 KB Output is correct
13 Correct 32 ms 2140 KB Output is correct
14 Correct 29 ms 2168 KB Output is correct
15 Correct 30 ms 2296 KB Output is correct
16 Correct 25 ms 2100 KB Output is correct
17 Correct 25 ms 2040 KB Output is correct
18 Correct 1379 ms 10240 KB Output is correct
19 Correct 1344 ms 10256 KB Output is correct
20 Correct 1336 ms 10076 KB Output is correct
21 Correct 1380 ms 9984 KB Output is correct
22 Correct 1298 ms 10020 KB Output is correct
23 Correct 2197 ms 9724 KB Output is correct
24 Correct 2084 ms 9916 KB Output is correct
25 Correct 2023 ms 9704 KB Output is correct
26 Correct 106 ms 3964 KB Output is correct
27 Correct 1550 ms 9900 KB Output is correct
28 Correct 1435 ms 10056 KB Output is correct
29 Correct 941 ms 8792 KB Output is correct
30 Correct 1073 ms 10604 KB Output is correct
31 Correct 1028 ms 8128 KB Output is correct
32 Correct 853 ms 5360 KB Output is correct
33 Correct 1198 ms 8088 KB Output is correct
34 Correct 995 ms 7888 KB Output is correct
35 Correct 107 ms 4128 KB Output is correct
36 Correct 1121 ms 8072 KB Output is correct
37 Correct 864 ms 7932 KB Output is correct
38 Correct 750 ms 7864 KB Output is correct
39 Correct 507 ms 7184 KB Output is correct
40 Correct 441 ms 7056 KB Output is correct
41 Correct 714 ms 8244 KB Output is correct
42 Correct 600 ms 8188 KB Output is correct
43 Correct 1590 ms 12148 KB Output is correct
44 Correct 107 ms 3956 KB Output is correct
45 Correct 116 ms 9588 KB Output is correct
46 Correct 106 ms 9624 KB Output is correct
47 Correct 1477 ms 12004 KB Output is correct
48 Correct 1533 ms 12148 KB Output is correct
49 Correct 1490 ms 12032 KB Output is correct
50 Correct 590 ms 8044 KB Output is correct
51 Correct 591 ms 8104 KB Output is correct
52 Correct 601 ms 8116 KB Output is correct
53 Correct 1022 ms 10608 KB Output is correct
54 Correct 1022 ms 10884 KB Output is correct
55 Correct 1022 ms 10600 KB Output is correct
56 Correct 1475 ms 12036 KB Output is correct
57 Correct 1491 ms 12012 KB Output is correct
58 Correct 1488 ms 11984 KB Output is correct
59 Correct 1424 ms 12032 KB Output is correct
60 Correct 1396 ms 11944 KB Output is correct
61 Correct 1383 ms 15540 KB Output is correct
62 Correct 1147 ms 14288 KB Output is correct
63 Correct 1149 ms 14360 KB Output is correct
64 Correct 1438 ms 15088 KB Output is correct
65 Correct 1198 ms 12976 KB Output is correct
66 Correct 1533 ms 9928 KB Output is correct
67 Correct 1989 ms 13288 KB Output is correct
68 Correct 1738 ms 18832 KB Output is correct
69 Correct 1217 ms 12780 KB Output is correct
70 Correct 1966 ms 9960 KB Output is correct
71 Correct 1974 ms 10028 KB Output is correct
72 Correct 1987 ms 10268 KB Output is correct
73 Correct 1664 ms 10180 KB Output is correct
74 Correct 1697 ms 10248 KB Output is correct
75 Correct 1730 ms 10120 KB Output is correct
76 Correct 1187 ms 9968 KB Output is correct
77 Correct 1177 ms 10068 KB Output is correct
78 Correct 1140 ms 10160 KB Output is correct
79 Correct 793 ms 9076 KB Output is correct
80 Correct 815 ms 9096 KB Output is correct
81 Correct 788 ms 9156 KB Output is correct
82 Correct 782 ms 10596 KB Output is correct
83 Correct 786 ms 10604 KB Output is correct
84 Correct 781 ms 10596 KB Output is correct
85 Correct 2190 ms 34972 KB Output is correct
86 Correct 148 ms 11960 KB Output is correct
87 Correct 153 ms 11880 KB Output is correct
88 Correct 2103 ms 15796 KB Output is correct
89 Correct 2160 ms 34712 KB Output is correct
90 Correct 2214 ms 15244 KB Output is correct
91 Correct 1625 ms 12764 KB Output is correct
92 Correct 1609 ms 12696 KB Output is correct
93 Correct 2344 ms 11880 KB Output is correct
94 Correct 1764 ms 16392 KB Output is correct
95 Correct 1896 ms 16968 KB Output is correct
96 Correct 1919 ms 15004 KB Output is correct
97 Correct 1620 ms 14600 KB Output is correct
98 Correct 1748 ms 15952 KB Output is correct
99 Correct 2015 ms 33240 KB Output is correct
100 Correct 1941 ms 33176 KB Output is correct
101 Correct 2056 ms 28580 KB Output is correct
102 Correct 2071 ms 28752 KB Output is correct
103 Correct 1906 ms 15280 KB Output is correct
104 Correct 1944 ms 15072 KB Output is correct
105 Correct 1539 ms 15904 KB Output is correct
106 Correct 1338 ms 15652 KB Output is correct
107 Correct 1381 ms 14588 KB Output is correct
108 Correct 2304 ms 27396 KB Output is correct
109 Correct 1853 ms 13732 KB Output is correct