oj.uz

답안 #1001320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001320 2024-06-18T19:02:37 Z shenfe1 Fireworks (APIO16_fireworks) C++17
0 / 100
 2000 ms 32604 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 4e5 + 30, MOD = 1e9 + 7;
#define int ll
int n,m;
vector<pair<int,int>> g[N];
multiset<ll> st[N];
ll h[N],l[N],r[N];
int mx[N];
void merge(int v,int to){
		if(v==to)return;
    mx[v]++;
    if((int)st[v].size() < (int)st[to].size()){
        swap(st[v],st[to]);
    }
    for(int j:st[to]){
        st[v].insert(j);
    }
}
ll dist(int to,ll x){
    if(x >= r[to]){
        return h[to] + x - r[to];
    }
    if(x >= l[to]) return h[to];
    st[to].erase(st[to].find(r[to]));
    ll ret = h[to],f = h[to] + l[to] - x;
    for(ll j:st[to]){
        if(j >= x && j <= l[to]){
            ll val = (j - x);
            ret += val;
        }
    }
    st[to].insert(r[to]);
    return ret;
}
void dfs(int v,int W = 0){
    if(g[v].empty()){
        st[v].insert(W);
        st[v].insert(W);
        mx[v] = 1;
        h[v] = 0;
        l[v] = r[v] = W;
        return;
    }
    for(auto [to,w]:g[v]){
        dfs(to,w);
        merge(v,to);
    }
    while(mx[v] > 1){
        mx[v]--;
        st[v].erase(st[v].find(*st[v].rbegin()));
    }
    {
        ll x = (*st[v].rbegin());
        st[v].erase(st[v].find(*st[v].rbegin()));
        ll y = (*st[v].rbegin());
        st[v].erase(st[v].find(*st[v].rbegin()));
        st[v].insert(x + W);
        st[v].insert(y + W);
    }
    r[v] = (*st[v].rbegin());
    l[v] = (*(++(st[v].rbegin())));
    for(auto [to,w]:g[v]){
        h[v] += dist(to,r[v] - W);
    }
}
void test(){
    cin >> n >> m;
    for(int i = 2;i <= n + m;i++){
        int a,b;
        cin >> a >> b;
        g[a].push_back({i,b});
    }
    dfs(1);
    cout << h[1] << '\n';
}
signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Compilation message

fireworks.cpp: In function 'll dist(ll, ll)':
fireworks.cpp:30:20: warning: unused variable 'f' [-Wunused-variable]
   30 |     ll ret = h[to],f = h[to] + l[to] - x;
      |                    ^

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 32604 KB Output is correct
2 Execution timed out 2007 ms 32604 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 30556 KB Output is correct
2 Execution timed out 2084 ms 30556 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 32604 KB Output is correct
2 Execution timed out 2007 ms 32604 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 32604 KB Output is correct
2 Execution timed out 2007 ms 32604 KB Time limit exceeded
3 Halted 0 ms 0 KB -