oj.uz

답안 #479803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479803 2021-10-13T07:32:30 Z wiwiho Fireworks (APIO16_fireworks) C++14
100 / 100
 685 ms 147628 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;
const ll LLMAX = 1LL << 60;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int n, m;
vector<vector<int>> g;
vector<int> c;
vector<multiset<ll>> dp;

void add(multiset<ll>& pq, ll t, int cnt){
    ll lst = LLMAX;
    while(cnt--){
        lst = *pq.rbegin();
        pq.erase(prev(pq.end()));
    }
    ll tmp = *pq.rbegin();
    pq.erase(prev(pq.end()));
    pq.insert(tmp + t);
    pq.insert(lst + t);
//    cerr << "add " << lst << " " << tmp << " " << t << "\n";
//    printv(pq, cerr);
}

void add(multiset<ll>& a, multiset<ll>& b){
    if(a.size() < b.size()) a.swap(b);
    for(ll i : b) a.insert(i);
}

void dfs(int now){
    dp[now].insert(0);
    dp[now].insert(0);
    int cnt = 0;
    for(int i : g[now]){
        dfs(i);
        cnt++;
        add(dp[now], dp[i]);
    }
    if(now > 1) add(dp[now], c[now], max(1, cnt));
//    cerr << "dfs " << now << "  ";
//    printv(dp[now], cerr);
}

int main(){
    StarBurstStream

    cin >> n >> m;
    n += m;
    g.resize(n + 1);
    c.resize(n + 1);
    dp.resize(n + 1);
    ll sum = 0;
    for(int i = 2; i <= n; i++){
        int p;
        cin >> p >> c[i];
        g[p].eb(i);
        sum += c[i];
    }

    dfs(1);

    ll slope = max((int)g[1].size(), 1);
    slope -= dp[1].size();
    ll now = sum;
    ll lst = 0;
    ll ans = LLMAX;
    for(ll i : dp[1]){
//        cerr << "test " << i << " " << lst << " " << slope << "\n";
        now += slope * (i - lst);
        slope++;
        lst = i;
        ans = min(ans, now);
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 3 ms 972 KB Output is correct
33 Correct 4 ms 1228 KB Output is correct
34 Correct 5 ms 1564 KB Output is correct
35 Correct 6 ms 1692 KB Output is correct
36 Correct 7 ms 2048 KB Output is correct
37 Correct 8 ms 2368 KB Output is correct
38 Correct 8 ms 2384 KB Output is correct
39 Correct 8 ms 2508 KB Output is correct
40 Correct 6 ms 2248 KB Output is correct
41 Correct 7 ms 2252 KB Output is correct
42 Correct 7 ms 2252 KB Output is correct
43 Correct 5 ms 1868 KB Output is correct
44 Correct 6 ms 1868 KB Output is correct
45 Correct 6 ms 1868 KB Output is correct
46 Correct 5 ms 1716 KB Output is correct
47 Correct 5 ms 1612 KB Output is correct
48 Correct 5 ms 1484 KB Output is correct
49 Correct 6 ms 1612 KB Output is correct
50 Correct 4 ms 1356 KB Output is correct
51 Correct 5 ms 1356 KB Output is correct
52 Correct 5 ms 1484 KB Output is correct
53 Correct 5 ms 1484 KB Output is correct
54 Correct 5 ms 1612 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 3 ms 972 KB Output is correct
33 Correct 4 ms 1228 KB Output is correct
34 Correct 5 ms 1564 KB Output is correct
35 Correct 6 ms 1692 KB Output is correct
36 Correct 7 ms 2048 KB Output is correct
37 Correct 8 ms 2368 KB Output is correct
38 Correct 8 ms 2384 KB Output is correct
39 Correct 8 ms 2508 KB Output is correct
40 Correct 6 ms 2248 KB Output is correct
41 Correct 7 ms 2252 KB Output is correct
42 Correct 7 ms 2252 KB Output is correct
43 Correct 5 ms 1868 KB Output is correct
44 Correct 6 ms 1868 KB Output is correct
45 Correct 6 ms 1868 KB Output is correct
46 Correct 5 ms 1716 KB Output is correct
47 Correct 5 ms 1612 KB Output is correct
48 Correct 5 ms 1484 KB Output is correct
49 Correct 6 ms 1612 KB Output is correct
50 Correct 4 ms 1356 KB Output is correct
51 Correct 5 ms 1356 KB Output is correct
52 Correct 5 ms 1484 KB Output is correct
53 Correct 5 ms 1484 KB Output is correct
54 Correct 5 ms 1612 KB Output is correct
55 Correct 20 ms 6168 KB Output is correct
56 Correct 99 ms 24292 KB Output is correct
57 Correct 179 ms 43076 KB Output is correct
58 Correct 240 ms 56040 KB Output is correct
59 Correct 321 ms 73880 KB Output is correct
60 Correct 404 ms 93672 KB Output is correct
61 Correct 469 ms 106708 KB Output is correct
62 Correct 531 ms 119420 KB Output is correct
63 Correct 685 ms 147120 KB Output is correct
64 Correct 672 ms 147628 KB Output is correct
65 Correct 478 ms 121588 KB Output is correct
66 Correct 545 ms 121356 KB Output is correct
67 Correct 432 ms 121284 KB Output is correct
68 Correct 431 ms 95428 KB Output is correct
69 Correct 441 ms 95172 KB Output is correct
70 Correct 429 ms 95164 KB Output is correct
71 Correct 385 ms 98756 KB Output is correct
72 Correct 391 ms 98116 KB Output is correct
73 Correct 488 ms 84412 KB Output is correct
74 Correct 479 ms 84676 KB Output is correct
75 Correct 489 ms 83680 KB Output is correct
76 Correct 471 ms 83888 KB Output is correct
77 Correct 463 ms 82116 KB Output is correct
78 Correct 475 ms 79044 KB Output is correct
79 Correct 496 ms 83644 KB Output is correct