oj.uz

답안 #386072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386072 2021-04-05T14:51:57 Z georgerapeanu Fireworks (APIO16_fireworks) C++11
100 / 100
 429 ms 115436 KB 
#include <bits/stdc++.h>

using namespace std;

struct vodoo_list_t{
    map<long long,int> slopes;
    long long a,b;

    vodoo_list_t(){
        slopes = map<long long,int>();
        a = 0;
        b = 0;
    }

    vodoo_list_t(int length){
        slopes = map<long long,int>();
        a = 1;
        b = -length;
        slopes[0] = -1;
        slopes[length] = 2;
    }

    void merge(vodoo_list_t &other){
        for(auto it:other.slopes){
            slopes[it.first] += it.second;
        }
        this->a += other.a;
        this->b += other.b;
    }

    void add_length(int length){
        while(a > 1){
            a--;
            b += slopes.rbegin()->first;
            slopes.rbegin()->second--;
            while(slopes.rbegin()->second == 0){
                slopes.erase(slopes.rbegin()->first);
            }
        }

        map<long long,int> :: iterator it = slopes.end();
        vector<long long> points;

        for(int k = 2;k > 0;k--){
            slopes.rbegin()->second--;
            points.push_back(slopes.rbegin()->first + length);
            while(slopes.rbegin()->second == 0){
                slopes.erase(slopes.rbegin()->first);
            }
        }

        for(auto it:points){
            slopes[it]++;
        }

        b -= 1LL * a * length;
    }

    long long get_min(){
        long long ans = 1e18;

        map<long long,int> :: iterator it = slopes.end();
        while(true){
            if(it == slopes.begin()){
                break;
            }
            it = prev(it);
            ans = min(ans,a * it->first + b);
            a -= it->second;
            b += it->second * it->first;
        }

        return ans;
    }

    int size(){
        return slopes.size();
    }

    void _swap(vodoo_list_t &other){
        swap(this->slopes,other.slopes);
        swap(this->a,other.a);
        swap(this->b,other.b);
    }
};

const int NMAX = 3e5;

int n,m;
vector<pair<int,int>> sons[NMAX + 5];
vodoo_list_t stuff[NMAX + 5];

void dfs(int nod,int tata,int edge){
    if(sons[nod].empty()){
        stuff[nod] = vodoo_list_t(edge);
        return ;
    }
    int bigChild = -1;
    for(auto it:sons[nod]){
        dfs(it.first,nod,it.second);
        if(bigChild == -1 || stuff[bigChild].size() < stuff[it.first].size()){
            bigChild = it.first;
        }
    }
    stuff[nod]._swap(stuff[bigChild]);
    for(auto it:sons[nod]){
        if(it.first == bigChild){
            continue;
        }
        stuff[nod].merge(stuff[it.first]);
    }
    if(tata != 0){
        stuff[nod].add_length(edge);
    }
}

int main(){
    scanf("%d %d",&n,&m);

    n += m;

    for(int i = 2;i <= n;i++){
        int p,c;
        scanf("%d %d",&p,&c);
        sons[p].push_back({i,c});
    }

    dfs(1,0,0);

    printf("%lld\n",stuff[1].get_min());

    return 0;
}

Compilation message

fireworks.cpp: In member function 'void vodoo_list_t::add_length(int)':
fireworks.cpp:41:40: warning: variable 'it' set but not used [-Wunused-but-set-variable]
   41 |         map<long long,int> :: iterator it = slopes.end();
      |                                        ^~
fireworks.cpp: In function 'int main()':
fireworks.cpp:118:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  118 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
fireworks.cpp:124:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |         scanf("%d %d",&p,&c);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 26092 KB Output is correct
2 Correct 24 ms 26092 KB Output is correct
3 Correct 20 ms 26220 KB Output is correct
4 Correct 20 ms 26220 KB Output is correct
5 Correct 20 ms 26220 KB Output is correct
6 Correct 20 ms 26220 KB Output is correct
7 Correct 20 ms 26220 KB Output is correct
8 Correct 20 ms 26220 KB Output is correct
9 Correct 20 ms 26220 KB Output is correct
10 Correct 20 ms 26220 KB Output is correct
11 Correct 20 ms 26092 KB Output is correct
12 Correct 20 ms 26092 KB Output is correct
13 Correct 20 ms 26092 KB Output is correct
14 Correct 21 ms 26220 KB Output is correct
15 Correct 21 ms 26220 KB Output is correct
16 Correct 20 ms 26220 KB Output is correct
17 Correct 20 ms 26220 KB Output is correct
18 Correct 20 ms 26220 KB Output is correct
19 Correct 21 ms 26220 KB Output is correct
20 Correct 20 ms 26220 KB Output is correct
21 Correct 20 ms 26220 KB Output is correct
22 Correct 20 ms 26220 KB Output is correct
23 Correct 20 ms 26220 KB Output is correct
24 Correct 22 ms 26348 KB Output is correct
25 Correct 20 ms 26220 KB Output is correct
26 Correct 20 ms 26220 KB Output is correct
27 Correct 20 ms 26220 KB Output is correct
28 Correct 21 ms 26220 KB Output is correct
29 Correct 20 ms 26220 KB Output is correct
30 Correct 21 ms 26220 KB Output is correct
31 Correct 21 ms 26348 KB Output is correct
32 Correct 22 ms 26348 KB Output is correct
33 Correct 23 ms 26496 KB Output is correct
34 Correct 23 ms 26476 KB Output is correct
35 Correct 23 ms 26604 KB Output is correct
36 Correct 23 ms 26604 KB Output is correct
37 Correct 24 ms 26732 KB Output is correct
38 Correct 25 ms 26732 KB Output is correct
39 Correct 24 ms 26732 KB Output is correct
40 Correct 23 ms 27628 KB Output is correct
41 Correct 24 ms 27628 KB Output is correct
42 Correct 23 ms 26348 KB Output is correct
43 Correct 24 ms 27244 KB Output is correct
44 Correct 25 ms 27116 KB Output is correct
45 Correct 26 ms 27116 KB Output is correct
46 Correct 24 ms 27116 KB Output is correct
47 Correct 24 ms 27116 KB Output is correct
48 Correct 23 ms 26988 KB Output is correct
49 Correct 24 ms 27116 KB Output is correct
50 Correct 23 ms 26860 KB Output is correct
51 Correct 23 ms 26860 KB Output is correct
52 Correct 24 ms 26988 KB Output is correct
53 Correct 24 ms 26988 KB Output is correct
54 Correct 25 ms 27116 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 26092 KB Output is correct
2 Correct 24 ms 26092 KB Output is correct
3 Correct 20 ms 26220 KB Output is correct
4 Correct 20 ms 26220 KB Output is correct
5 Correct 20 ms 26220 KB Output is correct
6 Correct 20 ms 26220 KB Output is correct
7 Correct 20 ms 26220 KB Output is correct
8 Correct 20 ms 26220 KB Output is correct
9 Correct 20 ms 26220 KB Output is correct
10 Correct 20 ms 26220 KB Output is correct
11 Correct 20 ms 26092 KB Output is correct
12 Correct 20 ms 26092 KB Output is correct
13 Correct 20 ms 26092 KB Output is correct
14 Correct 21 ms 26220 KB Output is correct
15 Correct 21 ms 26220 KB Output is correct
16 Correct 20 ms 26220 KB Output is correct
17 Correct 20 ms 26220 KB Output is correct
18 Correct 20 ms 26220 KB Output is correct
19 Correct 21 ms 26220 KB Output is correct
20 Correct 20 ms 26220 KB Output is correct
21 Correct 20 ms 26220 KB Output is correct
22 Correct 20 ms 26220 KB Output is correct
23 Correct 20 ms 26220 KB Output is correct
24 Correct 22 ms 26348 KB Output is correct
25 Correct 20 ms 26220 KB Output is correct
26 Correct 20 ms 26220 KB Output is correct
27 Correct 20 ms 26220 KB Output is correct
28 Correct 21 ms 26220 KB Output is correct
29 Correct 20 ms 26220 KB Output is correct
30 Correct 21 ms 26220 KB Output is correct
31 Correct 21 ms 26348 KB Output is correct
32 Correct 22 ms 26348 KB Output is correct
33 Correct 23 ms 26496 KB Output is correct
34 Correct 23 ms 26476 KB Output is correct
35 Correct 23 ms 26604 KB Output is correct
36 Correct 23 ms 26604 KB Output is correct
37 Correct 24 ms 26732 KB Output is correct
38 Correct 25 ms 26732 KB Output is correct
39 Correct 24 ms 26732 KB Output is correct
40 Correct 23 ms 27628 KB Output is correct
41 Correct 24 ms 27628 KB Output is correct
42 Correct 23 ms 26348 KB Output is correct
43 Correct 24 ms 27244 KB Output is correct
44 Correct 25 ms 27116 KB Output is correct
45 Correct 26 ms 27116 KB Output is correct
46 Correct 24 ms 27116 KB Output is correct
47 Correct 24 ms 27116 KB Output is correct
48 Correct 23 ms 26988 KB Output is correct
49 Correct 24 ms 27116 KB Output is correct
50 Correct 23 ms 26860 KB Output is correct
51 Correct 23 ms 26860 KB Output is correct
52 Correct 24 ms 26988 KB Output is correct
53 Correct 24 ms 26988 KB Output is correct
54 Correct 25 ms 27116 KB Output is correct
55 Correct 32 ms 27756 KB Output is correct
56 Correct 75 ms 32364 KB Output is correct
57 Correct 118 ms 37100 KB Output is correct
58 Correct 145 ms 40428 KB Output is correct
59 Correct 191 ms 45036 KB Output is correct
60 Correct 242 ms 49772 KB Output is correct
61 Correct 278 ms 53248 KB Output is correct
62 Correct 313 ms 56388 KB Output is correct
63 Correct 364 ms 62700 KB Output is correct
64 Correct 382 ms 63340 KB Output is correct
65 Correct 220 ms 115436 KB Output is correct
66 Correct 216 ms 115436 KB Output is correct
67 Correct 207 ms 35948 KB Output is correct
68 Correct 335 ms 94188 KB Output is correct
69 Correct 381 ms 88940 KB Output is correct
70 Correct 427 ms 89112 KB Output is correct
71 Correct 351 ms 94188 KB Output is correct
72 Correct 363 ms 94060 KB Output is correct
73 Correct 355 ms 85484 KB Output is correct
74 Correct 357 ms 85612 KB Output is correct
75 Correct 334 ms 84972 KB Output is correct
76 Correct 358 ms 85100 KB Output is correct
77 Correct 351 ms 82920 KB Output is correct
78 Correct 378 ms 81124 KB Output is correct
79 Correct 429 ms 84820 KB Output is correct