oj.uz

답안 #839579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839579 2023-08-30T09:00:12 Z model_code Truck Driver (IOI23_deliveries) C++17
43 / 100
 4500 ms 381848 KB 
// time_limit/sol_vp_brute_force2.cpp

#include "deliveries.h"
#include <algorithm>
#include <vector>
#include <iostream>
#include <queue>

using namespace std;

struct node{
    int x, upd;
    long long w;
    bool operator<(const node& n) const{
        if(w != n.w) return w < n.w;
        return x < n.x;
    }
};

vector<vector<pair<int, long long>>> g;
vector<priority_queue<node>> g2;
vector<long long> weight, sz;
vector<int> up, height, cnt, upd;
vector<bool> vis;

pair<int, int> dfs0(int x, int p, int d){
    vis[x] = true;
    up[x] = p;
    pair<int, int> res = {d, x};
    for(auto [y, w] : g[x]){
        if(!vis[y]){
            res = max(res, dfs0(y, x, d+1));
        }
    }
    return res;
}

void dfs(int x, int p, int w_ = 0){
    vis[x] = true;
    weight[x] = w_;
    up[x] = p;
    sz[x] = cnt[x];
    height[x] = 0;
    for(auto [y, w] : g[x]){
        if(!vis[y]){
            dfs(y, x, w);
            sz[x] += sz[y];
            height[x] = max(height[x], height[y] + 1);
            g2[x].push(node{y, 0, sz[y]});
        }
    }
}

long long weight_sum = 0;
int C;

void update(int x, int c){
    cnt[x] += c;
    while(x != -1){
        sz[x] += c;
        weight_sum += weight[x] * c;
        
        upd[x]++;
        if(up[x] != -1){
            g2[up[x]].push(node{x, upd[x], sz[x]});
        }
        x = up[x];
    }
}

int get_c(int x, long long m){
    while(!g2[x].empty() && g2[x].top().upd != upd[g2[x].top().x]) g2[x].pop();
    return !g2[x].empty() && sz[g2[x].top().x]*2 > m ? get_c(g2[x].top().x, m) : x;
}

void print(){
    for(int i = 0; i < (int)g.size(); i++){
        cout << "i: " << i << " sz: " << sz[i] << " w: " << weight[i] << " up: " << up[i] << " cnt: " << cnt[i] << endl;
    }
}

void init(int N, std::vector<int> U, std::vector<int> V, std::vector<int> T, std::vector<int> W) {
	g.resize(N);
    g2.resize(N);
    upd.assign(N, 0);
    sz.assign(N, 0);
    up.assign(N, 0);
    height.assign(N, 0);
    weight.assign(N, 0);
    cnt = W;
    cnt[0]++;
    for(int i = 0; i < N-1; i++){
        g[U[i]].emplace_back(V[i], T[i]);
        g[V[i]].emplace_back(U[i], T[i]);
    }

    vis.assign(N, false);
    int tmp = dfs0(0, -1, 0).second;
    vis.assign(N, false);
    auto [d, s] = dfs0(tmp, -1, 0);

    for(int i = 0; i < d/2; i++) s = up[s];

    vis.assign(N, false);
    dfs(s, -1);
    C = s;

    for(int i = 0; i < N; i++){
        weight_sum += sz[i] * weight[i];
    }

    // cout << "C: " << C << endl;
    // cout << "weight sum: " << weight_sum << endl;

    return;
}

long long max_time(int S, int X) {
    if(S == 0) X++;
	update(S, X - cnt[S]);

    int c = get_c(C, sz[C]);

    // cout << "centroid: " << c << endl;
    // print();

    long long res = weight_sum;
    while(c != -1){
        res += (sz[C] - sz[c] * 2) * weight[c];
        c = up[c];
    }

    return res * 2;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7608 KB Output is correct
2 Correct 82 ms 7448 KB Output is correct
3 Correct 83 ms 7688 KB Output is correct
4 Correct 88 ms 7544 KB Output is correct
5 Correct 85 ms 7672 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 5 ms 1012 KB Output is correct
3 Correct 10 ms 2520 KB Output is correct
4 Correct 8 ms 1492 KB Output is correct
5 Correct 13 ms 2260 KB Output is correct
6 Correct 15 ms 4856 KB Output is correct
7 Correct 5 ms 2864 KB Output is correct
8 Correct 6 ms 3864 KB Output is correct
9 Correct 9 ms 5460 KB Output is correct
10 Correct 18 ms 5032 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 10 ms 5856 KB Output is correct
15 Correct 12 ms 5636 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7608 KB Output is correct
2 Correct 82 ms 7448 KB Output is correct
3 Correct 83 ms 7688 KB Output is correct
4 Correct 88 ms 7544 KB Output is correct
5 Correct 85 ms 7672 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 38 ms 6432 KB Output is correct
9 Correct 880 ms 70292 KB Output is correct
10 Correct 1035 ms 72668 KB Output is correct
11 Correct 729 ms 72852 KB Output is correct
12 Correct 626 ms 107896 KB Output is correct
13 Correct 688 ms 107876 KB Output is correct
14 Correct 613 ms 107940 KB Output is correct

Subtask #4
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7608 KB Output is correct
2 Correct 82 ms 7448 KB Output is correct
3 Correct 83 ms 7688 KB Output is correct
4 Correct 88 ms 7544 KB Output is correct
5 Correct 85 ms 7672 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 71 ms 13588 KB Output is correct
8 Execution timed out 4527 ms 381848 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7608 KB Output is correct
2 Correct 82 ms 7448 KB Output is correct
3 Correct 83 ms 7688 KB Output is correct
4 Correct 88 ms 7544 KB Output is correct
5 Correct 85 ms 7672 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 5 ms 1012 KB Output is correct
8 Correct 10 ms 2520 KB Output is correct
9 Correct 8 ms 1492 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 15 ms 4856 KB Output is correct
12 Correct 5 ms 2864 KB Output is correct
13 Correct 6 ms 3864 KB Output is correct
14 Correct 9 ms 5460 KB Output is correct
15 Correct 18 ms 5032 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 10 ms 5856 KB Output is correct
20 Correct 12 ms 5636 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 852 KB Output is correct
23 Correct 38 ms 6432 KB Output is correct
24 Correct 880 ms 70292 KB Output is correct
25 Correct 1035 ms 72668 KB Output is correct
26 Correct 729 ms 72852 KB Output is correct
27 Correct 626 ms 107896 KB Output is correct
28 Correct 688 ms 107876 KB Output is correct
29 Correct 613 ms 107940 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 71 ms 13588 KB Output is correct
32 Execution timed out 4527 ms 381848 KB Time limit exceeded
33 Halted 0 ms 0 KB -