oj.uz

답안 #331721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331721 2020-11-29T18:13:00 Z VROOM_VARUN Putovanje (COCI20_putovanje) C++14
110 / 110
 237 ms 40272 KB 
/*
ID: varunra2
LANG: C++
TASK: putovanje
*/

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

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define int long long

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int n;
VVI adj;

struct lca {
  VVI bin;
  const int bits = 20;
  VI tin, tout;
  int timer = 0;

  void dfs(int u, int v) {
    tin[u] = timer++;
    bin[u][0] = v;
    for (int i = 1; i < bits; i++) {
      int to = bin[u][i - 1];
      if (to != -1)
        bin[u][i] = bin[to][i - 1];
      else
        bin[u][i] = -1;
    }
    for (auto& x : adj[u]) {
      if (x == v) continue;
      dfs(x, u);
    }
    tout[u] = timer++;
  }

  void init() {
    bin.resize(n);
    trav(x, bin) x.resize(bits);
    tin.resize(n);
    tout.resize(n);
    dfs(0, -1);
  }

  bool isAnc(int u, int v) {
    if (u == -1) return true;
    if (v == -1) return false;
    return tin[u] <= tin[v] and tout[u] >= tout[v];
  }

  int getLCA(int u, int v) {
    if (isAnc(u, v)) return u;
    if (isAnc(v, u)) return v;
    for (int i = bits - 1; i >= 0; i--) {
      if (!isAnc(bin[u][i], v)) u = bin[u][i];
    }
    return bin[u][0];
  }

  bool isPar(int u, int v) {
    if (bin[u][0] == v) return true;
    return false;
  }

} lc;

VI pref;
VVI edgs;

void init() {
  pref.resize(n);
  adj.resize(n);
  edgs.resize(n - 1);
  trav(x, edgs) x.resize(4);
}

void dfspref(int u, int v) {
  for (auto& x : adj[u]) {
    if (x == v) continue;
    dfspref(x, u);
    pref[u] += pref[x];
  }
}

int32_t main() {
// #ifndef ONLINE_JUDGE
  // freopen("putovanje.in", "r", stdin);
  // freopen("putovanje.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n;

  init();

  for (int i = 0; i < n - 1; i++) {
    int u, v, c1, c2;
    cin >> u >> v;
    u--, v--;
    adj[u].PB(v);
    adj[v].PB(u);
    cin >> c1 >> c2;
    edgs[i] = {u, v, c1, c2};
  }

  lc.init();

  for (int i = 0; i < n - 1; i++) {
    int u = i;
    int v = i + 1;
    int w = lc.getLCA(u, v);
    pref[u]++;
    pref[v]++;
    pref[w] -= 2;
  }

  dfspref(0, -1);

  int ret = 0;

  for (int i = 0; i < n - 1; i++) {
    int u = edgs[i][0];
    int v = edgs[i][1];
    if (!lc.isPar(u, v)) swap(u, v);
    // par of u is v
    int cnt, cost1, cost2;
    cnt = pref[u];
    cost1 = edgs[i][2];
    cost2 = edgs[i][3];
    ret += min(cnt * cost1, cost2);
  }

  cout << ret << '\n';

  return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 3 ms 952 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 34796 KB Output is correct
2 Correct 176 ms 35948 KB Output is correct
3 Correct 197 ms 39472 KB Output is correct
4 Correct 237 ms 40272 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 171 ms 34092 KB Output is correct
7 Correct 108 ms 24428 KB Output is correct
8 Correct 190 ms 35224 KB Output is correct
9 Correct 116 ms 37612 KB Output is correct
10 Correct 108 ms 36432 KB Output is correct
11 Correct 119 ms 39532 KB Output is correct
12 Correct 124 ms 39676 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 3 ms 952 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 180 ms 34796 KB Output is correct
11 Correct 176 ms 35948 KB Output is correct
12 Correct 197 ms 39472 KB Output is correct
13 Correct 237 ms 40272 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Correct 171 ms 34092 KB Output is correct
16 Correct 108 ms 24428 KB Output is correct
17 Correct 190 ms 35224 KB Output is correct
18 Correct 116 ms 37612 KB Output is correct
19 Correct 108 ms 36432 KB Output is correct
20 Correct 119 ms 39532 KB Output is correct
21 Correct 124 ms 39676 KB Output is correct
22 Correct 157 ms 36332 KB Output is correct
23 Correct 138 ms 32108 KB Output is correct
24 Correct 154 ms 35692 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 60 ms 16620 KB Output is correct
27 Correct 122 ms 30572 KB Output is correct
28 Correct 97 ms 33132 KB Output is correct
29 Correct 123 ms 39660 KB Output is correct
30 Correct 121 ms 39148 KB Output is correct
31 Correct 2 ms 876 KB Output is correct