oj.uz

답안 #160702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160702 2019-10-29T11:19:27 Z gs18103 Fireworks (APIO16_fireworks) C++14
7 / 100
 23 ms 21752 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define em emplace

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int INF = 1 << 30;
const ll LINF = 1LL << 62;
const int MAX = 303030;

ll ans = 0;
struct node{
    priority_queue <ll> L;
    priority_queue <ll, vector <ll>, greater <ll> > R;
    int sz = 0;
    void merge(node &X) {
        if(X.sz == 0) return;
        sz += X.sz;
        while(!X.L.empty()) {
            ll temp = X.L.top();
            X.L.pop();
            if(temp > R.top()){
                ans += temp - R.top();
                L.em(R.top()); R.pop();
                R.em(temp);
            }
            else L.em(temp);
        }
        while(!X.R.empty()) {
            ll temp = X.R.top();
            X.R.pop();
            if(temp < L.top()){
                ans += L.top() - temp;
                R.em(L.top()); L.pop();
                L.em(temp);
            }
            else R.em(temp);
        }
    }
    void modify(ll val) {
        ll Rt = 0, Lt = 0;
        if(!R.empty()) Rt = R.top();
        if(!L.empty()) Lt = L.top();
        while(!R.empty()) R.pop(), sz--;
        R.push(Rt + val);
        L.push(Lt + val);
        sz += 2;
    }
} dp[MAX];

int p[MAX], idx[MAX];
ll c[MAX];

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    int n, m;
    cin >> n >> m;
    for(int i = 2; i <= n + m; i++) {
        cin >> p[i] >> c[i];
        idx[i] = i;
    }
    for(int i = n + m; i > 1; i--) {
        dp[idx[i]].modify(c[i]);
        if(dp[idx[p[i]]].sz < dp[idx[i]].sz) {
            dp[idx[i]].merge(dp[idx[p[i]]]);
            idx[p[i]] = idx[i];
        }
        else dp[idx[p[i]]].merge(dp[idx[i]]);
    }
    cout << ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 21624 KB Output is correct
2 Correct 22 ms 21752 KB Output is correct
3 Correct 22 ms 21752 KB Output is correct
4 Correct 21 ms 21752 KB Output is correct
5 Correct 23 ms 21696 KB Output is correct
6 Correct 21 ms 21752 KB Output is correct
7 Correct 21 ms 21752 KB Output is correct
8 Correct 21 ms 21752 KB Output is correct
9 Correct 21 ms 21752 KB Output is correct
10 Correct 21 ms 21752 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 21624 KB Output is correct
2 Correct 22 ms 21752 KB Output is correct
3 Incorrect 21 ms 21752 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 21624 KB Output is correct
2 Correct 22 ms 21752 KB Output is correct
3 Correct 22 ms 21752 KB Output is correct
4 Correct 21 ms 21752 KB Output is correct
5 Correct 23 ms 21696 KB Output is correct
6 Correct 21 ms 21752 KB Output is correct
7 Correct 21 ms 21752 KB Output is correct
8 Correct 21 ms 21752 KB Output is correct
9 Correct 21 ms 21752 KB Output is correct
10 Correct 21 ms 21752 KB Output is correct
11 Correct 21 ms 21624 KB Output is correct
12 Correct 22 ms 21752 KB Output is correct
13 Incorrect 21 ms 21752 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 21624 KB Output is correct
2 Correct 22 ms 21752 KB Output is correct
3 Correct 22 ms 21752 KB Output is correct
4 Correct 21 ms 21752 KB Output is correct
5 Correct 23 ms 21696 KB Output is correct
6 Correct 21 ms 21752 KB Output is correct
7 Correct 21 ms 21752 KB Output is correct
8 Correct 21 ms 21752 KB Output is correct
9 Correct 21 ms 21752 KB Output is correct
10 Correct 21 ms 21752 KB Output is correct
11 Correct 21 ms 21624 KB Output is correct
12 Correct 22 ms 21752 KB Output is correct
13 Incorrect 21 ms 21752 KB Output isn't correct
14 Halted 0 ms 0 KB -