oj.uz

답안 #897472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897472 2024-01-03T07:16:05 Z Alora Putovanje (COCI20_putovanje) C++17
110 / 110
 80 ms 27852 KB 
#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 200005
const int M = 1e9 + 7;
using namespace std;
int n, cnt[maxn], times[maxn], h[maxn], cha[maxn][20];
vector <pii> g[maxn];
pii c[maxn];

void dfs(int u, int fa){
    for(auto [v, id]: g[u]) if(v != fa){
        h[v] = h[u] + 1;
        cha[v][0] = u;
        fi(i, 1, 18) cha[v][i] = cha[cha[v][i - 1]][i - 1];
        dfs(v, u);
    }
}
int lca(int x, int y){
    if(h[x] < h[y]) swap(x, y);
    int d = h[x] - h[y];
    fi(i, 0, 18) if(getbit(d, i)) x = cha[x][i];
    if(x == y) return x;
    fid(i, 18, 0) if(cha[x][i] != cha[y][i]){
        x = cha[x][i];
        y = cha[y][i];
    }
    return cha[x][0];
}
void dfs_cal(int u, int fa){
    for(auto [v, id]: g[u]) if(v != fa){
        dfs_cal(v, u);
        times[id] = cnt[v];
        cnt[u] += cnt[v];
    }
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	if(fopen(Alora".inp", "r")){
    freopen(Alora".inp", "r", stdin);
    freopen(Alora".out", "w", stdout);}
    cin >> n;
    fi(i, 1, n - 1){
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        c[i] = {a, b};
        g[u].pb({v, i});
        g[v].pb({u, i});
    }
    dfs(1, 1);
    fi(u, 1, n - 1){
        int v = u + 1;
        int z = lca(u, v);
        cnt[u]++; cnt[v]++;
        cnt[z] -= 2;
    }
    dfs_cal(1, 1);
    ll res = 0;
    fi(i, 1, n - 1) res += min(1ll*times[i]*c[i].f, 1ll*c[i].se);
    cout << res;
    return 0;
}

Compilation message

putovanje.cpp: In function 'int main()':
putovanje.cpp:49:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     freopen(Alora".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
putovanje.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     freopen(Alora".out", "w", stdout);}
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 24916 KB Output is correct
2 Correct 80 ms 26152 KB Output is correct
3 Correct 66 ms 27852 KB Output is correct
4 Correct 75 ms 26960 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 60 ms 24656 KB Output is correct
7 Correct 47 ms 20304 KB Output is correct
8 Correct 80 ms 24560 KB Output is correct
9 Correct 50 ms 24720 KB Output is correct
10 Correct 47 ms 24540 KB Output is correct
11 Correct 51 ms 25424 KB Output is correct
12 Correct 52 ms 25692 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 3 ms 8680 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 3 ms 8740 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 66 ms 24916 KB Output is correct
11 Correct 80 ms 26152 KB Output is correct
12 Correct 66 ms 27852 KB Output is correct
13 Correct 75 ms 26960 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 60 ms 24656 KB Output is correct
16 Correct 47 ms 20304 KB Output is correct
17 Correct 80 ms 24560 KB Output is correct
18 Correct 50 ms 24720 KB Output is correct
19 Correct 47 ms 24540 KB Output is correct
20 Correct 51 ms 25424 KB Output is correct
21 Correct 52 ms 25692 KB Output is correct
22 Correct 72 ms 21732 KB Output is correct
23 Correct 47 ms 20820 KB Output is correct
24 Correct 64 ms 21404 KB Output is correct
25 Correct 2 ms 8536 KB Output is correct
26 Correct 26 ms 13684 KB Output is correct
27 Correct 45 ms 20616 KB Output is correct
28 Correct 42 ms 23360 KB Output is correct
29 Correct 54 ms 25684 KB Output is correct
30 Correct 55 ms 25188 KB Output is correct
31 Correct 3 ms 8796 KB Output is correct