oj.uz

답안 #805321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805321 2023-08-03T15:13:43 Z bachhoangxuan Worst Reporter 4 (JOI21_worst_reporter4) C++17
100 / 100
 307 ms 112020 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<long long,long long>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
map<int,long long> mp[maxn];

void solve(){
    int n;cin >> n;
    vector<int> a(n+1),c(n+1),h(n+1),deg(n+1,0);
    vector<vector<int>> child(n+1);

    for(int i=1;i<=n;i++){
        cin >> a[i] >> h[i] >> c[i];
        child[a[i]].push_back(i);deg[a[i]]++;
    }

    queue<int> q;
    for(int i=1;i<=n;i++) if(deg[i]==0) q.push(i);
    while(!q.empty()){
        int u=q.front();q.pop();
        deg[a[u]]--;
        if(deg[a[u]]==0) q.push(a[u]);
    }
    auto unions = [&](int u,int v){
        if((int)mp[u].size()<(int)mp[v].size()) swap(mp[u],mp[v]);
        for(auto [x,val]:mp[v]) mp[u][x]+=val;
    };
    function<void(int)> dfs = [&](int u){
        for(int v:child[u]) dfs(v),unions(u,v);
        mp[u][0]+=c[u];
        int del=c[u];
        auto it=mp[u].upper_bound(h[u]);
        while(it!=mp[u].begin()){
            it--;
            if(it->se<=del) del-=it->se,it=mp[u].erase(it);
            else{mp[u][it->fi]-=del;break;}
        }
        mp[u][h[u]+1]+=c[u];
    };
    long long total=0;
    for(int i=1;i<=n;i++){
        if(deg[i]){
            int u=i;
            long long sum=0;
            vector<pii> cc,nw;
            do{
                cc.push_back({h[u],u});sum+=c[u];
                for(int v:child[u]) if(!deg[v]) dfs(v),unions(i,v);
                u=a[u];
            }while(u!=i);
            sort(cc.begin(),cc.end());
            for(auto [x,u]:cc) deg[u]=0;
            for(auto [x,u]:cc){
                if(nw.empty() || nw.back().fi!=x) nw.push_back({x,c[u]});
                else nw.back().se+=c[u];
            }
            cc.clear();
            for(auto [x,val]:mp[i]) cc.push_back({x,val});
            int pos=0;
            long long cur=0,res=sum+mp[i][0];
            for(auto [x,val]:nw){
                while(pos<(int)cc.size() && cc[pos].fi<=x) cur+=cc[pos++].se;
                res=min(res,cur+sum-val);
            }
            total+=res;
        }
    }
    cout << total << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9640 KB Output is correct
5 Correct 8 ms 11092 KB Output is correct
6 Correct 8 ms 10488 KB Output is correct
7 Correct 7 ms 10324 KB Output is correct
8 Correct 9 ms 11184 KB Output is correct
9 Correct 8 ms 10516 KB Output is correct
10 Correct 7 ms 10280 KB Output is correct
11 Correct 6 ms 10068 KB Output is correct
12 Correct 7 ms 10708 KB Output is correct
13 Correct 6 ms 10708 KB Output is correct
14 Correct 7 ms 10452 KB Output is correct
15 Correct 7 ms 10324 KB Output is correct
16 Correct 10 ms 11472 KB Output is correct
17 Correct 7 ms 10708 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 10 ms 10708 KB Output is correct
20 Correct 7 ms 10452 KB Output is correct
21 Correct 6 ms 10452 KB Output is correct
22 Correct 8 ms 10836 KB Output is correct
23 Correct 7 ms 10324 KB Output is correct
24 Correct 9 ms 10812 KB Output is correct
25 Correct 7 ms 10560 KB Output is correct
26 Correct 6 ms 10836 KB Output is correct
27 Correct 7 ms 10836 KB Output is correct
28 Correct 7 ms 10964 KB Output is correct
29 Correct 7 ms 11144 KB Output is correct
30 Correct 8 ms 11140 KB Output is correct
31 Correct 7 ms 11092 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9640 KB Output is correct
5 Correct 8 ms 11092 KB Output is correct
6 Correct 8 ms 10488 KB Output is correct
7 Correct 7 ms 10324 KB Output is correct
8 Correct 9 ms 11184 KB Output is correct
9 Correct 8 ms 10516 KB Output is correct
10 Correct 7 ms 10280 KB Output is correct
11 Correct 6 ms 10068 KB Output is correct
12 Correct 7 ms 10708 KB Output is correct
13 Correct 6 ms 10708 KB Output is correct
14 Correct 7 ms 10452 KB Output is correct
15 Correct 7 ms 10324 KB Output is correct
16 Correct 10 ms 11472 KB Output is correct
17 Correct 7 ms 10708 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 10 ms 10708 KB Output is correct
20 Correct 7 ms 10452 KB Output is correct
21 Correct 6 ms 10452 KB Output is correct
22 Correct 8 ms 10836 KB Output is correct
23 Correct 7 ms 10324 KB Output is correct
24 Correct 9 ms 10812 KB Output is correct
25 Correct 7 ms 10560 KB Output is correct
26 Correct 6 ms 10836 KB Output is correct
27 Correct 7 ms 10836 KB Output is correct
28 Correct 7 ms 10964 KB Output is correct
29 Correct 7 ms 11144 KB Output is correct
30 Correct 8 ms 11140 KB Output is correct
31 Correct 7 ms 11092 KB Output is correct
32 Correct 9 ms 11268 KB Output is correct
33 Correct 295 ms 86568 KB Output is correct
34 Correct 274 ms 57416 KB Output is correct
35 Correct 295 ms 83508 KB Output is correct
36 Correct 211 ms 57472 KB Output is correct
37 Correct 159 ms 38252 KB Output is correct
38 Correct 126 ms 31832 KB Output is correct
39 Correct 130 ms 57164 KB Output is correct
40 Correct 117 ms 57068 KB Output is correct
41 Correct 82 ms 57056 KB Output is correct
42 Correct 120 ms 43208 KB Output is correct
43 Correct 115 ms 43080 KB Output is correct
44 Correct 286 ms 112020 KB Output is correct
45 Correct 211 ms 72144 KB Output is correct
46 Correct 87 ms 31912 KB Output is correct
47 Correct 239 ms 55216 KB Output is correct
48 Correct 105 ms 46196 KB Output is correct
49 Correct 82 ms 46072 KB Output is correct
50 Correct 213 ms 51788 KB Output is correct
51 Correct 87 ms 35200 KB Output is correct
52 Correct 199 ms 55856 KB Output is correct
53 Correct 100 ms 46624 KB Output is correct
54 Correct 85 ms 57212 KB Output is correct
55 Correct 159 ms 58808 KB Output is correct
56 Correct 139 ms 64752 KB Output is correct
57 Correct 135 ms 67668 KB Output is correct
58 Correct 159 ms 65344 KB Output is correct
59 Correct 169 ms 65452 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9640 KB Output is correct
5 Correct 8 ms 11092 KB Output is correct
6 Correct 8 ms 10488 KB Output is correct
7 Correct 7 ms 10324 KB Output is correct
8 Correct 9 ms 11184 KB Output is correct
9 Correct 8 ms 10516 KB Output is correct
10 Correct 7 ms 10280 KB Output is correct
11 Correct 6 ms 10068 KB Output is correct
12 Correct 7 ms 10708 KB Output is correct
13 Correct 6 ms 10708 KB Output is correct
14 Correct 7 ms 10452 KB Output is correct
15 Correct 7 ms 10324 KB Output is correct
16 Correct 10 ms 11472 KB Output is correct
17 Correct 7 ms 10708 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 10 ms 10708 KB Output is correct
20 Correct 7 ms 10452 KB Output is correct
21 Correct 6 ms 10452 KB Output is correct
22 Correct 8 ms 10836 KB Output is correct
23 Correct 7 ms 10324 KB Output is correct
24 Correct 9 ms 10812 KB Output is correct
25 Correct 7 ms 10560 KB Output is correct
26 Correct 6 ms 10836 KB Output is correct
27 Correct 7 ms 10836 KB Output is correct
28 Correct 7 ms 10964 KB Output is correct
29 Correct 7 ms 11144 KB Output is correct
30 Correct 8 ms 11140 KB Output is correct
31 Correct 7 ms 11092 KB Output is correct
32 Correct 9 ms 11268 KB Output is correct
33 Correct 295 ms 86568 KB Output is correct
34 Correct 274 ms 57416 KB Output is correct
35 Correct 295 ms 83508 KB Output is correct
36 Correct 211 ms 57472 KB Output is correct
37 Correct 159 ms 38252 KB Output is correct
38 Correct 126 ms 31832 KB Output is correct
39 Correct 130 ms 57164 KB Output is correct
40 Correct 117 ms 57068 KB Output is correct
41 Correct 82 ms 57056 KB Output is correct
42 Correct 120 ms 43208 KB Output is correct
43 Correct 115 ms 43080 KB Output is correct
44 Correct 286 ms 112020 KB Output is correct
45 Correct 211 ms 72144 KB Output is correct
46 Correct 87 ms 31912 KB Output is correct
47 Correct 239 ms 55216 KB Output is correct
48 Correct 105 ms 46196 KB Output is correct
49 Correct 82 ms 46072 KB Output is correct
50 Correct 213 ms 51788 KB Output is correct
51 Correct 87 ms 35200 KB Output is correct
52 Correct 199 ms 55856 KB Output is correct
53 Correct 100 ms 46624 KB Output is correct
54 Correct 85 ms 57212 KB Output is correct
55 Correct 159 ms 58808 KB Output is correct
56 Correct 139 ms 64752 KB Output is correct
57 Correct 135 ms 67668 KB Output is correct
58 Correct 159 ms 65344 KB Output is correct
59 Correct 169 ms 65452 KB Output is correct
60 Correct 5 ms 9684 KB Output is correct
61 Correct 5 ms 9692 KB Output is correct
62 Correct 5 ms 9684 KB Output is correct
63 Correct 4 ms 9684 KB Output is correct
64 Correct 245 ms 68744 KB Output is correct
65 Correct 205 ms 50124 KB Output is correct
66 Correct 307 ms 66240 KB Output is correct
67 Correct 216 ms 50000 KB Output is correct
68 Correct 157 ms 36272 KB Output is correct
69 Correct 150 ms 31296 KB Output is correct
70 Correct 104 ms 37168 KB Output is correct
71 Correct 96 ms 32252 KB Output is correct
72 Correct 111 ms 38188 KB Output is correct
73 Correct 116 ms 33112 KB Output is correct
74 Correct 188 ms 42940 KB Output is correct
75 Correct 171 ms 33724 KB Output is correct
76 Correct 149 ms 33648 KB Output is correct
77 Correct 155 ms 43356 KB Output is correct
78 Correct 119 ms 34916 KB Output is correct
79 Correct 186 ms 60168 KB Output is correct
80 Correct 165 ms 46536 KB Output is correct
81 Correct 122 ms 35900 KB Output is correct
82 Correct 103 ms 38472 KB Output is correct
83 Correct 86 ms 41464 KB Output is correct
84 Correct 195 ms 47920 KB Output is correct
85 Correct 175 ms 47840 KB Output is correct
86 Correct 181 ms 46524 KB Output is correct
87 Correct 211 ms 47876 KB Output is correct
88 Correct 173 ms 47944 KB Output is correct