oj.uz

답안 #924044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924044 2024-02-08T10:20:11 Z Whisper Janjetina (COCI21_janjetina) C++17
110 / 110
 556 ms 60420 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int numNode, K;
vector<pii> adj[MAX];
int sz[MAX], del[MAX];

void reSubsize(int u, int p){
    sz[u] = 1;
    for (auto&[v, w] : adj[u]) if(v ^ p){
        if (!del[v]){
            reSubsize(v, u); sz[u] += sz[v];
        }
    }
}
int getCentroid(int u, int p, int siz){
    for (auto&[v, w] : adj[u]) if(v ^ p){
        if (sz[v] * 2 > siz && !del[v]) return getCentroid(v, u, siz);
    }
    return u;
}

//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

struct FenwickTree{
    int n = 2 * MAX - 5;
    int f[2 * MAX]{0};
    vector<int> opt;
    void modify(int p, int val){
        if (val > 0) opt.push_back(p);
        for (; p <= n; p += p & (-p)) f[p] += val;
    }
    int query(int p){
        int res = 0;
        for ( ; p > 0; p -= p & (-p)) res += f[p];
        return res;
    }
    void clear(){
        while (opt.size()){
            int p = opt.back(); opt.pop_back();
            modify(p, -1);
        }
    }
} fen;

int ans = 0;
vector<pii> subtree;

void dfs(int u, int p, int mxValue, int dep){
    if (dep > 0)
        subtree.emplace_back(mxValue, dep);
    for (auto&[v, w] : adj[u]) if(v ^ p){
        if (del[v]) continue;
        int nxt = max(mxValue, w);
        dfs(v, u, nxt, dep + 1);
    }
}

void compute(int val, int ok){
    sort(all(subtree));

    for (auto&[w, l] : subtree){
        int needL = w - K - l;
        if (w - l >= K) ans += ok;
        ans += fen.query(needL) * val;
        fen.modify(l, 1);
    }
    for (auto&[w, l] : subtree){
        fen.modify(l, -1);
    }
    subtree.clear();
}
void decompose(int root){
    reSubsize(root, -1);
    int siz = sz[root];
    root = getCentroid(root, -1, siz);
    dfs(root, -1, 0, 0);
    compute(1, 1);
    for (auto&[v, w] : adj[root]) if(!del[v]){
        dfs(v, root, w, 1);
        compute(-1, 0);
    }
    del[root] = 1;
    for (auto&[v, w] : adj[root]) if (!del[v]){
        decompose(v);
    }
}
//count the number from (x -> y) that the difference of the max weight and the length of the path >= K
void Whisper(){
    cin >> numNode >> K;
    for (int i = 1; i < numNode; ++i){
        int u, v, w; cin >> u >> v >> w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }
    decompose(1);
    cout << ans * 2;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 3 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 5 ms 11828 KB Output is correct
5 Correct 5 ms 11612 KB Output is correct
6 Correct 5 ms 11612 KB Output is correct
7 Correct 5 ms 11696 KB Output is correct
8 Correct 5 ms 11612 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11428 KB Output is correct
11 Correct 3 ms 11540 KB Output is correct
12 Correct 4 ms 11612 KB Output is correct
13 Correct 4 ms 11688 KB Output is correct
14 Correct 4 ms 11612 KB Output is correct
15 Correct 4 ms 11612 KB Output is correct
16 Correct 4 ms 11608 KB Output is correct
17 Correct 4 ms 11612 KB Output is correct
18 Correct 4 ms 11608 KB Output is correct
19 Correct 4 ms 11612 KB Output is correct
20 Correct 4 ms 11612 KB Output is correct
21 Correct 4 ms 11612 KB Output is correct
22 Correct 4 ms 11612 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 4 ms 11612 KB Output is correct
5 Correct 33 ms 14752 KB Output is correct
6 Correct 222 ms 35724 KB Output is correct
7 Correct 356 ms 59800 KB Output is correct
8 Correct 513 ms 60420 KB Output is correct
9 Correct 361 ms 58688 KB Output is correct
10 Correct 499 ms 60380 KB Output is correct
11 Correct 353 ms 59684 KB Output is correct
12 Correct 496 ms 59944 KB Output is correct
13 Correct 373 ms 58888 KB Output is correct
14 Correct 479 ms 58916 KB Output is correct
15 Correct 538 ms 60372 KB Output is correct
16 Correct 500 ms 58920 KB Output is correct
17 Correct 515 ms 59592 KB Output is correct
18 Correct 507 ms 58948 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 3 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 5 ms 11828 KB Output is correct
5 Correct 5 ms 11612 KB Output is correct
6 Correct 5 ms 11612 KB Output is correct
7 Correct 5 ms 11696 KB Output is correct
8 Correct 5 ms 11612 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11428 KB Output is correct
11 Correct 3 ms 11540 KB Output is correct
12 Correct 4 ms 11612 KB Output is correct
13 Correct 4 ms 11688 KB Output is correct
14 Correct 4 ms 11612 KB Output is correct
15 Correct 4 ms 11612 KB Output is correct
16 Correct 4 ms 11608 KB Output is correct
17 Correct 4 ms 11612 KB Output is correct
18 Correct 4 ms 11608 KB Output is correct
19 Correct 4 ms 11612 KB Output is correct
20 Correct 4 ms 11612 KB Output is correct
21 Correct 4 ms 11612 KB Output is correct
22 Correct 4 ms 11612 KB Output is correct
23 Correct 2 ms 11356 KB Output is correct
24 Correct 2 ms 11356 KB Output is correct
25 Correct 2 ms 11356 KB Output is correct
26 Correct 4 ms 11612 KB Output is correct
27 Correct 33 ms 14752 KB Output is correct
28 Correct 222 ms 35724 KB Output is correct
29 Correct 356 ms 59800 KB Output is correct
30 Correct 513 ms 60420 KB Output is correct
31 Correct 361 ms 58688 KB Output is correct
32 Correct 499 ms 60380 KB Output is correct
33 Correct 353 ms 59684 KB Output is correct
34 Correct 496 ms 59944 KB Output is correct
35 Correct 373 ms 58888 KB Output is correct
36 Correct 479 ms 58916 KB Output is correct
37 Correct 538 ms 60372 KB Output is correct
38 Correct 500 ms 58920 KB Output is correct
39 Correct 515 ms 59592 KB Output is correct
40 Correct 507 ms 58948 KB Output is correct
41 Correct 2 ms 11356 KB Output is correct
42 Correct 361 ms 58860 KB Output is correct
43 Correct 494 ms 58684 KB Output is correct
44 Correct 366 ms 60224 KB Output is correct
45 Correct 505 ms 59048 KB Output is correct
46 Correct 361 ms 58916 KB Output is correct
47 Correct 556 ms 59328 KB Output is correct
48 Correct 373 ms 59416 KB Output is correct
49 Correct 470 ms 59192 KB Output is correct
50 Correct 531 ms 59940 KB Output is correct
51 Correct 505 ms 58676 KB Output is correct
52 Correct 140 ms 28184 KB Output is correct
53 Correct 180 ms 29544 KB Output is correct
54 Correct 131 ms 28260 KB Output is correct
55 Correct 183 ms 29540 KB Output is correct
56 Correct 185 ms 29600 KB Output is correct
57 Correct 348 ms 37936 KB Output is correct
58 Correct 435 ms 37952 KB Output is correct
59 Correct 420 ms 38000 KB Output is correct
60 Correct 432 ms 38204 KB Output is correct
61 Correct 435 ms 37940 KB Output is correct
62 Correct 284 ms 37340 KB Output is correct
63 Correct 369 ms 37572 KB Output is correct
64 Correct 394 ms 36656 KB Output is correct
65 Correct 16 ms 12572 KB Output is correct
66 Correct 2 ms 11356 KB Output is correct