oj.uz

Submission #812740

# Submission time Handle Problem Language Result Execution time Memory
812740 2023-08-07T10:36:07 Z peijar Bridges (APIO19_bridges) C++17
100 / 100
 1938 ms 8632 KB 
#include <bits/stdc++.h>
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct UnionFind {
  vector<int> id;
  stack<tuple<int, int, int, int>> stk;

  UnionFind(int N) : id(N, -1) {}

  int find(int x) {
    if (id[x] < 0)
      return x;
    return find(id[x]);
  }

  void merge(int a, int b) {
    a = find(a), b = find(b);

    stk.emplace(a, b, id[a], id[b]);
    if (a == b)
      return;

    if (id[a] > id[b])
      swap(a, b);
    id[a] += id[b];
    id[b] = a;
  }

  void rollback() {
    auto [a, b, ida, idb] = stk.top();
    stk.pop();
    id[a] = ida, id[b] = idb;
  }
};
struct Requete {
  int type, sommet, poids, iRequete;
};

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbSommet, nbAretes;
  cin >> nbSommet >> nbAretes;

  vector<pair<int, int>> edges(nbAretes);

  vector<int> weight(nbAretes);
  for (int i = 0; i < nbAretes; ++i) {
    cin >> edges[i].first >> edges[i].second >> weight[i];
    --edges[i].first;
    --edges[i].second;
  }

  vector<Requete> requetes;
  int nbRequetes;
  cin >> nbRequetes;
  vector<int> sol(nbRequetes, -1);
  vector<int> idArete(nbAretes);

  auto process = [&]() {
    UnionFind dsu(nbSommet);
    vector<bool> changes(nbAretes);
    for (Requete req : requetes)
      if (req.type == 1)
        changes[req.sommet] = true;
    vector<int> posAnswer;
    for (int i = 0; i < (int)requetes.size(); ++i)
      if (requetes[i].type == 2)
        posAnswer.push_back(i);

    sort(posAnswer.begin(), posAnswer.end(),
         [&](int i, int j) { return requetes[i].poids > requetes[j].poids; });

    vector<int> posStatic;
    for (int i = 0; i < nbAretes; ++i)
      if (!changes[i])
        posStatic.push_back(i);
    vector<int> posChange;
    for (int i = 0; i < nbAretes; ++i)
      if (changes[i])
        posChange.push_back(i);
    for (int i = 0; i < (int)posChange.size(); ++i)
      idArete[posChange[i]] = i;
    sort(posStatic.begin(), posStatic.end(),
         [&](int i, int j) { return weight[i] > weight[j]; });

    auto getId = [&](int i) { return idArete[i]; };

    int curStat = 0;

    for (int i : posAnswer) {
      while (curStat < (int)posStatic.size() and
             weight[posStatic[curStat]] >= requetes[i].poids) {
        dsu.merge(edges[posStatic[curStat]].first,
                  edges[posStatic[curStat]].second);
        ++curStat;
      }
      vector<bool> seen(posChange.size());
      int cntPop = 0;
      for (int j = i - 1; j >= 0; --j)
        if (requetes[j].type == 1 and !seen[getId(requetes[j].sommet)]) {
          seen[getId(requetes[j].sommet)] = true;
          if (requetes[j].poids >= requetes[i].poids) {
            dsu.merge(edges[requetes[j].sommet].first,
                      edges[requetes[j].sommet].second);
            ++cntPop;
          }
        }
      for (int j = 0; j < (int)posChange.size(); ++j)
        if (!seen[j] and weight[posChange[j]] >= requetes[i].poids) {
          int iArete = posChange[j];
          dsu.merge(edges[iArete].first, edges[iArete].second);
          cntPop++;
        }

      sol[requetes[i].iRequete] = -dsu.id[dsu.find(requetes[i].sommet)];

      for (int j = 0; j < cntPop; ++j)
        dsu.rollback();
    }

    for (Requete req : requetes)
      if (req.type == 1)
        weight[req.sommet] = req.poids;
    requetes.clear();
  };

  for (int i = 0; i < nbRequetes; ++i) {
    int t, u, w;
    cin >> t >> u >> w;
    --u;
    requetes.push_back(Requete{t, u, w, i});
    if ((int)requetes.size() * (int)requetes.size() >= 10 * nbRequetes)
      process();
  }
  if (!requetes.empty())
    process();
  for (int x : sol)
    if (x != -1)
      cout << x << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 15 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 10 ms 380 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 12 ms 372 KB Output is correct
11 Correct 11 ms 340 KB Output is correct
12 Correct 11 ms 376 KB Output is correct
13 Correct 14 ms 340 KB Output is correct
14 Correct 13 ms 364 KB Output is correct
15 Correct 12 ms 376 KB Output is correct
16 Correct 10 ms 380 KB Output is correct
17 Correct 10 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 968 ms 2808 KB Output is correct
2 Correct 983 ms 2812 KB Output is correct
3 Correct 982 ms 2804 KB Output is correct
4 Correct 1002 ms 2928 KB Output is correct
5 Correct 1024 ms 2800 KB Output is correct
6 Correct 1453 ms 3060 KB Output is correct
7 Correct 1455 ms 3060 KB Output is correct
8 Correct 1450 ms 3068 KB Output is correct
9 Correct 44 ms 876 KB Output is correct
10 Correct 688 ms 2912 KB Output is correct
11 Correct 671 ms 2884 KB Output is correct
12 Correct 795 ms 3188 KB Output is correct
13 Correct 877 ms 2804 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 756 ms 2068 KB Output is correct
2 Correct 500 ms 1200 KB Output is correct
3 Correct 812 ms 2196 KB Output is correct
4 Correct 724 ms 2196 KB Output is correct
5 Correct 41 ms 844 KB Output is correct
6 Correct 796 ms 2196 KB Output is correct
7 Correct 689 ms 2196 KB Output is correct
8 Correct 657 ms 2056 KB Output is correct
9 Correct 486 ms 2376 KB Output is correct
10 Correct 462 ms 2188 KB Output is correct
11 Correct 516 ms 2068 KB Output is correct
12 Correct 465 ms 2060 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 4988 KB Output is correct
2 Correct 42 ms 2268 KB Output is correct
3 Correct 386 ms 5836 KB Output is correct
4 Correct 158 ms 5956 KB Output is correct
5 Correct 654 ms 6908 KB Output is correct
6 Correct 1265 ms 8372 KB Output is correct
7 Correct 663 ms 6844 KB Output is correct
8 Correct 585 ms 5420 KB Output is correct
9 Correct 580 ms 5512 KB Output is correct
10 Correct 588 ms 5268 KB Output is correct
11 Correct 938 ms 6832 KB Output is correct
12 Correct 930 ms 6976 KB Output is correct
13 Correct 948 ms 6704 KB Output is correct
14 Correct 618 ms 6924 KB Output is correct
15 Correct 631 ms 6888 KB Output is correct
16 Correct 1278 ms 8444 KB Output is correct
17 Correct 1321 ms 8236 KB Output is correct
18 Correct 1289 ms 8472 KB Output is correct
19 Correct 1279 ms 8440 KB Output is correct
20 Correct 1075 ms 7148 KB Output is correct
21 Correct 1085 ms 7056 KB Output is correct
22 Correct 1243 ms 7960 KB Output is correct
23 Correct 728 ms 6004 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 968 ms 2808 KB Output is correct
2 Correct 983 ms 2812 KB Output is correct
3 Correct 982 ms 2804 KB Output is correct
4 Correct 1002 ms 2928 KB Output is correct
5 Correct 1024 ms 2800 KB Output is correct
6 Correct 1453 ms 3060 KB Output is correct
7 Correct 1455 ms 3060 KB Output is correct
8 Correct 1450 ms 3068 KB Output is correct
9 Correct 44 ms 876 KB Output is correct
10 Correct 688 ms 2912 KB Output is correct
11 Correct 671 ms 2884 KB Output is correct
12 Correct 795 ms 3188 KB Output is correct
13 Correct 877 ms 2804 KB Output is correct
14 Correct 756 ms 2068 KB Output is correct
15 Correct 500 ms 1200 KB Output is correct
16 Correct 812 ms 2196 KB Output is correct
17 Correct 724 ms 2196 KB Output is correct
18 Correct 41 ms 844 KB Output is correct
19 Correct 796 ms 2196 KB Output is correct
20 Correct 689 ms 2196 KB Output is correct
21 Correct 657 ms 2056 KB Output is correct
22 Correct 486 ms 2376 KB Output is correct
23 Correct 462 ms 2188 KB Output is correct
24 Correct 516 ms 2068 KB Output is correct
25 Correct 465 ms 2060 KB Output is correct
26 Correct 938 ms 2928 KB Output is correct
27 Correct 1131 ms 2940 KB Output is correct
28 Correct 1036 ms 2952 KB Output is correct
29 Correct 807 ms 2804 KB Output is correct
30 Correct 1148 ms 2936 KB Output is correct
31 Correct 1182 ms 2924 KB Output is correct
32 Correct 1170 ms 3016 KB Output is correct
33 Correct 996 ms 2804 KB Output is correct
34 Correct 1016 ms 2872 KB Output is correct
35 Correct 1008 ms 2804 KB Output is correct
36 Correct 830 ms 2800 KB Output is correct
37 Correct 829 ms 2888 KB Output is correct
38 Correct 824 ms 2796 KB Output is correct
39 Correct 642 ms 2964 KB Output is correct
40 Correct 649 ms 2932 KB Output is correct
41 Correct 653 ms 2924 KB Output is correct
42 Correct 694 ms 2804 KB Output is correct
43 Correct 649 ms 2792 KB Output is correct
44 Correct 638 ms 2796 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 15 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 10 ms 380 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 12 ms 372 KB Output is correct
11 Correct 11 ms 340 KB Output is correct
12 Correct 11 ms 376 KB Output is correct
13 Correct 14 ms 340 KB Output is correct
14 Correct 13 ms 364 KB Output is correct
15 Correct 12 ms 376 KB Output is correct
16 Correct 10 ms 380 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 968 ms 2808 KB Output is correct
19 Correct 983 ms 2812 KB Output is correct
20 Correct 982 ms 2804 KB Output is correct
21 Correct 1002 ms 2928 KB Output is correct
22 Correct 1024 ms 2800 KB Output is correct
23 Correct 1453 ms 3060 KB Output is correct
24 Correct 1455 ms 3060 KB Output is correct
25 Correct 1450 ms 3068 KB Output is correct
26 Correct 44 ms 876 KB Output is correct
27 Correct 688 ms 2912 KB Output is correct
28 Correct 671 ms 2884 KB Output is correct
29 Correct 795 ms 3188 KB Output is correct
30 Correct 877 ms 2804 KB Output is correct
31 Correct 756 ms 2068 KB Output is correct
32 Correct 500 ms 1200 KB Output is correct
33 Correct 812 ms 2196 KB Output is correct
34 Correct 724 ms 2196 KB Output is correct
35 Correct 41 ms 844 KB Output is correct
36 Correct 796 ms 2196 KB Output is correct
37 Correct 689 ms 2196 KB Output is correct
38 Correct 657 ms 2056 KB Output is correct
39 Correct 486 ms 2376 KB Output is correct
40 Correct 462 ms 2188 KB Output is correct
41 Correct 516 ms 2068 KB Output is correct
42 Correct 465 ms 2060 KB Output is correct
43 Correct 1297 ms 4988 KB Output is correct
44 Correct 42 ms 2268 KB Output is correct
45 Correct 386 ms 5836 KB Output is correct
46 Correct 158 ms 5956 KB Output is correct
47 Correct 654 ms 6908 KB Output is correct
48 Correct 1265 ms 8372 KB Output is correct
49 Correct 663 ms 6844 KB Output is correct
50 Correct 585 ms 5420 KB Output is correct
51 Correct 580 ms 5512 KB Output is correct
52 Correct 588 ms 5268 KB Output is correct
53 Correct 938 ms 6832 KB Output is correct
54 Correct 930 ms 6976 KB Output is correct
55 Correct 948 ms 6704 KB Output is correct
56 Correct 618 ms 6924 KB Output is correct
57 Correct 631 ms 6888 KB Output is correct
58 Correct 1278 ms 8444 KB Output is correct
59 Correct 1321 ms 8236 KB Output is correct
60 Correct 1289 ms 8472 KB Output is correct
61 Correct 1279 ms 8440 KB Output is correct
62 Correct 1075 ms 7148 KB Output is correct
63 Correct 1085 ms 7056 KB Output is correct
64 Correct 1243 ms 7960 KB Output is correct
65 Correct 728 ms 6004 KB Output is correct
66 Correct 938 ms 2928 KB Output is correct
67 Correct 1131 ms 2940 KB Output is correct
68 Correct 1036 ms 2952 KB Output is correct
69 Correct 807 ms 2804 KB Output is correct
70 Correct 1148 ms 2936 KB Output is correct
71 Correct 1182 ms 2924 KB Output is correct
72 Correct 1170 ms 3016 KB Output is correct
73 Correct 996 ms 2804 KB Output is correct
74 Correct 1016 ms 2872 KB Output is correct
75 Correct 1008 ms 2804 KB Output is correct
76 Correct 830 ms 2800 KB Output is correct
77 Correct 829 ms 2888 KB Output is correct
78 Correct 824 ms 2796 KB Output is correct
79 Correct 642 ms 2964 KB Output is correct
80 Correct 649 ms 2932 KB Output is correct
81 Correct 653 ms 2924 KB Output is correct
82 Correct 694 ms 2804 KB Output is correct
83 Correct 649 ms 2792 KB Output is correct
84 Correct 638 ms 2796 KB Output is correct
85 Correct 1744 ms 8628 KB Output is correct
86 Correct 389 ms 5972 KB Output is correct
87 Correct 156 ms 6076 KB Output is correct
88 Correct 1061 ms 7228 KB Output is correct
89 Correct 1694 ms 8632 KB Output is correct
90 Correct 1031 ms 7216 KB Output is correct
91 Correct 1095 ms 5472 KB Output is correct
92 Correct 1078 ms 5600 KB Output is correct
93 Correct 1597 ms 5540 KB Output is correct
94 Correct 1634 ms 7064 KB Output is correct
95 Correct 1575 ms 7320 KB Output is correct
96 Correct 1905 ms 7156 KB Output is correct
97 Correct 821 ms 7344 KB Output is correct
98 Correct 893 ms 6964 KB Output is correct
99 Correct 1809 ms 8524 KB Output is correct
100 Correct 1794 ms 8464 KB Output is correct
101 Correct 1780 ms 8628 KB Output is correct
102 Correct 1808 ms 8608 KB Output is correct
103 Correct 1885 ms 7688 KB Output is correct
104 Correct 1938 ms 7648 KB Output is correct
105 Correct 1405 ms 7584 KB Output is correct
106 Correct 1093 ms 7052 KB Output is correct
107 Correct 1268 ms 7816 KB Output is correct
108 Correct 1846 ms 8336 KB Output is correct
109 Correct 1327 ms 6440 KB Output is correct