oj.uz

Submission #707588

# Submission time Handle Problem Language Result Execution time Memory
707588 2023-03-09T11:58:46 Z nguyentunglam Bridges (APIO19_bridges) C++17
100 / 100
 2911 ms 13264 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 1e5 + 10;
vector<ii> w[N];
int u[N], v[N];
bool mark[N];
int lab[N], n, m, ans[N];
stack<pair<int, int> > st;
int root(int v) {
    return lab[v] < 0 ? v : root(lab[v]);
}
void join(int u, int v) {
   u = root(u); v = root(v);
   if (u == v) return;
   if (lab[u] > lab[v]) swap(u, v);
   st.push({u, lab[u]});
   st.push({v, lab[v]});
   lab[u] += lab[v];
   lab[v] = u;
}
void rollback(int cnt) {
    while (st.size() > cnt) {
        lab[st.top().fi] = st.top().se;
        st.pop();
    }
}
int getw (int j, int t) {
    int idx = lower_bound(w[j].begin(), w[j].end(), make_pair(t + 1, 0)) - w[j].begin();
    return w[j][idx - 1].se;
}
vector<tuple<int, int, int> > query;
void solve() {
    sort(query.begin(), query.end(), greater<tuple<int, int, int>>());
    vector<int> remain, change;
    for(int j = 1; j <= m; j++) {
        if (!mark[j]) remain.push_back(j);
        else change.push_back(j);
        mark[j] = 0;
    }
    sort(remain.begin(), remain.end(), [] (int x, int y) {
         return w[x].back().se < w[y].back().se;
         });
    for(auto &t : query) {
        int weight, ver, idx;
        tie(weight, ver, idx) = t;
        while (!remain.empty() && w[remain.back()].back().se >= weight) {
            int j = remain.back();
            join(u[j], v[j]);
            remain.pop_back();
        }
        int pre = st.size();
        for(int &j : change) if (getw(j, idx) >= weight) {
            join(u[j], v[j]);
        }
        ans[idx] = -lab[root(ver)];
        rollback(pre);
    }
    fill(lab + 1, lab + n + 1, -1);
    while (!st.empty()) st.pop();
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    cin >> n >> m;
    fill(lab + 1, lab + n + 1, -1);
    for(int i = 1; i <= m; i++) {
        int d;
        cin >> u[i] >> v[i] >> d;
        w[i].emplace_back(0, d);
    }
    int q; cin >> q;
    int T = 1000;
    for(int i = 1; i <= q; i++) {
        int type, x, y; cin >> type >> x >> y;
        if (type == 1) {
            w[x].emplace_back(i, y);
            mark[x] = 1;
        }
        else query.push_back({y, x, i});
        if (i % T == 0 || i == q) solve(), query.clear();
    }
    for(int i = 1; i <= q; i++) if (ans[i]) cout << ans[i] << endl;
//    cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:26:22: warning: comparison of integer expressions of different signedness: 'std::stack<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |     while (st.size() > cnt) {
      |            ~~~~~~~~~~^~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:69:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:70:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:73:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:74:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 43 ms 2864 KB Output is correct
4 Correct 4 ms 2644 KB Output is correct
5 Correct 17 ms 2788 KB Output is correct
6 Correct 16 ms 2784 KB Output is correct
7 Correct 20 ms 2808 KB Output is correct
8 Correct 20 ms 2808 KB Output is correct
9 Correct 24 ms 2792 KB Output is correct
10 Correct 21 ms 2772 KB Output is correct
11 Correct 21 ms 2800 KB Output is correct
12 Correct 23 ms 2804 KB Output is correct
13 Correct 28 ms 2804 KB Output is correct
14 Correct 26 ms 2772 KB Output is correct
15 Correct 21 ms 2772 KB Output is correct
16 Correct 22 ms 2772 KB Output is correct
17 Correct 23 ms 2800 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1839 ms 7116 KB Output is correct
2 Correct 1784 ms 9744 KB Output is correct
3 Correct 1807 ms 9784 KB Output is correct
4 Correct 1768 ms 9948 KB Output is correct
5 Correct 1748 ms 9632 KB Output is correct
6 Correct 2443 ms 9664 KB Output is correct
7 Correct 2365 ms 9684 KB Output is correct
8 Correct 2409 ms 9656 KB Output is correct
9 Correct 32 ms 4564 KB Output is correct
10 Correct 1532 ms 8568 KB Output is correct
11 Correct 1478 ms 8608 KB Output is correct
12 Correct 1484 ms 9276 KB Output is correct
13 Correct 1450 ms 10116 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1570 ms 6076 KB Output is correct
2 Correct 1062 ms 4380 KB Output is correct
3 Correct 1644 ms 6212 KB Output is correct
4 Correct 1348 ms 6140 KB Output is correct
5 Correct 32 ms 3252 KB Output is correct
6 Correct 1503 ms 6028 KB Output is correct
7 Correct 1303 ms 5900 KB Output is correct
8 Correct 1204 ms 5792 KB Output is correct
9 Correct 857 ms 5592 KB Output is correct
10 Correct 767 ms 5464 KB Output is correct
11 Correct 933 ms 6368 KB Output is correct
12 Correct 849 ms 6124 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2128 ms 9768 KB Output is correct
2 Correct 32 ms 4608 KB Output is correct
3 Correct 237 ms 9484 KB Output is correct
4 Correct 101 ms 9596 KB Output is correct
5 Correct 1131 ms 11380 KB Output is correct
6 Correct 2162 ms 12728 KB Output is correct
7 Correct 1062 ms 11336 KB Output is correct
8 Correct 974 ms 9152 KB Output is correct
9 Correct 919 ms 9404 KB Output is correct
10 Correct 921 ms 8888 KB Output is correct
11 Correct 1426 ms 10968 KB Output is correct
12 Correct 1426 ms 10964 KB Output is correct
13 Correct 1510 ms 11108 KB Output is correct
14 Correct 901 ms 11396 KB Output is correct
15 Correct 994 ms 11476 KB Output is correct
16 Correct 2074 ms 12772 KB Output is correct
17 Correct 2092 ms 12660 KB Output is correct
18 Correct 2087 ms 12792 KB Output is correct
19 Correct 1936 ms 12912 KB Output is correct
20 Correct 1608 ms 11516 KB Output is correct
21 Correct 1610 ms 11696 KB Output is correct
22 Correct 2118 ms 12612 KB Output is correct
23 Correct 1101 ms 10376 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1839 ms 7116 KB Output is correct
2 Correct 1784 ms 9744 KB Output is correct
3 Correct 1807 ms 9784 KB Output is correct
4 Correct 1768 ms 9948 KB Output is correct
5 Correct 1748 ms 9632 KB Output is correct
6 Correct 2443 ms 9664 KB Output is correct
7 Correct 2365 ms 9684 KB Output is correct
8 Correct 2409 ms 9656 KB Output is correct
9 Correct 32 ms 4564 KB Output is correct
10 Correct 1532 ms 8568 KB Output is correct
11 Correct 1478 ms 8608 KB Output is correct
12 Correct 1484 ms 9276 KB Output is correct
13 Correct 1450 ms 10116 KB Output is correct
14 Correct 1570 ms 6076 KB Output is correct
15 Correct 1062 ms 4380 KB Output is correct
16 Correct 1644 ms 6212 KB Output is correct
17 Correct 1348 ms 6140 KB Output is correct
18 Correct 32 ms 3252 KB Output is correct
19 Correct 1503 ms 6028 KB Output is correct
20 Correct 1303 ms 5900 KB Output is correct
21 Correct 1204 ms 5792 KB Output is correct
22 Correct 857 ms 5592 KB Output is correct
23 Correct 767 ms 5464 KB Output is correct
24 Correct 933 ms 6368 KB Output is correct
25 Correct 849 ms 6124 KB Output is correct
26 Correct 1845 ms 9828 KB Output is correct
27 Correct 2156 ms 9636 KB Output is correct
28 Correct 1847 ms 9748 KB Output is correct
29 Correct 1620 ms 9656 KB Output is correct
30 Correct 2121 ms 9732 KB Output is correct
31 Correct 2104 ms 9548 KB Output is correct
32 Correct 2151 ms 9488 KB Output is correct
33 Correct 1886 ms 9696 KB Output is correct
34 Correct 1782 ms 9740 KB Output is correct
35 Correct 1794 ms 9732 KB Output is correct
36 Correct 1649 ms 9616 KB Output is correct
37 Correct 1667 ms 9588 KB Output is correct
38 Correct 1515 ms 9740 KB Output is correct
39 Correct 1129 ms 9348 KB Output is correct
40 Correct 1126 ms 9532 KB Output is correct
41 Correct 1068 ms 9280 KB Output is correct
42 Correct 1120 ms 10072 KB Output is correct
43 Correct 1109 ms 10140 KB Output is correct
44 Correct 1207 ms 9988 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 43 ms 2864 KB Output is correct
4 Correct 4 ms 2644 KB Output is correct
5 Correct 17 ms 2788 KB Output is correct
6 Correct 16 ms 2784 KB Output is correct
7 Correct 20 ms 2808 KB Output is correct
8 Correct 20 ms 2808 KB Output is correct
9 Correct 24 ms 2792 KB Output is correct
10 Correct 21 ms 2772 KB Output is correct
11 Correct 21 ms 2800 KB Output is correct
12 Correct 23 ms 2804 KB Output is correct
13 Correct 28 ms 2804 KB Output is correct
14 Correct 26 ms 2772 KB Output is correct
15 Correct 21 ms 2772 KB Output is correct
16 Correct 22 ms 2772 KB Output is correct
17 Correct 23 ms 2800 KB Output is correct
18 Correct 1839 ms 7116 KB Output is correct
19 Correct 1784 ms 9744 KB Output is correct
20 Correct 1807 ms 9784 KB Output is correct
21 Correct 1768 ms 9948 KB Output is correct
22 Correct 1748 ms 9632 KB Output is correct
23 Correct 2443 ms 9664 KB Output is correct
24 Correct 2365 ms 9684 KB Output is correct
25 Correct 2409 ms 9656 KB Output is correct
26 Correct 32 ms 4564 KB Output is correct
27 Correct 1532 ms 8568 KB Output is correct
28 Correct 1478 ms 8608 KB Output is correct
29 Correct 1484 ms 9276 KB Output is correct
30 Correct 1450 ms 10116 KB Output is correct
31 Correct 1570 ms 6076 KB Output is correct
32 Correct 1062 ms 4380 KB Output is correct
33 Correct 1644 ms 6212 KB Output is correct
34 Correct 1348 ms 6140 KB Output is correct
35 Correct 32 ms 3252 KB Output is correct
36 Correct 1503 ms 6028 KB Output is correct
37 Correct 1303 ms 5900 KB Output is correct
38 Correct 1204 ms 5792 KB Output is correct
39 Correct 857 ms 5592 KB Output is correct
40 Correct 767 ms 5464 KB Output is correct
41 Correct 933 ms 6368 KB Output is correct
42 Correct 849 ms 6124 KB Output is correct
43 Correct 2128 ms 9768 KB Output is correct
44 Correct 32 ms 4608 KB Output is correct
45 Correct 237 ms 9484 KB Output is correct
46 Correct 101 ms 9596 KB Output is correct
47 Correct 1131 ms 11380 KB Output is correct
48 Correct 2162 ms 12728 KB Output is correct
49 Correct 1062 ms 11336 KB Output is correct
50 Correct 974 ms 9152 KB Output is correct
51 Correct 919 ms 9404 KB Output is correct
52 Correct 921 ms 8888 KB Output is correct
53 Correct 1426 ms 10968 KB Output is correct
54 Correct 1426 ms 10964 KB Output is correct
55 Correct 1510 ms 11108 KB Output is correct
56 Correct 901 ms 11396 KB Output is correct
57 Correct 994 ms 11476 KB Output is correct
58 Correct 2074 ms 12772 KB Output is correct
59 Correct 2092 ms 12660 KB Output is correct
60 Correct 2087 ms 12792 KB Output is correct
61 Correct 1936 ms 12912 KB Output is correct
62 Correct 1608 ms 11516 KB Output is correct
63 Correct 1610 ms 11696 KB Output is correct
64 Correct 2118 ms 12612 KB Output is correct
65 Correct 1101 ms 10376 KB Output is correct
66 Correct 1845 ms 9828 KB Output is correct
67 Correct 2156 ms 9636 KB Output is correct
68 Correct 1847 ms 9748 KB Output is correct
69 Correct 1620 ms 9656 KB Output is correct
70 Correct 2121 ms 9732 KB Output is correct
71 Correct 2104 ms 9548 KB Output is correct
72 Correct 2151 ms 9488 KB Output is correct
73 Correct 1886 ms 9696 KB Output is correct
74 Correct 1782 ms 9740 KB Output is correct
75 Correct 1794 ms 9732 KB Output is correct
76 Correct 1649 ms 9616 KB Output is correct
77 Correct 1667 ms 9588 KB Output is correct
78 Correct 1515 ms 9740 KB Output is correct
79 Correct 1129 ms 9348 KB Output is correct
80 Correct 1126 ms 9532 KB Output is correct
81 Correct 1068 ms 9280 KB Output is correct
82 Correct 1120 ms 10072 KB Output is correct
83 Correct 1109 ms 10140 KB Output is correct
84 Correct 1207 ms 9988 KB Output is correct
85 Correct 2911 ms 13264 KB Output is correct
86 Correct 285 ms 9528 KB Output is correct
87 Correct 171 ms 9536 KB Output is correct
88 Correct 1955 ms 11664 KB Output is correct
89 Correct 2878 ms 13004 KB Output is correct
90 Correct 1880 ms 11760 KB Output is correct
91 Correct 1852 ms 9820 KB Output is correct
92 Correct 1827 ms 9768 KB Output is correct
93 Correct 2463 ms 9628 KB Output is correct
94 Correct 2370 ms 11460 KB Output is correct
95 Correct 2335 ms 11916 KB Output is correct
96 Correct 2573 ms 11528 KB Output is correct
97 Correct 1363 ms 11232 KB Output is correct
98 Correct 1495 ms 11896 KB Output is correct
99 Correct 2879 ms 13008 KB Output is correct
100 Correct 2808 ms 12992 KB Output is correct
101 Correct 2885 ms 12872 KB Output is correct
102 Correct 2887 ms 13100 KB Output is correct
103 Correct 2705 ms 11976 KB Output is correct
104 Correct 2679 ms 12084 KB Output is correct
105 Correct 2117 ms 12516 KB Output is correct
106 Correct 1668 ms 11952 KB Output is correct
107 Correct 1849 ms 11612 KB Output is correct
108 Correct 2805 ms 12808 KB Output is correct
109 Correct 1964 ms 10544 KB Output is correct