oj.uz

답안 #959960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959960 2024-04-09T11:17:58 Z Trisanu_Das Fireworks (APIO16_fireworks) C++17
55 / 100
 2000 ms 23352 KB 
#include <bits/stdc++.h>
using namespace std;
 
using i64 = long long;
using d64 = long double;
using pi = pair<int, int>;
using pli = pair<i64, i64>;
using ti = tuple<int, int, int>;
using tli = tuple<i64, i64, i64>;
 
 
vector<pli> adj[300001];
const i64 inf = numeric_limits<i64>::max() / 3;
 
inline i64 ab(i64 x) { return x > 0 ? x : -x; }
 
class slope {
   public:
    priority_queue<i64> bp;
    i64 sac, fz;
 
    slope() {
        sac = 0;
        fz = 0;
    }
 
    void push(i64 x) {
        fz += x;
 
        if (bp.empty()) {
            bp.push(x);
            bp.push(x);
            ++sac;
            return;
        }
 
        while (bp.size() > sac + 1) bp.pop();
        auto m1 = bp.top();
        bp.pop();
        auto m2 = bp.top();
        bp.pop();
        bp.push(m1 + x);
        bp.push(m2 + x);
    }
};
 
void mer(slope* s1, slope* s2) {
    s1->fz += s2->fz;
    s1->sac += s2->sac;
    while (!s2->bp.empty()) s1->bp.push(s2->bp.top()), s2->bp.pop();
    delete s2;
}
 
slope* solve(int h, int p = -1) {
    slope* ret = new slope();
    for (auto [t, wf] : adj[h]) {
        if (t == p) continue;
        auto chslp = solve(t, h);
        chslp->push(wf);
        mer(ret, chslp);
    }
    return ret;
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M;
    cin >> N >> M;
    for (int i = 2; i <= N + M; i++) {
        i64 j, w;
        cin >> j >> w;
        adj[i].emplace_back(j, w);
        adj[j].emplace_back(i, w);
    }
    auto res = *solve(1);
    vector<i64> bp;
    while (!res.bp.empty()) bp.emplace_back(res.bp.top()), res.bp.pop();
    reverse(bp.begin(), bp.end());
    for (int i = 0; i < res.sac; i++) res.fz -= bp[i];
    cout << res.fz << '\n';
}

Compilation message

fireworks.cpp: In member function 'void slope::push(i64)':
fireworks.cpp:37:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'i64' {aka 'long long int'} [-Wsign-compare]
   37 |         while (bp.size() > sac + 1) bp.pop();
      |                ~~~~~~~~~~^~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 2 ms 7516 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7256 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7256 KB Output is correct
18 Correct 2 ms 7516 KB Output is correct
19 Correct 2 ms 7516 KB Output is correct
20 Correct 2 ms 7260 KB Output is correct
21 Correct 2 ms 7516 KB Output is correct
22 Correct 2 ms 7516 KB Output is correct
23 Correct 2 ms 7516 KB Output is correct
24 Correct 2 ms 7516 KB Output is correct
25 Correct 2 ms 7516 KB Output is correct
26 Correct 2 ms 7512 KB Output is correct
27 Correct 3 ms 7968 KB Output is correct
28 Correct 2 ms 7516 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct
30 Correct 3 ms 7516 KB Output is correct
31 Correct 3 ms 7512 KB Output is correct
32 Correct 3 ms 7516 KB Output is correct
33 Correct 4 ms 7512 KB Output is correct
34 Correct 5 ms 7608 KB Output is correct
35 Correct 8 ms 7772 KB Output is correct
36 Correct 8 ms 7768 KB Output is correct
37 Correct 8 ms 7772 KB Output is correct
38 Correct 18 ms 7968 KB Output is correct
39 Correct 9 ms 7768 KB Output is correct
40 Correct 7 ms 8796 KB Output is correct
41 Correct 5 ms 8796 KB Output is correct
42 Correct 4 ms 7776 KB Output is correct
43 Correct 168 ms 8408 KB Output is correct
44 Correct 132 ms 8260 KB Output is correct
45 Correct 132 ms 8428 KB Output is correct
46 Correct 5 ms 8024 KB Output is correct
47 Correct 6 ms 8028 KB Output is correct
48 Correct 4 ms 7768 KB Output is correct
49 Correct 4 ms 8024 KB Output is correct
50 Correct 4 ms 7840 KB Output is correct
51 Correct 4 ms 7772 KB Output is correct
52 Correct 7 ms 7916 KB Output is correct
53 Correct 6 ms 7768 KB Output is correct
54 Correct 4 ms 8028 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 2 ms 7516 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7256 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7256 KB Output is correct
18 Correct 2 ms 7516 KB Output is correct
19 Correct 2 ms 7516 KB Output is correct
20 Correct 2 ms 7260 KB Output is correct
21 Correct 2 ms 7516 KB Output is correct
22 Correct 2 ms 7516 KB Output is correct
23 Correct 2 ms 7516 KB Output is correct
24 Correct 2 ms 7516 KB Output is correct
25 Correct 2 ms 7516 KB Output is correct
26 Correct 2 ms 7512 KB Output is correct
27 Correct 3 ms 7968 KB Output is correct
28 Correct 2 ms 7516 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct
30 Correct 3 ms 7516 KB Output is correct
31 Correct 3 ms 7512 KB Output is correct
32 Correct 3 ms 7516 KB Output is correct
33 Correct 4 ms 7512 KB Output is correct
34 Correct 5 ms 7608 KB Output is correct
35 Correct 8 ms 7772 KB Output is correct
36 Correct 8 ms 7768 KB Output is correct
37 Correct 8 ms 7772 KB Output is correct
38 Correct 18 ms 7968 KB Output is correct
39 Correct 9 ms 7768 KB Output is correct
40 Correct 7 ms 8796 KB Output is correct
41 Correct 5 ms 8796 KB Output is correct
42 Correct 4 ms 7776 KB Output is correct
43 Correct 168 ms 8408 KB Output is correct
44 Correct 132 ms 8260 KB Output is correct
45 Correct 132 ms 8428 KB Output is correct
46 Correct 5 ms 8024 KB Output is correct
47 Correct 6 ms 8028 KB Output is correct
48 Correct 4 ms 7768 KB Output is correct
49 Correct 4 ms 8024 KB Output is correct
50 Correct 4 ms 7840 KB Output is correct
51 Correct 4 ms 7772 KB Output is correct
52 Correct 7 ms 7916 KB Output is correct
53 Correct 6 ms 7768 KB Output is correct
54 Correct 4 ms 8028 KB Output is correct
55 Correct 38 ms 8504 KB Output is correct
56 Correct 342 ms 11428 KB Output is correct
57 Correct 701 ms 13948 KB Output is correct
58 Correct 816 ms 16216 KB Output is correct
59 Correct 1931 ms 19116 KB Output is correct
60 Correct 1883 ms 21304 KB Output is correct
61 Execution timed out 2067 ms 23352 KB Time limit exceeded
62 Halted 0 ms 0 KB -