oj.uz

Submission #213287

# Submission time Handle Problem Language Result Execution time Memory
213287 2020-03-25T12:10:10 Z quocnguyen1012 Putovanje (COCI20_putovanje) C++14
110 / 110
 196 ms 24056 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 2e5 + 5;

vector<pair<int, ii>> adj[maxn];
ll c1[maxn], c2[maxn];
int par[maxn][20], depth[maxn], sum[maxn];
int N;

void prepare(int u, int p = -1)
{
  for(int i = 1; (1 << i) <= N; ++i){
    par[u][i] = par[par[u][i - 1]][i - 1];
  }
  for(auto & v : adj[u]) if(v.fi != p){
    c1[v.fi] = v.se.fi;
    c2[v.fi] = v.se.se;
    depth[v.fi] = depth[u] + 1;
    par[v.fi][0] = u;
    prepare(v.fi, u);
  }
}

int LCA(int x, int y)
{
  if(depth[x] < depth[y]) swap(x, y);
  for(int k = 19; k >= 0; --k){
    if (depth[par[x][k]] >= depth[y]){
      x = par[x][k];
    }
  }
  if(x == y) return x;
  for(int k = 19; k >= 0; --k){
    if(par[x][k] != par[y][k]){
      x = par[x][k];
      y = par[y][k];
    }
  }
  return par[x][0];
}

void dfs(int u, int p = -1)
{
  for(auto & v : adj[u]) if(v.fi != p){
    dfs(v.fi, u);
    sum[u] += sum[v.fi];
  }
}

signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  cin >> N;
  for(int i = 1; i < N; ++i){
    int u, v, w1, w2;
    cin >> u >> v >> w1 >> w2;
    adj[u].eb(v, mp(w1, w2));
    adj[v].eb(u, mp(w1, w2));
  }
  depth[1] = 1;
  prepare(1);
  for(int i = 1; i < N; ++i){
    int lc = LCA(i, i + 1);
    sum[i]++; sum[i + 1]++; sum[lc] -= 2;
  }
  dfs(1);
  ll res = 0;
  for(int i = 2; i <= N; ++i){
    c1[i] *= sum[i];
    res += min(c1[i], c2[i]);
  }
  cout << res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 9 ms 5376 KB Output is correct
3 Correct 9 ms 5376 KB Output is correct
4 Correct 10 ms 5376 KB Output is correct
5 Correct 9 ms 5376 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 8 ms 5248 KB Output is correct
8 Correct 8 ms 5376 KB Output is correct
9 Correct 9 ms 5376 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 21112 KB Output is correct
2 Correct 171 ms 22012 KB Output is correct
3 Correct 196 ms 24056 KB Output is correct
4 Correct 180 ms 23928 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 149 ms 20728 KB Output is correct
7 Correct 106 ms 16504 KB Output is correct
8 Correct 179 ms 21240 KB Output is correct
9 Correct 99 ms 22136 KB Output is correct
10 Correct 101 ms 21624 KB Output is correct
11 Correct 108 ms 23032 KB Output is correct
12 Correct 106 ms 23288 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 9 ms 5376 KB Output is correct
3 Correct 9 ms 5376 KB Output is correct
4 Correct 10 ms 5376 KB Output is correct
5 Correct 9 ms 5376 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 8 ms 5248 KB Output is correct
8 Correct 8 ms 5376 KB Output is correct
9 Correct 9 ms 5376 KB Output is correct
10 Correct 170 ms 21112 KB Output is correct
11 Correct 171 ms 22012 KB Output is correct
12 Correct 196 ms 24056 KB Output is correct
13 Correct 180 ms 23928 KB Output is correct
14 Correct 8 ms 5248 KB Output is correct
15 Correct 149 ms 20728 KB Output is correct
16 Correct 106 ms 16504 KB Output is correct
17 Correct 179 ms 21240 KB Output is correct
18 Correct 99 ms 22136 KB Output is correct
19 Correct 101 ms 21624 KB Output is correct
20 Correct 108 ms 23032 KB Output is correct
21 Correct 106 ms 23288 KB Output is correct
22 Correct 149 ms 21112 KB Output is correct
23 Correct 113 ms 19192 KB Output is correct
24 Correct 128 ms 20732 KB Output is correct
25 Correct 9 ms 5248 KB Output is correct
26 Correct 54 ms 12152 KB Output is correct
27 Correct 108 ms 18680 KB Output is correct
28 Correct 85 ms 19960 KB Output is correct
29 Correct 108 ms 23288 KB Output is correct
30 Correct 106 ms 22904 KB Output is correct
31 Correct 9 ms 5376 KB Output is correct