제출 #1251478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251478		CodeLakVN	Putovanje (COCI20_putovanje)	C++20	110 / 110	101 ms	24388 KiB

putovanje

#include <bits/stdc++.h>
using namespace std;

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = (int)2e5 + 5;

int numNode;

struct EDGE {
    int u, v, singleCost, multiCost;
} edges[MAX_N];

vector<ii> adj[MAX_N];

int high[MAX_N], par[20][MAX_N];

void dfs(int u) {
    for (ii e : adj[u]) {
        int v = e.F;
        if (v == par[0][u]) continue;
        par[0][v] = u;
        high[v] = high[u] + 1;
        dfs(v);
    }
}

void setup() {
    dfs(1);
    FOR(i, 1, 18) FOR(u, 1, numNode)
        par[i][u] = par[i - 1][par[i - 1][u]];
    high[0] = -1;
}

int lca(int u, int v) {
    if (high[u] < high[v]) swap(u, v);
    FOD(i, 18, 0) if (high[par[i][u]] >= high[v])
        u = par[i][u];
    if (u == v) return u;
    FOD(i, 18, 0) if (par[i][u] != par[i][v]) {
        u = par[i][u];
        v = par[i][v];
    }
    return par[0][u];
}

int cnt[MAX_N], sum[MAX_N];

void calc(int u, int p) {
    for (ii e : adj[u]) {
        int v = e.F;
        if (v == p) continue;
        calc(v, u);
        cnt[e.S] = sum[v];
        sum[u] += sum[v];
    }
}

void solve() {
    cin >> numNode;
    FOR(i, 1, numNode - 1) {
        int u, v, c1, c2;
        cin >> u >> v >> c1 >> c2;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
        edges[i] = {u, v, c1, c2};
    }

    setup();

    FOR(i, 1, numNode - 1) {
        int p = lca(i, i + 1);
        sum[p] -= 2, sum[i]++, sum[i + 1]++;
    }

    calc(1, -1);

    long long ans = 0;
    FOR(i, 1, numNode - 1) ans += min(1LL * edges[i].multiCost, 1LL * edges[i].singleCost * cnt[i]);

    cout << ans << "\n";
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

컴파일 시 표준 에러 (stderr) 메시지

putovanje.cpp: In function 'int32_t main()':
putovanje.cpp:111:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
putovanje.cpp:112:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 25 / 25
• Subtask 3: 65 / 65