oj.uz

Submission #319071

# Submission time Handle Problem Language Result Execution time Memory
319071 2020-11-03T20:39:06 Z tushar_2658 Bridges (APIO19_bridges) C++14
100 / 100
 2320 ms 36344 KB 
#include "bits/stdc++.h"
using namespace std;
 
const int maxn = 100005;
 
int type[maxn], idx[maxn], W[maxn];
 
int x[maxn], y[maxn], w[maxn];
 
int n, m;
int magic;
 
int get_block(int idx){
  if(idx == 0)return 0;
  return idx / magic;
}
 
int par[maxn], sz[maxn];
stack<int> st;
int ans[maxn];
int cnt = 0, last = 0;
 
int get(int x){
  while(par[x] != x){
    x = par[x];
  }
  return x;
}
 
void unite(int x, int y){
  x = get(x);
  y = get(y);
  if(x == y)return;
  if(sz[x] < sz[y])swap(x, y);
  st.push(y);
  sz[x] += sz[y];
  par[y] = x;
}
 
void rollback(int x){
  while((int)st.size() > x){
    int k = st.top();
    st.pop();
    sz[par[k]] -= sz[k];
    par[k] = k;
  }
}
 
int main(int argc, char const *argv[])
{
  scanf("%d %d", &n, &m);
  for(int i = 0; i < m; ++i){
    scanf("%d %d %d", &x[i], &y[i], &w[i]);
  }
  int Q;
  scanf("%d", &Q);
  magic = 1000;
  for(int i = 0; i < Q; ++i){
    scanf("%d %d %d", &type[i], &idx[i], &W[i]);
    if(type[i] == 1){
      --idx[i];
    }
  }
  vector<pair<int, int>> v[1001];
  for(int i = 0; i < Q; i += magic){
    for(int j = 1; j <= n; ++j){
      par[j] = j;
      sz[j] = 1;
    }
    int l = i, r = min(Q - 1, i + magic - 1);
    vector<int> unchanged;
    vector<int> upd, ask;
    vector<bool> mark(m + 1);
    for(int j = l; j <= r; ++j){
      if(type[j] == 1){
        mark[idx[j]] = 1;
        upd.push_back(j);
      }else {
        ask.push_back(j);
      }
    }
    for(int j = 0; j < m; ++j){
      if(mark[j]){}
      else {
        unchanged.push_back(j);
      }
    }
    for(int j = l; j <= r; ++j){
      if(type[j] == 1){
        w[idx[j]] = W[j];
      }else {
        v[j - l].clear();
        for(auto k : upd){
          if(w[idx[k]] >= W[j]){
            v[j - l].push_back({x[idx[k]], y[idx[k]]});
          }
        }
      }
    }
    sort(unchanged.begin(), unchanged.end(), [&](int x, int y){
      return w[x] > w[y];
    });
    sort(ask.begin(), ask.end(), [&](int x, int y){
      return W[x] > W[y];
    });
    int ptr = 0;
    cnt = last = 0;
    for(auto j : ask){
      while(ptr < (int)unchanged.size()){
        if(w[unchanged[ptr]] >= W[j]){}
        else {
          break;
        }
        unite(x[unchanged[ptr]], y[unchanged[ptr]]);
        ++ptr;
      }
      last = st.size();
      for(auto k : v[j - l]){
        unite(k.first, k.second);
      }
      ans[j] = sz[get(idx[j])];
      rollback(last);
    }
  }
  
  for(int i = 0; i < Q; ++i){
    if(type[i] == 2){
      printf("%d\n", ans[i]);
    }
  }
 
  return 0;
}

Compilation message

bridges.cpp: In function 'int main(int, const char**)':
bridges.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |   scanf("%d %d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |     scanf("%d %d %d", &x[i], &y[i], &w[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |   scanf("%d", &Q);
      |   ~~~~~^~~~~~~~~~
bridges.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |     scanf("%d %d %d", &type[i], &idx[i], &W[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 4964 KB Output is correct
4 Correct 6 ms 620 KB Output is correct
5 Correct 40 ms 5352 KB Output is correct
6 Correct 31 ms 4836 KB Output is correct
7 Correct 39 ms 6500 KB Output is correct
8 Correct 43 ms 4832 KB Output is correct
9 Correct 49 ms 8196 KB Output is correct
10 Correct 41 ms 5220 KB Output is correct
11 Correct 43 ms 5092 KB Output is correct
12 Correct 51 ms 5220 KB Output is correct
13 Correct 47 ms 5084 KB Output is correct
14 Correct 43 ms 4836 KB Output is correct
15 Correct 49 ms 4964 KB Output is correct
16 Correct 46 ms 7396 KB Output is correct
17 Correct 45 ms 6380 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 29440 KB Output is correct
2 Correct 1338 ms 29636 KB Output is correct
3 Correct 1337 ms 29632 KB Output is correct
4 Correct 1385 ms 29552 KB Output is correct
5 Correct 1399 ms 30116 KB Output is correct
6 Correct 1966 ms 33072 KB Output is correct
7 Correct 1974 ms 33316 KB Output is correct
8 Correct 1967 ms 32992 KB Output is correct
9 Correct 47 ms 3172 KB Output is correct
10 Correct 1086 ms 33056 KB Output is correct
11 Correct 1014 ms 32920 KB Output is correct
12 Correct 1181 ms 26488 KB Output is correct
13 Correct 1188 ms 32624 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1033 ms 21816 KB Output is correct
2 Correct 764 ms 14564 KB Output is correct
3 Correct 1232 ms 25424 KB Output is correct
4 Correct 1012 ms 22172 KB Output is correct
5 Correct 48 ms 3044 KB Output is correct
6 Correct 1156 ms 22092 KB Output is correct
7 Correct 949 ms 21848 KB Output is correct
8 Correct 841 ms 21480 KB Output is correct
9 Correct 711 ms 18536 KB Output is correct
10 Correct 654 ms 18408 KB Output is correct
11 Correct 735 ms 24808 KB Output is correct
12 Correct 658 ms 24936 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1669 ms 25588 KB Output is correct
2 Correct 48 ms 3172 KB Output is correct
3 Correct 179 ms 4612 KB Output is correct
4 Correct 91 ms 4776 KB Output is correct
5 Correct 848 ms 27252 KB Output is correct
6 Correct 1626 ms 28864 KB Output is correct
7 Correct 838 ms 27244 KB Output is correct
8 Correct 801 ms 26804 KB Output is correct
9 Correct 797 ms 26676 KB Output is correct
10 Correct 802 ms 26548 KB Output is correct
11 Correct 1233 ms 27944 KB Output is correct
12 Correct 1220 ms 28196 KB Output is correct
13 Correct 1253 ms 28200 KB Output is correct
14 Correct 774 ms 27128 KB Output is correct
15 Correct 810 ms 27116 KB Output is correct
16 Correct 1667 ms 28796 KB Output is correct
17 Correct 1689 ms 28792 KB Output is correct
18 Correct 1677 ms 29360 KB Output is correct
19 Correct 1653 ms 29128 KB Output is correct
20 Correct 1401 ms 28376 KB Output is correct
21 Correct 1391 ms 28292 KB Output is correct
22 Correct 1607 ms 28452 KB Output is correct
23 Correct 940 ms 24932 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 29440 KB Output is correct
2 Correct 1338 ms 29636 KB Output is correct
3 Correct 1337 ms 29632 KB Output is correct
4 Correct 1385 ms 29552 KB Output is correct
5 Correct 1399 ms 30116 KB Output is correct
6 Correct 1966 ms 33072 KB Output is correct
7 Correct 1974 ms 33316 KB Output is correct
8 Correct 1967 ms 32992 KB Output is correct
9 Correct 47 ms 3172 KB Output is correct
10 Correct 1086 ms 33056 KB Output is correct
11 Correct 1014 ms 32920 KB Output is correct
12 Correct 1181 ms 26488 KB Output is correct
13 Correct 1188 ms 32624 KB Output is correct
14 Correct 1033 ms 21816 KB Output is correct
15 Correct 764 ms 14564 KB Output is correct
16 Correct 1232 ms 25424 KB Output is correct
17 Correct 1012 ms 22172 KB Output is correct
18 Correct 48 ms 3044 KB Output is correct
19 Correct 1156 ms 22092 KB Output is correct
20 Correct 949 ms 21848 KB Output is correct
21 Correct 841 ms 21480 KB Output is correct
22 Correct 711 ms 18536 KB Output is correct
23 Correct 654 ms 18408 KB Output is correct
24 Correct 735 ms 24808 KB Output is correct
25 Correct 658 ms 24936 KB Output is correct
26 Correct 1340 ms 29676 KB Output is correct
27 Correct 1664 ms 32808 KB Output is correct
28 Correct 1412 ms 29368 KB Output is correct
29 Correct 1043 ms 28716 KB Output is correct
30 Correct 1624 ms 32808 KB Output is correct
31 Correct 1629 ms 32684 KB Output is correct
32 Correct 1649 ms 32940 KB Output is correct
33 Correct 1413 ms 29500 KB Output is correct
34 Correct 1410 ms 29376 KB Output is correct
35 Correct 1399 ms 29488 KB Output is correct
36 Correct 1085 ms 28980 KB Output is correct
37 Correct 1084 ms 29116 KB Output is correct
38 Correct 1067 ms 28932 KB Output is correct
39 Correct 906 ms 25752 KB Output is correct
40 Correct 905 ms 25824 KB Output is correct
41 Correct 905 ms 25848 KB Output is correct
42 Correct 890 ms 30908 KB Output is correct
43 Correct 884 ms 30736 KB Output is correct
44 Correct 879 ms 30560 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 4964 KB Output is correct
4 Correct 6 ms 620 KB Output is correct
5 Correct 40 ms 5352 KB Output is correct
6 Correct 31 ms 4836 KB Output is correct
7 Correct 39 ms 6500 KB Output is correct
8 Correct 43 ms 4832 KB Output is correct
9 Correct 49 ms 8196 KB Output is correct
10 Correct 41 ms 5220 KB Output is correct
11 Correct 43 ms 5092 KB Output is correct
12 Correct 51 ms 5220 KB Output is correct
13 Correct 47 ms 5084 KB Output is correct
14 Correct 43 ms 4836 KB Output is correct
15 Correct 49 ms 4964 KB Output is correct
16 Correct 46 ms 7396 KB Output is correct
17 Correct 45 ms 6380 KB Output is correct
18 Correct 1342 ms 29440 KB Output is correct
19 Correct 1338 ms 29636 KB Output is correct
20 Correct 1337 ms 29632 KB Output is correct
21 Correct 1385 ms 29552 KB Output is correct
22 Correct 1399 ms 30116 KB Output is correct
23 Correct 1966 ms 33072 KB Output is correct
24 Correct 1974 ms 33316 KB Output is correct
25 Correct 1967 ms 32992 KB Output is correct
26 Correct 47 ms 3172 KB Output is correct
27 Correct 1086 ms 33056 KB Output is correct
28 Correct 1014 ms 32920 KB Output is correct
29 Correct 1181 ms 26488 KB Output is correct
30 Correct 1188 ms 32624 KB Output is correct
31 Correct 1033 ms 21816 KB Output is correct
32 Correct 764 ms 14564 KB Output is correct
33 Correct 1232 ms 25424 KB Output is correct
34 Correct 1012 ms 22172 KB Output is correct
35 Correct 48 ms 3044 KB Output is correct
36 Correct 1156 ms 22092 KB Output is correct
37 Correct 949 ms 21848 KB Output is correct
38 Correct 841 ms 21480 KB Output is correct
39 Correct 711 ms 18536 KB Output is correct
40 Correct 654 ms 18408 KB Output is correct
41 Correct 735 ms 24808 KB Output is correct
42 Correct 658 ms 24936 KB Output is correct
43 Correct 1669 ms 25588 KB Output is correct
44 Correct 48 ms 3172 KB Output is correct
45 Correct 179 ms 4612 KB Output is correct
46 Correct 91 ms 4776 KB Output is correct
47 Correct 848 ms 27252 KB Output is correct
48 Correct 1626 ms 28864 KB Output is correct
49 Correct 838 ms 27244 KB Output is correct
50 Correct 801 ms 26804 KB Output is correct
51 Correct 797 ms 26676 KB Output is correct
52 Correct 802 ms 26548 KB Output is correct
53 Correct 1233 ms 27944 KB Output is correct
54 Correct 1220 ms 28196 KB Output is correct
55 Correct 1253 ms 28200 KB Output is correct
56 Correct 774 ms 27128 KB Output is correct
57 Correct 810 ms 27116 KB Output is correct
58 Correct 1667 ms 28796 KB Output is correct
59 Correct 1689 ms 28792 KB Output is correct
60 Correct 1677 ms 29360 KB Output is correct
61 Correct 1653 ms 29128 KB Output is correct
62 Correct 1401 ms 28376 KB Output is correct
63 Correct 1391 ms 28292 KB Output is correct
64 Correct 1607 ms 28452 KB Output is correct
65 Correct 940 ms 24932 KB Output is correct
66 Correct 1340 ms 29676 KB Output is correct
67 Correct 1664 ms 32808 KB Output is correct
68 Correct 1412 ms 29368 KB Output is correct
69 Correct 1043 ms 28716 KB Output is correct
70 Correct 1624 ms 32808 KB Output is correct
71 Correct 1629 ms 32684 KB Output is correct
72 Correct 1649 ms 32940 KB Output is correct
73 Correct 1413 ms 29500 KB Output is correct
74 Correct 1410 ms 29376 KB Output is correct
75 Correct 1399 ms 29488 KB Output is correct
76 Correct 1085 ms 28980 KB Output is correct
77 Correct 1084 ms 29116 KB Output is correct
78 Correct 1067 ms 28932 KB Output is correct
79 Correct 906 ms 25752 KB Output is correct
80 Correct 905 ms 25824 KB Output is correct
81 Correct 905 ms 25848 KB Output is correct
82 Correct 890 ms 30908 KB Output is correct
83 Correct 884 ms 30736 KB Output is correct
84 Correct 879 ms 30560 KB Output is correct
85 Correct 2105 ms 33564 KB Output is correct
86 Correct 211 ms 8648 KB Output is correct
87 Correct 134 ms 11304 KB Output is correct
88 Correct 1284 ms 35428 KB Output is correct
89 Correct 2096 ms 33616 KB Output is correct
90 Correct 1284 ms 35192 KB Output is correct
91 Correct 1445 ms 31284 KB Output is correct
92 Correct 1415 ms 31544 KB Output is correct
93 Correct 2008 ms 34032 KB Output is correct
94 Correct 1770 ms 33036 KB Output is correct
95 Correct 1763 ms 32932 KB Output is correct
96 Correct 2109 ms 36008 KB Output is correct
97 Correct 999 ms 28336 KB Output is correct
98 Correct 1045 ms 34988 KB Output is correct
99 Correct 2137 ms 33988 KB Output is correct
100 Correct 2137 ms 33388 KB Output is correct
101 Correct 2182 ms 33744 KB Output is correct
102 Correct 2160 ms 33888 KB Output is correct
103 Correct 2308 ms 36344 KB Output is correct
104 Correct 2320 ms 36264 KB Output is correct
105 Correct 1737 ms 35944 KB Output is correct
106 Correct 1433 ms 35804 KB Output is correct
107 Correct 1662 ms 29600 KB Output is correct
108 Correct 2177 ms 34324 KB Output is correct
109 Correct 1574 ms 33076 KB Output is correct