oj.uz

Submission #1094185

# Submission time Handle Problem Language Result Execution time Memory
1094185 2024-09-28T21:37:45 Z vladilius Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 2000 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<ll, 3>
const ll inf = 1e15;
const int N = 2e5;

struct node{
    ll x;
    int l, r, s;
    node(){
        l = r = x = s = 0;
    }
};

vector<node> all = {node()};
int CC = 0;

int nw(){
    all.pb(node());
    return ++CC;
}

struct DS{
    vector<pair<int, ll>> vv;
    int rt;
    void init(){
        rt = nw();
    }
    int size(){
        return all[rt].s;
    }
    void fn(int v, int tl, int tr){
        if (!all[v].s) return;
        if (tl == tr){
            vv.pb({tl, all[v].x});
            return;
        }
        int tm = (tl + tr) / 2;
        if (all[v].l) fn(all[v].l, tl, tm);
        if (all[v].r) fn(all[v].r, tm + 1, tr);
    }
    void fn(){
        vv.clear();
        fn(rt, 1, N);
    }
    void recalc(int v){
        all[v].x = all[v].s = 0;
        if (all[v].l){
            all[v].x += all[all[v].l].x;
            all[v].s += all[all[v].l].s;
        }
        if (all[v].r){
            all[v].x += all[all[v].r].x;
            all[v].s += all[all[v].r].s;
        }
    }
    void add(int v, int tl, int tr, int& p, ll& x){
        if (tl == tr){
            all[v].x += x;
            all[v].s = 1;
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            if (!all[v].l) all[v].l = nw();
            add(all[v].l, tl, tm, p, x);
        }
        else {
            if (!all[v].r) all[v].r = nw();
            add(all[v].r, tm + 1, tr, p, x);
        }
        recalc(v);
    }
    void add(int l, int r, ll x){
        add(rt, 1, N, l, x);
        r++; x = -x;
        if (r <= N) add(rt, 1, N, r, x);
    }
    void add1(int& p, ll& x){
        add(rt, 1, N, p, x);
    }
    void clear(int& v, int tl, int tr, int l, int r){
        if (l > tr || r < tl) return;
        if (l <= tl && tr <= r){
            all[v] = node();
            return;
        }
        int tm = (tl + tr) / 2;
        if (all[v].l) clear(all[v].l, tl, tm, l, r);
        if (all[v].r) clear(all[v].r, tm + 1, tr, l, r);
        recalc(v);
    }
    void upd(int v, int tl, int tr, int& p, ll& x){
        if (tl == tr){
            all[v].x = x;
            all[v].s = 1;
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            if (!all[v].l) all[v].l = nw();
            upd(all[v].l, tl, tm, p, x);
        }
        else {
            if (!all[v].r) all[v].r = nw();
            upd(all[v].r, tm + 1, tr, p, x);
        }
        recalc(v);
    }
    void upd(int p, ll x){
        upd(rt, 1, N, p, x);
    }
    void ch(int l, int r, ll x){
        ll S1 = 0, S2 = get(l - 1);
        if (r < N) S1 = get(r + 1);

        if (l < r) clear(rt, 1, N, l + 1, r);
        upd(l, x - S2);
        if (r < N) upd(r + 1, S1 - x);
    }
    ll get(int v, int tl, int tr, int& l, int& r){
        if (l > tr || r < tl) return 0;
        if (l <= tl && tr <= r) return all[v].x;
        int tm = (tl + tr) / 2;
        ll out = 0;
        if (all[v].l) out += get(all[v].l, tl, tm, l, r);
        if (all[v].r) out += get(all[v].r, tm + 1, tr, l, r);
        return out;
    }
    ll get(int p){
        if (!p) return 0;
        int l = 1;
        return get(rt, 1, N, l, p);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n; cin>>n;
    vector<int> a(n + 1), h(n + 1), c(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>a[i]>>h[i]>>c[i];
    }
    
    vector<pii> all;
    for (int i = 1; i <= n; i++) all.pb({h[i], i});
    sort(all.begin(), all.end());
    int i = 0, cc = 0;
    while (i < all.size()){
        int j = i;
        while (j < all.size() && all[i] == all[j]){
            j++;
        }
        cc++;
        while (i < j){
            h[all[i].ss] = cc;
            i++;
        }
    }
    
    vector<int> g1[n + 1];
    for (int i = 1; i <= n; i++){
        if (a[i] != i) g1[a[i]].pb(i);
    }
    vector<bool> used(n + 1), seen(n + 1);
    vector<int> dd(n + 1), d[n + 1], st;
    function<void(int)> dfs = [&](int v){
        seen[v] = used[v] = 1;
        st.pb(v);
        for (int i: g1[v]){
            if (used[i]){
                if (seen[i]){
                    for (int j: st){
                        dd[j] = st[0];
                    }
                }
                continue;
            }
            dfs(i);
        }
        seen[v] = 0; st.pop_back();
    };
    
    for (int i = 1; i <= n; i++){
        if (!used[i]){
            dfs(i);
        }
    }
    
    vector<int> g[n + 1];
    for (int i = 1; i <= n; i++){
        if (!dd[i]) dd[i] = i;
        d[dd[i]].pb(i);
    }
    for (int i = 1; i <= n; i++){
        int x = dd[a[i]], y = dd[i];
        if (x != y) g[x].pb(y);
    }
    
    vector<ll> sum(cc + 1);
    DS T[n + 1];
    function<void(int)> solve = [&](int v){
        used[v] = 1;
        for (int i: g[v]) solve(i);
        
        T[v].init();
        for (int i: g[v]){
            if (T[v].size() < T[i].size()) swap(T[v], T[i]);
            T[i].fn();
            for (auto [p, x]: T[i].vv){
                T[v].add1(p, x);
            }
        }
        
        ll S = 0;
        for (int i: d[v]) S += c[i];
        
        vector<int> t;
        for (int i: d[v]){
            t.pb(h[i]);
            sum[h[i]] = 0;
        }
        for (int i: d[v]) sum[h[i]] += c[i];
        
        sort(t.begin(), t.end());
        int pre = 1;
        for (int i: t){
            if (pre < i){
                T[v].add(pre, i - 1, S);
            }
            pre = i + 1;
            T[v].add(i, i, S - sum[i]);
            ll X = T[v].get(i);
            
            if (i == 1 || T[v].get(i - 1) <= X) continue;
            int l = 1, r = i - 1;
            while (l + 1 < r){
                int m = (l + r) / 2;
                ll k = T[v].get(m);
                if (k <= X){
                    l = m + 1;
                }
                else {
                    r = m;
                }
            }
            if (T[v].get(l) > X) r = l;
            
            T[v].ch(r, i - 1, X);
        }
        
        if (pre <= cc){
            T[v].add(pre, cc, S);
        }
    };
    fill(used.begin(), used.end(), 0);
    ll out = 0;
    for (int i = 1; i <= n; i++){
        if (!used[i]){
            solve(i);
            out += T[i].get(1);
        }
    }
    cout<<out<<"\n";
}

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:157:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |     while (i < all.size()){
      |            ~~^~~~~~~~~~~~
worst_reporter2.cpp:159:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |         while (j < all.size() && all[i] == all[j]){
      |                ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 29 ms 7968 KB Output is correct
6 Correct 24 ms 7892 KB Output is correct
7 Correct 25 ms 7892 KB Output is correct
8 Correct 26 ms 7852 KB Output is correct
9 Correct 25 ms 7892 KB Output is correct
10 Correct 24 ms 7880 KB Output is correct
11 Correct 28 ms 7892 KB Output is correct
12 Correct 17 ms 4828 KB Output is correct
13 Correct 14 ms 4088 KB Output is correct
14 Correct 17 ms 4124 KB Output is correct
15 Correct 17 ms 4052 KB Output is correct
16 Correct 34 ms 14464 KB Output is correct
17 Correct 28 ms 14528 KB Output is correct
18 Correct 21 ms 8156 KB Output is correct
19 Correct 19 ms 5340 KB Output is correct
20 Correct 20 ms 5312 KB Output is correct
21 Correct 17 ms 5344 KB Output is correct
22 Correct 21 ms 7656 KB Output is correct
23 Correct 20 ms 7608 KB Output is correct
24 Correct 19 ms 5340 KB Output is correct
25 Correct 19 ms 5340 KB Output is correct
26 Correct 8 ms 3676 KB Output is correct
27 Correct 20 ms 8400 KB Output is correct
28 Correct 18 ms 5592 KB Output is correct
29 Correct 21 ms 5844 KB Output is correct
30 Correct 9 ms 3160 KB Output is correct
31 Correct 10 ms 3128 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 29 ms 7968 KB Output is correct
6 Correct 24 ms 7892 KB Output is correct
7 Correct 25 ms 7892 KB Output is correct
8 Correct 26 ms 7852 KB Output is correct
9 Correct 25 ms 7892 KB Output is correct
10 Correct 24 ms 7880 KB Output is correct
11 Correct 28 ms 7892 KB Output is correct
12 Correct 17 ms 4828 KB Output is correct
13 Correct 14 ms 4088 KB Output is correct
14 Correct 17 ms 4124 KB Output is correct
15 Correct 17 ms 4052 KB Output is correct
16 Correct 34 ms 14464 KB Output is correct
17 Correct 28 ms 14528 KB Output is correct
18 Correct 21 ms 8156 KB Output is correct
19 Correct 19 ms 5340 KB Output is correct
20 Correct 20 ms 5312 KB Output is correct
21 Correct 17 ms 5344 KB Output is correct
22 Correct 21 ms 7656 KB Output is correct
23 Correct 20 ms 7608 KB Output is correct
24 Correct 19 ms 5340 KB Output is correct
25 Correct 19 ms 5340 KB Output is correct
26 Correct 8 ms 3676 KB Output is correct
27 Correct 20 ms 8400 KB Output is correct
28 Correct 18 ms 5592 KB Output is correct
29 Correct 21 ms 5844 KB Output is correct
30 Correct 9 ms 3160 KB Output is correct
31 Correct 10 ms 3128 KB Output is correct
32 Correct 24 ms 7888 KB Output is correct
33 Correct 1491 ms 456912 KB Output is correct
34 Correct 1461 ms 456552 KB Output is correct
35 Correct 1458 ms 459296 KB Output is correct
36 Correct 1393 ms 459456 KB Output is correct
37 Correct 1412 ms 460716 KB Output is correct
38 Correct 1364 ms 459972 KB Output is correct
39 Correct 948 ms 211512 KB Output is correct
40 Correct 917 ms 161936 KB Output is correct
41 Correct 572 ms 137384 KB Output is correct
42 Correct 911 ms 181092 KB Output is correct
43 Correct 873 ms 131732 KB Output is correct
44 Correct 1471 ms 484424 KB Output is correct
45 Correct 1430 ms 462004 KB Output is correct
46 Correct 1043 ms 477764 KB Output is correct
47 Correct 1174 ms 279000 KB Output is correct
48 Correct 1109 ms 279368 KB Output is correct
49 Correct 748 ms 279432 KB Output is correct
50 Correct 918 ms 241344 KB Output is correct
51 Correct 871 ms 241476 KB Output is correct
52 Correct 958 ms 280304 KB Output is correct
53 Correct 981 ms 280308 KB Output is correct
54 Correct 281 ms 137644 KB Output is correct
55 Correct 905 ms 277432 KB Output is correct
56 Correct 799 ms 193232 KB Output is correct
57 Correct 667 ms 150424 KB Output is correct
58 Correct 381 ms 106604 KB Output is correct
59 Correct 324 ms 106572 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 29 ms 7968 KB Output is correct
6 Correct 24 ms 7892 KB Output is correct
7 Correct 25 ms 7892 KB Output is correct
8 Correct 26 ms 7852 KB Output is correct
9 Correct 25 ms 7892 KB Output is correct
10 Correct 24 ms 7880 KB Output is correct
11 Correct 28 ms 7892 KB Output is correct
12 Correct 17 ms 4828 KB Output is correct
13 Correct 14 ms 4088 KB Output is correct
14 Correct 17 ms 4124 KB Output is correct
15 Correct 17 ms 4052 KB Output is correct
16 Correct 34 ms 14464 KB Output is correct
17 Correct 28 ms 14528 KB Output is correct
18 Correct 21 ms 8156 KB Output is correct
19 Correct 19 ms 5340 KB Output is correct
20 Correct 20 ms 5312 KB Output is correct
21 Correct 17 ms 5344 KB Output is correct
22 Correct 21 ms 7656 KB Output is correct
23 Correct 20 ms 7608 KB Output is correct
24 Correct 19 ms 5340 KB Output is correct
25 Correct 19 ms 5340 KB Output is correct
26 Correct 8 ms 3676 KB Output is correct
27 Correct 20 ms 8400 KB Output is correct
28 Correct 18 ms 5592 KB Output is correct
29 Correct 21 ms 5844 KB Output is correct
30 Correct 9 ms 3160 KB Output is correct
31 Correct 10 ms 3128 KB Output is correct
32 Correct 24 ms 7888 KB Output is correct
33 Correct 1491 ms 456912 KB Output is correct
34 Correct 1461 ms 456552 KB Output is correct
35 Correct 1458 ms 459296 KB Output is correct
36 Correct 1393 ms 459456 KB Output is correct
37 Correct 1412 ms 460716 KB Output is correct
38 Correct 1364 ms 459972 KB Output is correct
39 Correct 948 ms 211512 KB Output is correct
40 Correct 917 ms 161936 KB Output is correct
41 Correct 572 ms 137384 KB Output is correct
42 Correct 911 ms 181092 KB Output is correct
43 Correct 873 ms 131732 KB Output is correct
44 Correct 1471 ms 484424 KB Output is correct
45 Correct 1430 ms 462004 KB Output is correct
46 Correct 1043 ms 477764 KB Output is correct
47 Correct 1174 ms 279000 KB Output is correct
48 Correct 1109 ms 279368 KB Output is correct
49 Correct 748 ms 279432 KB Output is correct
50 Correct 918 ms 241344 KB Output is correct
51 Correct 871 ms 241476 KB Output is correct
52 Correct 958 ms 280304 KB Output is correct
53 Correct 981 ms 280308 KB Output is correct
54 Correct 281 ms 137644 KB Output is correct
55 Correct 905 ms 277432 KB Output is correct
56 Correct 799 ms 193232 KB Output is correct
57 Correct 667 ms 150424 KB Output is correct
58 Correct 381 ms 106604 KB Output is correct
59 Correct 324 ms 106572 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Execution timed out 2029 ms 524288 KB Time limit exceeded
65 Halted 0 ms 0 KB -