oj.uz

답안 #931170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931170 2024-02-21T10:34:03 Z Whisper Putovanje (COCI20_putovanje) C++17
110 / 110
 95 ms 38484 KB 
#include <bits/stdc++.h>

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

#define int long long
#define Base 31
#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 = a; i >= b; i --)
#define REP(i, n) for ( int i = 0 ; i < n ; ++i )
#define REPD(i, n) for ( int i =  n - 1 ; ~(--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)

constexpr ll LINF = (1ll << 62);
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);
}
int n;
vector<T> adj[MAX];
const int Log = 20;
int up[MAX][Log], dep[MAX], f[MAX];
int  ans = 0;
//using f(i) as the number we come to the ith city with minimize cost
void dfs(int u, int p){
    for (auto&[v, _, __] : adj[u]) if(v ^ p){
        dep[v] = dep[u] + 1;
        up[v][0] = u;
        for (int i = 1 ; i < Log ; i++){
            up[v][i] = up[up[v][i - 1]][i - 1];
        }
        dfs(v, u);
    }
}
void Lca(int u, int v){
    f[u]++, f[v]++;
    if (dep[u] < dep[v]) swap(u, v);
    int dis = dep[u] - dep[v];
    for (; dis > 0; dis ^= (dis & (-dis))){
        int i = __builtin_ctz(dis & (-dis));
        u = up[u][i];
    }
    if (u == v){
        f[u] -= 2;
        return;
    }
    int k = Lg(dep[v]);
    for (int i = k ; i >= 0 ; i--){
        if (up[u][i] != up[v][i]){
            u = up[u][i];
            v = up[v][i];
        }
    }
    f[up[u][0]] -= 2;
}

void cal(int u, int p){
    for (auto&[v, c1, c2] : adj[u]) if(v ^ p){
        cal(v, u);
        f[u] += f[v];
        ans += min(f[v] * c1, c2);
    }
}
void Whisper(){
    cin >> n;
    for (int i = 1 ; i < n ; i++){
        int u, v, c1, c2; cin >> u >> v >> c1 >> c2;
        adj[u].push_back({v, c1, c2});
        adj[v].push_back({u, c1, c2});
    }

    dfs(1, 0);

    for(int i = 1 ; i < n ; i++){
        Lca(i, i + 1);
    }

    cal(1, 0);
    cout << ans;
}

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 9052 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 34224 KB Output is correct
2 Correct 78 ms 35104 KB Output is correct
3 Correct 88 ms 37716 KB Output is correct
4 Correct 95 ms 38484 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 71 ms 31756 KB Output is correct
7 Correct 52 ms 26704 KB Output is correct
8 Correct 74 ms 34132 KB Output is correct
9 Correct 54 ms 35412 KB Output is correct
10 Correct 52 ms 35104 KB Output is correct
11 Correct 61 ms 38080 KB Output is correct
12 Correct 62 ms 38192 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 9052 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 84 ms 34224 KB Output is correct
11 Correct 78 ms 35104 KB Output is correct
12 Correct 88 ms 37716 KB Output is correct
13 Correct 95 ms 38484 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 71 ms 31756 KB Output is correct
16 Correct 52 ms 26704 KB Output is correct
17 Correct 74 ms 34132 KB Output is correct
18 Correct 54 ms 35412 KB Output is correct
19 Correct 52 ms 35104 KB Output is correct
20 Correct 61 ms 38080 KB Output is correct
21 Correct 62 ms 38192 KB Output is correct
22 Correct 74 ms 31824 KB Output is correct
23 Correct 68 ms 28592 KB Output is correct
24 Correct 74 ms 31684 KB Output is correct
25 Correct 2 ms 8656 KB Output is correct
26 Correct 24 ms 18096 KB Output is correct
27 Correct 62 ms 28244 KB Output is correct
28 Correct 46 ms 31828 KB Output is correct
29 Correct 60 ms 38308 KB Output is correct
30 Correct 61 ms 37968 KB Output is correct
31 Correct 3 ms 9300 KB Output is correct