oj.uz

Submission #773480

# Submission time Handle Problem Language Result Execution time Memory
773480 2023-07-05T05:56:14 Z Magikarp4000 Bridges (APIO19_bridges) C++17
100 / 100
 2164 ms 19744 KB 
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast")
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

struct Query {
    int idx,x,y;
};

const int MAXN = 1e5+1, BLOCK = 416;
int n,m,q;
int p[MAXN], sz[MAXN], res[MAXN];
vector<pair<PII,PII>> e;
vector<Query> qu1, qu2;
int ans, mp[MAXN];
set<PII> h;
vector<PII> edges;
int wt[MAXN];
vector<int> v[MAXN];
int val[MAXN];
bool z[MAXN], z1[MAXN], z2[MAXN], z3[MAXN];
bool prnt[MAXN];

int finds(int a) {
  if (p[a] != a) p[a] = finds(p[a]);
  return p[a];
}

void unite(int a, int b) {
  a = finds(a);
  b = finds(b);
  if (a != b) {
    if (sz[a] < sz[b]) swap(a,b);
    p[b] = a;
    sz[a] += sz[b];
  }
}

void dfs(int s) {
    if (z[s]) return;
    z[s] = 1;
    ans += sz[s];
    FORX(u,v[s]) {
        dfs(u);
    }
}

bool cmp(const Query& a, const Query& b) {
    return a.y > b.y;
}

signed main() {
    OPTM;
    cin >> n >> m;
    FOR(i,0,m) {
        int a,b,w; cin >> a >> b >> w;
        e.PB({{w,i},{a,b}});
        h.insert({-w,i});
        edges.PB({a,b});
        wt[i] = w;
    }
    //sort(ALL(e),greater<pair<PII,PII>>());
    
    cin >> q;
    int i = 0;
    while (i < q) {
        int bruh = 0;
        FORX(u,h) {
            e[bruh] = {{-u.F,u.S},edges[u.S]};
            bruh++;
        }
        FOR(l,0,m) mp[e[l].F.S] = l;
        qu1.clear(); qu2.clear();
        FOR(l,1,n+1) {
            p[l] = l;
            sz[l] = 1;
        }
        int j = 0;
        vector<int> vis;
        while (j < BLOCK && i < q) {
            int t,s,w; cin >> t >> s >> w;
            if (t == 1) {
                qu1.PB({i,s-1,w});
                if (!z3[s-1]) {
                    z3[s-1] = 1;
                    vis.PB(s-1);
                }
            }
            else {
                qu2.PB({i,s,w});
                prnt[i] = 1;
            }
            j++; i++;
        }
        sort(ALL(qu2),cmp);
        vector<pair<int,PII>> e1;
        FOR(j,0,m) if (!z3[e[j].F.S]) e1.PB({e[j].F.F,e[j].S});
        int en = e1.size();
        int q1n = qu1.size(), q2n = qu2.size();
        int k = 0;
        FOR(j,0,q2n) {
            // cout << "--------------------------------------- " << j << ln;
            // cout << qu2[j].idx << " " << qu2[j].x << " " << qu2[j].y << ln;
            while (k < en && e1[k].F >= qu2[j].y) {
                unite(e1[k].S.F, e1[k].S.S);
                k++;
            }
            //ans = sz[finds(qu2[j].x)];
            ans = 0;
            // FOR(l,0,m) cout << val[l] << ' ';
            // cout << ln;
            FOR(l,0,q1n) {
                int pos = mp[qu1[l].x], w = qu1[l].y;
                if (qu1[l].idx < qu2[j].idx) val[pos] = w;
                else if (!val[pos]) val[pos] = e[pos].F.F;
            }
            vector<int> toclear;
            FOR(l,0,q1n) {
                int pos = mp[qu1[l].x];
                if (!z1[pos] && val[pos] >= qu2[j].y) {
                    int a = finds(e[pos].S.F), b = finds(e[pos].S.S);
                    z1[pos] = 1;
                    v[a].PB(b);
                    v[b].PB(a);
                    if (!z2[a]) {
                        z2[a] = 1;
                        toclear.PB(a);
                    }
                    if (!z2[b]) {
                        z2[b] = 1;
                        toclear.PB(b);
                    }
                }
            }
            // cout << "finds: " << finds(qu2[j].x) << ln;
            // FOR(l,1,n+1) cout << z[l] << ' ';
            // cout << ln;
            int start = finds(qu2[j].x);
            dfs(start);
            if (!z2[start]) {
                z2[start] = 1;
                toclear.PB(start);
            }
            // FOR(l,1,n+1) cout << sz[l] << ' ';
            // cout << ln;
            // cout << "ans: " << ans << ln;
            res[qu2[j].idx] = ans;
            // FOR(l,1,n+1) {
            //     cout << l << ": ";
            //     FORX(u,v[l]) cout << u << ' ';
            //     cout << ln;
            // }
            // cout << ln;
            FORX(u,toclear) {
                //cout << u << ' ';
                z[u] = z2[u] = 0;
                v[u].clear();
            }
            FORX(u,vis) z3[u] = 0;
            // cout << ln;
            FOR(l,0,q1n) val[mp[qu1[l].x]] = z1[mp[qu1[l].x]] = 0;
        }
        // FOR(i,1,n+1) cout << finds(i) << ' ';
        // cout << ln;
        FOR(l,0,q1n) {
            int pos = qu1[l].x;
            h.erase({-wt[pos],pos});
            wt[pos] = qu1[l].y;
            h.insert({-wt[pos],pos});
        }
    }
    FOR(i,0,q) if (prnt[i]) cout << res[i] << ln;
}

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 2688 KB Output is correct
3 Correct 19 ms 3044 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 16 ms 2900 KB Output is correct
6 Correct 13 ms 2932 KB Output is correct
7 Correct 15 ms 2772 KB Output is correct
8 Correct 17 ms 2912 KB Output is correct
9 Correct 16 ms 2772 KB Output is correct
10 Correct 15 ms 2916 KB Output is correct
11 Correct 16 ms 2900 KB Output is correct
12 Correct 16 ms 2900 KB Output is correct
13 Correct 18 ms 2920 KB Output is correct
14 Correct 17 ms 2964 KB Output is correct
15 Correct 17 ms 2932 KB Output is correct
16 Correct 16 ms 2840 KB Output is correct
17 Correct 16 ms 2772 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 985 ms 13340 KB Output is correct
2 Correct 987 ms 13304 KB Output is correct
3 Correct 1002 ms 13392 KB Output is correct
4 Correct 982 ms 13376 KB Output is correct
5 Correct 979 ms 13432 KB Output is correct
6 Correct 1126 ms 12060 KB Output is correct
7 Correct 1133 ms 12092 KB Output is correct
8 Correct 1151 ms 12088 KB Output is correct
9 Correct 30 ms 4684 KB Output is correct
10 Correct 912 ms 12012 KB Output is correct
11 Correct 897 ms 12060 KB Output is correct
12 Correct 865 ms 11780 KB Output is correct
13 Correct 942 ms 12480 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 812 ms 10332 KB Output is correct
2 Correct 413 ms 6052 KB Output is correct
3 Correct 747 ms 10076 KB Output is correct
4 Correct 707 ms 10340 KB Output is correct
5 Correct 43 ms 4684 KB Output is correct
6 Correct 716 ms 10140 KB Output is correct
7 Correct 676 ms 10136 KB Output is correct
8 Correct 634 ms 10156 KB Output is correct
9 Correct 541 ms 9640 KB Output is correct
10 Correct 539 ms 9728 KB Output is correct
11 Correct 592 ms 10320 KB Output is correct
12 Correct 531 ms 10380 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1605 ms 18044 KB Output is correct
2 Correct 30 ms 4684 KB Output is correct
3 Correct 169 ms 15124 KB Output is correct
4 Correct 101 ms 15284 KB Output is correct
5 Correct 1188 ms 16540 KB Output is correct
6 Correct 1535 ms 18048 KB Output is correct
7 Correct 1240 ms 16552 KB Output is correct
8 Correct 716 ms 11788 KB Output is correct
9 Correct 696 ms 11892 KB Output is correct
10 Correct 714 ms 11512 KB Output is correct
11 Correct 1233 ms 15164 KB Output is correct
12 Correct 1323 ms 15304 KB Output is correct
13 Correct 1325 ms 15048 KB Output is correct
14 Correct 1108 ms 16540 KB Output is correct
15 Correct 1069 ms 16700 KB Output is correct
16 Correct 1600 ms 18040 KB Output is correct
17 Correct 1606 ms 17912 KB Output is correct
18 Correct 1644 ms 18004 KB Output is correct
19 Correct 1870 ms 17972 KB Output is correct
20 Correct 1497 ms 15996 KB Output is correct
21 Correct 1559 ms 15844 KB Output is correct
22 Correct 1469 ms 17400 KB Output is correct
23 Correct 1105 ms 14480 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 985 ms 13340 KB Output is correct
2 Correct 987 ms 13304 KB Output is correct
3 Correct 1002 ms 13392 KB Output is correct
4 Correct 982 ms 13376 KB Output is correct
5 Correct 979 ms 13432 KB Output is correct
6 Correct 1126 ms 12060 KB Output is correct
7 Correct 1133 ms 12092 KB Output is correct
8 Correct 1151 ms 12088 KB Output is correct
9 Correct 30 ms 4684 KB Output is correct
10 Correct 912 ms 12012 KB Output is correct
11 Correct 897 ms 12060 KB Output is correct
12 Correct 865 ms 11780 KB Output is correct
13 Correct 942 ms 12480 KB Output is correct
14 Correct 812 ms 10332 KB Output is correct
15 Correct 413 ms 6052 KB Output is correct
16 Correct 747 ms 10076 KB Output is correct
17 Correct 707 ms 10340 KB Output is correct
18 Correct 43 ms 4684 KB Output is correct
19 Correct 716 ms 10140 KB Output is correct
20 Correct 676 ms 10136 KB Output is correct
21 Correct 634 ms 10156 KB Output is correct
22 Correct 541 ms 9640 KB Output is correct
23 Correct 539 ms 9728 KB Output is correct
24 Correct 592 ms 10320 KB Output is correct
25 Correct 531 ms 10380 KB Output is correct
26 Correct 969 ms 13228 KB Output is correct
27 Correct 1101 ms 13052 KB Output is correct
28 Correct 1020 ms 13320 KB Output is correct
29 Correct 877 ms 13308 KB Output is correct
30 Correct 1096 ms 13116 KB Output is correct
31 Correct 1114 ms 13124 KB Output is correct
32 Correct 1092 ms 13104 KB Output is correct
33 Correct 1047 ms 13448 KB Output is correct
34 Correct 1106 ms 13392 KB Output is correct
35 Correct 1118 ms 13424 KB Output is correct
36 Correct 1008 ms 13208 KB Output is correct
37 Correct 979 ms 13240 KB Output is correct
38 Correct 975 ms 13240 KB Output is correct
39 Correct 842 ms 12572 KB Output is correct
40 Correct 896 ms 12532 KB Output is correct
41 Correct 842 ms 12532 KB Output is correct
42 Correct 923 ms 13396 KB Output is correct
43 Correct 854 ms 13396 KB Output is correct
44 Correct 825 ms 13356 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 2688 KB Output is correct
3 Correct 19 ms 3044 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 16 ms 2900 KB Output is correct
6 Correct 13 ms 2932 KB Output is correct
7 Correct 15 ms 2772 KB Output is correct
8 Correct 17 ms 2912 KB Output is correct
9 Correct 16 ms 2772 KB Output is correct
10 Correct 15 ms 2916 KB Output is correct
11 Correct 16 ms 2900 KB Output is correct
12 Correct 16 ms 2900 KB Output is correct
13 Correct 18 ms 2920 KB Output is correct
14 Correct 17 ms 2964 KB Output is correct
15 Correct 17 ms 2932 KB Output is correct
16 Correct 16 ms 2840 KB Output is correct
17 Correct 16 ms 2772 KB Output is correct
18 Correct 985 ms 13340 KB Output is correct
19 Correct 987 ms 13304 KB Output is correct
20 Correct 1002 ms 13392 KB Output is correct
21 Correct 982 ms 13376 KB Output is correct
22 Correct 979 ms 13432 KB Output is correct
23 Correct 1126 ms 12060 KB Output is correct
24 Correct 1133 ms 12092 KB Output is correct
25 Correct 1151 ms 12088 KB Output is correct
26 Correct 30 ms 4684 KB Output is correct
27 Correct 912 ms 12012 KB Output is correct
28 Correct 897 ms 12060 KB Output is correct
29 Correct 865 ms 11780 KB Output is correct
30 Correct 942 ms 12480 KB Output is correct
31 Correct 812 ms 10332 KB Output is correct
32 Correct 413 ms 6052 KB Output is correct
33 Correct 747 ms 10076 KB Output is correct
34 Correct 707 ms 10340 KB Output is correct
35 Correct 43 ms 4684 KB Output is correct
36 Correct 716 ms 10140 KB Output is correct
37 Correct 676 ms 10136 KB Output is correct
38 Correct 634 ms 10156 KB Output is correct
39 Correct 541 ms 9640 KB Output is correct
40 Correct 539 ms 9728 KB Output is correct
41 Correct 592 ms 10320 KB Output is correct
42 Correct 531 ms 10380 KB Output is correct
43 Correct 1605 ms 18044 KB Output is correct
44 Correct 30 ms 4684 KB Output is correct
45 Correct 169 ms 15124 KB Output is correct
46 Correct 101 ms 15284 KB Output is correct
47 Correct 1188 ms 16540 KB Output is correct
48 Correct 1535 ms 18048 KB Output is correct
49 Correct 1240 ms 16552 KB Output is correct
50 Correct 716 ms 11788 KB Output is correct
51 Correct 696 ms 11892 KB Output is correct
52 Correct 714 ms 11512 KB Output is correct
53 Correct 1233 ms 15164 KB Output is correct
54 Correct 1323 ms 15304 KB Output is correct
55 Correct 1325 ms 15048 KB Output is correct
56 Correct 1108 ms 16540 KB Output is correct
57 Correct 1069 ms 16700 KB Output is correct
58 Correct 1600 ms 18040 KB Output is correct
59 Correct 1606 ms 17912 KB Output is correct
60 Correct 1644 ms 18004 KB Output is correct
61 Correct 1870 ms 17972 KB Output is correct
62 Correct 1497 ms 15996 KB Output is correct
63 Correct 1559 ms 15844 KB Output is correct
64 Correct 1469 ms 17400 KB Output is correct
65 Correct 1105 ms 14480 KB Output is correct
66 Correct 969 ms 13228 KB Output is correct
67 Correct 1101 ms 13052 KB Output is correct
68 Correct 1020 ms 13320 KB Output is correct
69 Correct 877 ms 13308 KB Output is correct
70 Correct 1096 ms 13116 KB Output is correct
71 Correct 1114 ms 13124 KB Output is correct
72 Correct 1092 ms 13104 KB Output is correct
73 Correct 1047 ms 13448 KB Output is correct
74 Correct 1106 ms 13392 KB Output is correct
75 Correct 1118 ms 13424 KB Output is correct
76 Correct 1008 ms 13208 KB Output is correct
77 Correct 979 ms 13240 KB Output is correct
78 Correct 975 ms 13240 KB Output is correct
79 Correct 842 ms 12572 KB Output is correct
80 Correct 896 ms 12532 KB Output is correct
81 Correct 842 ms 12532 KB Output is correct
82 Correct 923 ms 13396 KB Output is correct
83 Correct 854 ms 13396 KB Output is correct
84 Correct 825 ms 13356 KB Output is correct
85 Correct 2021 ms 19684 KB Output is correct
86 Correct 186 ms 15856 KB Output is correct
87 Correct 135 ms 15864 KB Output is correct
88 Correct 1547 ms 17908 KB Output is correct
89 Correct 1987 ms 19664 KB Output is correct
90 Correct 1590 ms 17456 KB Output is correct
91 Correct 1101 ms 13256 KB Output is correct
92 Correct 1049 ms 13504 KB Output is correct
93 Correct 1145 ms 12444 KB Output is correct
94 Correct 1582 ms 16944 KB Output is correct
95 Correct 1649 ms 17024 KB Output is correct
96 Correct 1546 ms 15872 KB Output is correct
97 Correct 1297 ms 17096 KB Output is correct
98 Correct 1447 ms 17752 KB Output is correct
99 Correct 2164 ms 19532 KB Output is correct
100 Correct 1858 ms 19540 KB Output is correct
101 Correct 1988 ms 19744 KB Output is correct
102 Correct 1855 ms 19656 KB Output is correct
103 Correct 1780 ms 16576 KB Output is correct
104 Correct 1840 ms 16596 KB Output is correct
105 Correct 1606 ms 16900 KB Output is correct
106 Correct 1298 ms 16276 KB Output is correct
107 Correct 1421 ms 16436 KB Output is correct
108 Correct 1732 ms 18084 KB Output is correct
109 Correct 1546 ms 15056 KB Output is correct