oj.uz

Submission #120810

# Submission time Handle Problem Language Result Execution time Memory
120810 2019-06-25T14:19:44 Z nvmdava Bridges (APIO19_bridges) C++17
100 / 100
 2506 ms 10048 KB 
#include <bits/stdc++.h>
using namespace std;
#define SIZE 400
#define N 50005
#define M 100005

int ans[M], n, m;
struct Path{
   int w, id, v, u;
   bool act = 0;
   Path(int _v, int _u, int _w, int _id){
      w = _w; v = _v; u = _u; id = _id;
   }
   bool operator<(const Path& rhs) const {
      return w > rhs.w;
   }
};

struct Query{
   int w, id, v;
   Query(int _v, int _w, int _id){
      w = _w; id = _id, v = _v;
   }
   bool operator<(const Query& rhs) const {
      return w > rhs.w;
   }
};

struct Update{
   int id, w, v;
   Update(int _v, int _w, int _id){
      id = _id; v = _v; w = _w;
   }
};

vector<Path> lists;
vector<Update> upd;
vector<Query> que;
int newOrd[M];
vector<int> adj[N];
int p[N], sz[N];

int find(int v){
   if(v == p[v]) return v;
   return p[v] = find(p[v]);
}

void merge(int v, int u){
   v = find(v);
   u = find(u);
   if(v == u) return;
   if(sz[v] > sz[u]) swap(v, u);
   p[v] = u;
   sz[u] += sz[v];
}

bool in[N];

void dfs(int v, int id){
   in[v] = 1;
   ans[id] += sz[v];
   for(int x : adj[v]){
      if(in[x]) continue;
      dfs(x, id);
   }
}

void process(){
   sort(lists.begin(), lists.end());
   for(int i = 0; i < m; i++)
      newOrd[lists[i].id] = i;
   for(int i = 1; i <= n; i++){
      p[i] = i;
      sz[i] = 1;
   }

   reverse(upd.begin(), upd.end());
   for(int i = upd.size() - 1; i >= 0; i--){
      if(lists[newOrd[upd[i].v]].act == 0){
         upd.push_back(Update(upd[i].v, lists[newOrd[upd[i].v]].w, 0));
         lists[newOrd[upd[i].v]].act = 1;
      }
   }

   sort(que.begin(), que.end());
   int now = 0;
   for(auto& q : que){
      while(now != m && lists[now].w >= q.w){
         if(lists[now].act == 0) merge(lists[now].v, lists[now].u);
         now++;
      }
      vector<int> pos;
      int i;
      for(i = 0; i < upd.size(); i++){
         if(upd[i].id > q.id) continue;
         if(lists[newOrd[upd[i].v]].act == 0) continue;
         lists[newOrd[upd[i].v]].act = 0;
         if(upd[i].w < q.w) continue;
         int v = lists[newOrd[upd[i].v]].v, u = lists[newOrd[upd[i].v]].u;
         v = find(v);
         u = find(u);
         if(v == u) continue;
         adj[v].push_back(u);
         adj[u].push_back(v);
         pos.push_back(u);
         pos.push_back(v);
      }
      dfs(find(q.v), q.id);
      for(int x : pos){
         adj[x].clear();
         in[x] = 0;
      }
      in[find(q.v)] = 0;
      for(i = i - 1; i >= 0; i--){
         lists[newOrd[upd[i].v]].act = 1;
      }
   }

   //End
   for(int i = upd.size() - 1; i >= 0; i--){
      lists[newOrd[upd[i].v]].act = 0;
      lists[newOrd[upd[i].v]].w = upd[i].w;
   }
   que.clear();
   upd.clear();
}

int main(){
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0);

   cin>>n>>m;

   for(int i = 1; i <= m; i++){
      int v, u, d;
      cin>>v>>u>>d;
      lists.push_back(Path(v, u, d, i));
   }
   int q;
   cin>>q;
   for(int j = 1; j <= q; j++){
      int t, v, w;
      cin>>t>>v>>w;
      if(t == 2){
         que.push_back(Query(v, w, j));
      } else {
         upd.push_back(Update(v, w, j));
      }
      if(j % SIZE == 0){
         process();
      }
   }
   process();
   for(int i = 1; i < M; i++){
      if(ans[i]) cout<<ans[i]<<'\n';
   }
}

Compilation message

bridges.cpp: In function 'void process()':
bridges.cpp:94:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(i = 0; i < upd.size(); i++){
                  ~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 18 ms 1792 KB Output is correct
4 Correct 7 ms 1664 KB Output is correct
5 Correct 19 ms 1664 KB Output is correct
6 Correct 17 ms 1792 KB Output is correct
7 Correct 20 ms 1696 KB Output is correct
8 Correct 18 ms 1792 KB Output is correct
9 Correct 23 ms 1792 KB Output is correct
10 Correct 19 ms 1792 KB Output is correct
11 Correct 22 ms 1792 KB Output is correct
12 Correct 21 ms 1792 KB Output is correct
13 Correct 24 ms 1792 KB Output is correct
14 Correct 22 ms 1792 KB Output is correct
15 Correct 22 ms 1792 KB Output is correct
16 Correct 21 ms 1664 KB Output is correct
17 Correct 20 ms 1664 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1276 ms 5768 KB Output is correct
2 Correct 1309 ms 5908 KB Output is correct
3 Correct 1279 ms 5768 KB Output is correct
4 Correct 1277 ms 5676 KB Output is correct
5 Correct 1346 ms 5824 KB Output is correct
6 Correct 1450 ms 4968 KB Output is correct
7 Correct 1598 ms 4984 KB Output is correct
8 Correct 1477 ms 4892 KB Output is correct
9 Correct 35 ms 2808 KB Output is correct
10 Correct 1171 ms 5768 KB Output is correct
11 Correct 1096 ms 5672 KB Output is correct
12 Correct 1072 ms 4888 KB Output is correct
13 Correct 1143 ms 4864 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1018 ms 4824 KB Output is correct
2 Correct 522 ms 3456 KB Output is correct
3 Correct 1014 ms 4972 KB Output is correct
4 Correct 916 ms 4848 KB Output is correct
5 Correct 34 ms 2680 KB Output is correct
6 Correct 1037 ms 4720 KB Output is correct
7 Correct 916 ms 5016 KB Output is correct
8 Correct 841 ms 4848 KB Output is correct
9 Correct 692 ms 4376 KB Output is correct
10 Correct 676 ms 4472 KB Output is correct
11 Correct 763 ms 4716 KB Output is correct
12 Correct 695 ms 4836 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1206 ms 6112 KB Output is correct
2 Correct 35 ms 2808 KB Output is correct
3 Correct 112 ms 4852 KB Output is correct
4 Correct 118 ms 4852 KB Output is correct
5 Correct 1238 ms 5988 KB Output is correct
6 Correct 1228 ms 6216 KB Output is correct
7 Correct 1267 ms 6144 KB Output is correct
8 Correct 644 ms 4536 KB Output is correct
9 Correct 635 ms 4588 KB Output is correct
10 Correct 646 ms 4904 KB Output is correct
11 Correct 1085 ms 5104 KB Output is correct
12 Correct 1066 ms 5408 KB Output is correct
13 Correct 1130 ms 5464 KB Output is correct
14 Correct 1315 ms 6228 KB Output is correct
15 Correct 1257 ms 6240 KB Output is correct
16 Correct 1367 ms 5888 KB Output is correct
17 Correct 1466 ms 5988 KB Output is correct
18 Correct 1441 ms 6036 KB Output is correct
19 Correct 1373 ms 5924 KB Output is correct
20 Correct 1289 ms 5716 KB Output is correct
21 Correct 1286 ms 5812 KB Output is correct
22 Correct 1383 ms 5864 KB Output is correct
23 Correct 1142 ms 5588 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1276 ms 5768 KB Output is correct
2 Correct 1309 ms 5908 KB Output is correct
3 Correct 1279 ms 5768 KB Output is correct
4 Correct 1277 ms 5676 KB Output is correct
5 Correct 1346 ms 5824 KB Output is correct
6 Correct 1450 ms 4968 KB Output is correct
7 Correct 1598 ms 4984 KB Output is correct
8 Correct 1477 ms 4892 KB Output is correct
9 Correct 35 ms 2808 KB Output is correct
10 Correct 1171 ms 5768 KB Output is correct
11 Correct 1096 ms 5672 KB Output is correct
12 Correct 1072 ms 4888 KB Output is correct
13 Correct 1143 ms 4864 KB Output is correct
14 Correct 1018 ms 4824 KB Output is correct
15 Correct 522 ms 3456 KB Output is correct
16 Correct 1014 ms 4972 KB Output is correct
17 Correct 916 ms 4848 KB Output is correct
18 Correct 34 ms 2680 KB Output is correct
19 Correct 1037 ms 4720 KB Output is correct
20 Correct 916 ms 5016 KB Output is correct
21 Correct 841 ms 4848 KB Output is correct
22 Correct 692 ms 4376 KB Output is correct
23 Correct 676 ms 4472 KB Output is correct
24 Correct 763 ms 4716 KB Output is correct
25 Correct 695 ms 4836 KB Output is correct
26 Correct 1387 ms 5720 KB Output is correct
27 Correct 1440 ms 5864 KB Output is correct
28 Correct 1339 ms 5736 KB Output is correct
29 Correct 1148 ms 5540 KB Output is correct
30 Correct 1534 ms 5708 KB Output is correct
31 Correct 1509 ms 5740 KB Output is correct
32 Correct 1501 ms 5660 KB Output is correct
33 Correct 1476 ms 5740 KB Output is correct
34 Correct 1452 ms 5828 KB Output is correct
35 Correct 1483 ms 5792 KB Output is correct
36 Correct 1281 ms 5632 KB Output is correct
37 Correct 1285 ms 5740 KB Output is correct
38 Correct 1278 ms 5736 KB Output is correct
39 Correct 1022 ms 5032 KB Output is correct
40 Correct 1065 ms 5200 KB Output is correct
41 Correct 1062 ms 5036 KB Output is correct
42 Correct 1144 ms 5776 KB Output is correct
43 Correct 1064 ms 5764 KB Output is correct
44 Correct 998 ms 5672 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 18 ms 1792 KB Output is correct
4 Correct 7 ms 1664 KB Output is correct
5 Correct 19 ms 1664 KB Output is correct
6 Correct 17 ms 1792 KB Output is correct
7 Correct 20 ms 1696 KB Output is correct
8 Correct 18 ms 1792 KB Output is correct
9 Correct 23 ms 1792 KB Output is correct
10 Correct 19 ms 1792 KB Output is correct
11 Correct 22 ms 1792 KB Output is correct
12 Correct 21 ms 1792 KB Output is correct
13 Correct 24 ms 1792 KB Output is correct
14 Correct 22 ms 1792 KB Output is correct
15 Correct 22 ms 1792 KB Output is correct
16 Correct 21 ms 1664 KB Output is correct
17 Correct 20 ms 1664 KB Output is correct
18 Correct 1276 ms 5768 KB Output is correct
19 Correct 1309 ms 5908 KB Output is correct
20 Correct 1279 ms 5768 KB Output is correct
21 Correct 1277 ms 5676 KB Output is correct
22 Correct 1346 ms 5824 KB Output is correct
23 Correct 1450 ms 4968 KB Output is correct
24 Correct 1598 ms 4984 KB Output is correct
25 Correct 1477 ms 4892 KB Output is correct
26 Correct 35 ms 2808 KB Output is correct
27 Correct 1171 ms 5768 KB Output is correct
28 Correct 1096 ms 5672 KB Output is correct
29 Correct 1072 ms 4888 KB Output is correct
30 Correct 1143 ms 4864 KB Output is correct
31 Correct 1018 ms 4824 KB Output is correct
32 Correct 522 ms 3456 KB Output is correct
33 Correct 1014 ms 4972 KB Output is correct
34 Correct 916 ms 4848 KB Output is correct
35 Correct 34 ms 2680 KB Output is correct
36 Correct 1037 ms 4720 KB Output is correct
37 Correct 916 ms 5016 KB Output is correct
38 Correct 841 ms 4848 KB Output is correct
39 Correct 692 ms 4376 KB Output is correct
40 Correct 676 ms 4472 KB Output is correct
41 Correct 763 ms 4716 KB Output is correct
42 Correct 695 ms 4836 KB Output is correct
43 Correct 1206 ms 6112 KB Output is correct
44 Correct 35 ms 2808 KB Output is correct
45 Correct 112 ms 4852 KB Output is correct
46 Correct 118 ms 4852 KB Output is correct
47 Correct 1238 ms 5988 KB Output is correct
48 Correct 1228 ms 6216 KB Output is correct
49 Correct 1267 ms 6144 KB Output is correct
50 Correct 644 ms 4536 KB Output is correct
51 Correct 635 ms 4588 KB Output is correct
52 Correct 646 ms 4904 KB Output is correct
53 Correct 1085 ms 5104 KB Output is correct
54 Correct 1066 ms 5408 KB Output is correct
55 Correct 1130 ms 5464 KB Output is correct
56 Correct 1315 ms 6228 KB Output is correct
57 Correct 1257 ms 6240 KB Output is correct
58 Correct 1367 ms 5888 KB Output is correct
59 Correct 1466 ms 5988 KB Output is correct
60 Correct 1441 ms 6036 KB Output is correct
61 Correct 1373 ms 5924 KB Output is correct
62 Correct 1289 ms 5716 KB Output is correct
63 Correct 1286 ms 5812 KB Output is correct
64 Correct 1383 ms 5864 KB Output is correct
65 Correct 1142 ms 5588 KB Output is correct
66 Correct 1387 ms 5720 KB Output is correct
67 Correct 1440 ms 5864 KB Output is correct
68 Correct 1339 ms 5736 KB Output is correct
69 Correct 1148 ms 5540 KB Output is correct
70 Correct 1534 ms 5708 KB Output is correct
71 Correct 1509 ms 5740 KB Output is correct
72 Correct 1501 ms 5660 KB Output is correct
73 Correct 1476 ms 5740 KB Output is correct
74 Correct 1452 ms 5828 KB Output is correct
75 Correct 1483 ms 5792 KB Output is correct
76 Correct 1281 ms 5632 KB Output is correct
77 Correct 1285 ms 5740 KB Output is correct
78 Correct 1278 ms 5736 KB Output is correct
79 Correct 1022 ms 5032 KB Output is correct
80 Correct 1065 ms 5200 KB Output is correct
81 Correct 1062 ms 5036 KB Output is correct
82 Correct 1144 ms 5776 KB Output is correct
83 Correct 1064 ms 5764 KB Output is correct
84 Correct 998 ms 5672 KB Output is correct
85 Correct 2265 ms 6676 KB Output is correct
86 Correct 195 ms 4724 KB Output is correct
87 Correct 130 ms 4716 KB Output is correct
88 Correct 1580 ms 6520 KB Output is correct
89 Correct 2299 ms 6628 KB Output is correct
90 Correct 1589 ms 6228 KB Output is correct
91 Correct 1490 ms 5544 KB Output is correct
92 Correct 1496 ms 5740 KB Output is correct
93 Correct 1555 ms 4840 KB Output is correct
94 Correct 1935 ms 6072 KB Output is correct
95 Correct 2055 ms 6240 KB Output is correct
96 Correct 1775 ms 5288 KB Output is correct
97 Correct 1415 ms 6068 KB Output is correct
98 Correct 1468 ms 6248 KB Output is correct
99 Correct 2458 ms 6676 KB Output is correct
100 Correct 2388 ms 9760 KB Output is correct
101 Correct 2379 ms 9816 KB Output is correct
102 Correct 2506 ms 10048 KB Output is correct
103 Correct 1977 ms 8264 KB Output is correct
104 Correct 2021 ms 8028 KB Output is correct
105 Correct 1948 ms 8084 KB Output is correct
106 Correct 1838 ms 7556 KB Output is correct
107 Correct 1800 ms 8416 KB Output is correct
108 Correct 2263 ms 8816 KB Output is correct
109 Correct 1417 ms 6884 KB Output is correct