oj.uz

답안 #109848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109848 2019-05-08T07:20:35 Z Alexa2001 Fireworks (APIO16_fireworks) C++17
7 / 100
 16 ms 14592 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int Nmax = 6e5 + 5;
const ll inf = 1e18;

vector<int> v[Nmax];
ll opt[Nmax], A[Nmax], B[Nmax];
int up[Nmax];
int n, m;


ll moove(ll x, ll l, ll r)
{
    if(x < l) return l - x;
    if(x > r) return x - r;
    return 0;
}

void dfs(int node)
{
    if(v[node].empty())
    {
        opt[node] = 0;
        A[node] = up[node];
        B[node] = up[node];
        return;
    }

    for(auto son : v[node]) dfs(son);

    map<ll,int> change;

    for(auto son : v[node])
    {
        change[0] -= 1;
        change[A[son]] += 1;
        change[B[son]] += 1;
    }

    int sum = 0, L = -1, R = -1;

    for(auto &it : change)
    {
        sum += it.second;
        it.second = sum;

        if(it.second >= 0 && L == -1) L = it.first;
        if(it.second > 0 && R == -1) R = it.first;
    }

    A[node] = L;
    B[node] = R;

    for(auto son : v[node])
        opt[node] += opt[son] + moove(L, A[son], B[son]);

    A[node] += up[node];
    B[node] += up[node];
}

int main()
{
  //  freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

    int i, x;

    cin >> n >> m; n += m;

    for(i=2; i<=n; ++i)
    {
        cin >> x >> up[i];
        v[x].push_back(i);
    }

    dfs(1);
    cout << opt[1] << '\n';

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 14 ms 14592 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 15 ms 14464 KB Output is correct
9 Correct 15 ms 14464 KB Output is correct
10 Correct 15 ms 14464 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 14464 KB Output is correct
2 Correct 15 ms 14464 KB Output is correct
3 Incorrect 14 ms 14464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 14 ms 14592 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 15 ms 14464 KB Output is correct
9 Correct 15 ms 14464 KB Output is correct
10 Correct 15 ms 14464 KB Output is correct
11 Correct 16 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Incorrect 14 ms 14464 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 14 ms 14592 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 15 ms 14464 KB Output is correct
9 Correct 15 ms 14464 KB Output is correct
10 Correct 15 ms 14464 KB Output is correct
11 Correct 16 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Incorrect 14 ms 14464 KB Output isn't correct
14 Halted 0 ms 0 KB -