oj.uz

Submission #894199

# Submission time Handle Problem Language Result Execution time Memory
894199 2023-12-28T02:50:56 Z box Two Currencies (JOI23_currencies) C++17
100 / 100
 539 ms 69644 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
 
#define ar array
#define all(v) (v).begin(), (v).end()
#define sz(v) static_cast<int>(v.size())
typedef vector<int> vi;
typedef long long ll;
 
const int N = 1e5, L = 17, N_ = N * 20;
 
int ct[N_], lc[N_], rc[N_], tt;
ll sm[N_];
vi vc;
 
int copy(int k) {
  tt++;
  ct[tt] = ct[k], lc[tt] = lc[k], rc[tt] = rc[k], sm[tt] = sm[k];
  return tt;
}
void upd(int& k, int l, int r, int i) {
  k = copy(k);
  sm[k] += vc[i], ct[k]++;
  if (l < r) {
    int m = (l + r) / 2;
    if (i <= m)
      upd(lc[k], l, m, i);
    else
      upd(rc[k], m + 1, r, i);
  }
}
int get(int ki, int kj, int kp, int l, int r, ll y) {
  if (l == r)
    return min((ll)(ct[ki] + ct[kj] - 2 * ct[kp]), y / vc[l]);
  else {
    int m = (l + r) / 2;
    ll ls = sm[lc[ki]] + sm[lc[kj]] - 2 * sm[lc[kp]];
    if (ls <= y)
      return ct[lc[ki]] + ct[lc[kj]] - 2 * ct[lc[kp]] +
             get(rc[ki], rc[kj], rc[kp], m + 1, r, y - ls);
    else
      return get(lc[ki], lc[kj], lc[kp], l, m, y);
  }
}
 
vi g[N], ad[N];
int p[L][N], d[N], gc[N], tr[N];
 
void dfs(int i) {
  FOR(l, 1, L) p[l][i] = p[l - 1][p[l - 1][i]];
  for (int j : g[i])
    if (p[0][i] != j) {
      p[0][j] = i;
      d[j] = d[i] + 1;
      dfs(j);
    }
}
void bld(int i) {
  for (int c : ad[i]) upd(tr[i], 0, sz(vc) - 1, c);
  gc[i] += sz(ad[i]);
  for (int j : g[i])
    if (p[0][i] != j) {
      tr[j] = tr[i];
      gc[j] = gc[i];
      bld(j);
    }
}
int lca(int i, int j) {
  if (d[i] < d[j]) swap(i, j);
  int k = d[i] - d[j];
  F0R(l, L) if (k >> l & 1) i = p[l][i];
  if (i == j) return i;
  R0F(l, L) if (p[l][i] != p[l][j]) i = p[l][i], j = p[l][j];
  return p[0][i];
}
 
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin.exceptions(cin.failbit);
  int n, m, q;
  cin >> n >> m >> q;
  static ar<int, 2> ed[N - 1];
  F0R(h, n - 1) {
    int i, j;
    cin >> i >> j, i--, j--;
    ed[h] = {i, j};
    g[i].push_back(j), g[j].push_back(i);
  }
  dfs(0);
  F0R(h, n - 1)
  if (p[0][ed[h][0]] == ed[h][1]) swap(ed[h][0], ed[h][1]);
  F0R(h, m) {
    int e, c;
    cin >> e >> c, e--;
    ad[ed[e][1]].push_back(c);
    vc.push_back(c);
  }
  sort(all(vc));
  vc.erase(unique(all(vc)), end(vc));
  F0R(i, n) for (int& c : ad[i]) c = lower_bound(all(vc), c) - begin(vc);
  bld(0);
  F0R(h, q) {
    int i, j, x;
    ll y;
    cin >> i >> j >> x >> y, i--, j--;
    int p = lca(i, j);
    x -= gc[i] + gc[j] - 2 * gc[p] - get(tr[i], tr[j], tr[p], 0, sz(vc) - 1, y);
    cout << max(x, -1) << '\n';
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 2 ms 12784 KB Output is correct
4 Correct 2 ms 12888 KB Output is correct
5 Correct 4 ms 13148 KB Output is correct
6 Correct 4 ms 13292 KB Output is correct
7 Correct 4 ms 13148 KB Output is correct
8 Correct 5 ms 13148 KB Output is correct
9 Correct 5 ms 13300 KB Output is correct
10 Correct 5 ms 13148 KB Output is correct
11 Correct 5 ms 13148 KB Output is correct
12 Correct 4 ms 13148 KB Output is correct
13 Correct 7 ms 13404 KB Output is correct
14 Correct 5 ms 13404 KB Output is correct
15 Correct 6 ms 13436 KB Output is correct
16 Correct 5 ms 13404 KB Output is correct
17 Correct 6 ms 13196 KB Output is correct
18 Correct 6 ms 13404 KB Output is correct
19 Correct 6 ms 13148 KB Output is correct
20 Correct 4 ms 13240 KB Output is correct
21 Correct 4 ms 13292 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 5 ms 13144 KB Output is correct
24 Correct 5 ms 13376 KB Output is correct
25 Correct 5 ms 13148 KB Output is correct
26 Correct 4 ms 13400 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 4 ms 13148 KB Output is correct
29 Correct 6 ms 13148 KB Output is correct
30 Correct 4 ms 13036 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 5 ms 13404 KB Output is correct
34 Correct 7 ms 13400 KB Output is correct
35 Correct 7 ms 13404 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 4 ms 12892 KB Output is correct
3 Correct 4 ms 12984 KB Output is correct
4 Correct 4 ms 12892 KB Output is correct
5 Correct 100 ms 26892 KB Output is correct
6 Correct 103 ms 25200 KB Output is correct
7 Correct 92 ms 25484 KB Output is correct
8 Correct 89 ms 24700 KB Output is correct
9 Correct 86 ms 24904 KB Output is correct
10 Correct 216 ms 27932 KB Output is correct
11 Correct 180 ms 27888 KB Output is correct
12 Correct 118 ms 27840 KB Output is correct
13 Correct 160 ms 28028 KB Output is correct
14 Correct 145 ms 27852 KB Output is correct
15 Correct 176 ms 35920 KB Output is correct
16 Correct 165 ms 36176 KB Output is correct
17 Correct 168 ms 35432 KB Output is correct
18 Correct 150 ms 28528 KB Output is correct
19 Correct 152 ms 28240 KB Output is correct
20 Correct 137 ms 28360 KB Output is correct
21 Correct 107 ms 27576 KB Output is correct
22 Correct 122 ms 27576 KB Output is correct
23 Correct 120 ms 27784 KB Output is correct
24 Correct 116 ms 27596 KB Output is correct
25 Correct 135 ms 27852 KB Output is correct
26 Correct 120 ms 27848 KB Output is correct
27 Correct 112 ms 27800 KB Output is correct
28 Correct 109 ms 27844 KB Output is correct
29 Correct 112 ms 27732 KB Output is correct
30 Correct 123 ms 28028 KB Output is correct
31 Correct 138 ms 27924 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 5 ms 13404 KB Output is correct
3 Correct 5 ms 13448 KB Output is correct
4 Correct 5 ms 13404 KB Output is correct
5 Correct 248 ms 56256 KB Output is correct
6 Correct 227 ms 51344 KB Output is correct
7 Correct 315 ms 61744 KB Output is correct
8 Correct 434 ms 69404 KB Output is correct
9 Correct 417 ms 69476 KB Output is correct
10 Correct 469 ms 69644 KB Output is correct
11 Correct 338 ms 68908 KB Output is correct
12 Correct 355 ms 69012 KB Output is correct
13 Correct 324 ms 68740 KB Output is correct
14 Correct 179 ms 69284 KB Output is correct
15 Correct 174 ms 69252 KB Output is correct
16 Correct 231 ms 69368 KB Output is correct
17 Correct 247 ms 69300 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 2 ms 12784 KB Output is correct
4 Correct 2 ms 12888 KB Output is correct
5 Correct 4 ms 13148 KB Output is correct
6 Correct 4 ms 13292 KB Output is correct
7 Correct 4 ms 13148 KB Output is correct
8 Correct 5 ms 13148 KB Output is correct
9 Correct 5 ms 13300 KB Output is correct
10 Correct 5 ms 13148 KB Output is correct
11 Correct 5 ms 13148 KB Output is correct
12 Correct 4 ms 13148 KB Output is correct
13 Correct 7 ms 13404 KB Output is correct
14 Correct 5 ms 13404 KB Output is correct
15 Correct 6 ms 13436 KB Output is correct
16 Correct 5 ms 13404 KB Output is correct
17 Correct 6 ms 13196 KB Output is correct
18 Correct 6 ms 13404 KB Output is correct
19 Correct 6 ms 13148 KB Output is correct
20 Correct 4 ms 13240 KB Output is correct
21 Correct 4 ms 13292 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 5 ms 13144 KB Output is correct
24 Correct 5 ms 13376 KB Output is correct
25 Correct 5 ms 13148 KB Output is correct
26 Correct 4 ms 13400 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 4 ms 13148 KB Output is correct
29 Correct 6 ms 13148 KB Output is correct
30 Correct 4 ms 13036 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 5 ms 13404 KB Output is correct
34 Correct 7 ms 13400 KB Output is correct
35 Correct 7 ms 13404 KB Output is correct
36 Correct 3 ms 12632 KB Output is correct
37 Correct 4 ms 12892 KB Output is correct
38 Correct 4 ms 12984 KB Output is correct
39 Correct 4 ms 12892 KB Output is correct
40 Correct 100 ms 26892 KB Output is correct
41 Correct 103 ms 25200 KB Output is correct
42 Correct 92 ms 25484 KB Output is correct
43 Correct 89 ms 24700 KB Output is correct
44 Correct 86 ms 24904 KB Output is correct
45 Correct 216 ms 27932 KB Output is correct
46 Correct 180 ms 27888 KB Output is correct
47 Correct 118 ms 27840 KB Output is correct
48 Correct 160 ms 28028 KB Output is correct
49 Correct 145 ms 27852 KB Output is correct
50 Correct 176 ms 35920 KB Output is correct
51 Correct 165 ms 36176 KB Output is correct
52 Correct 168 ms 35432 KB Output is correct
53 Correct 150 ms 28528 KB Output is correct
54 Correct 152 ms 28240 KB Output is correct
55 Correct 137 ms 28360 KB Output is correct
56 Correct 107 ms 27576 KB Output is correct
57 Correct 122 ms 27576 KB Output is correct
58 Correct 120 ms 27784 KB Output is correct
59 Correct 116 ms 27596 KB Output is correct
60 Correct 135 ms 27852 KB Output is correct
61 Correct 120 ms 27848 KB Output is correct
62 Correct 112 ms 27800 KB Output is correct
63 Correct 109 ms 27844 KB Output is correct
64 Correct 112 ms 27732 KB Output is correct
65 Correct 123 ms 28028 KB Output is correct
66 Correct 138 ms 27924 KB Output is correct
67 Correct 2 ms 12636 KB Output is correct
68 Correct 5 ms 13404 KB Output is correct
69 Correct 5 ms 13448 KB Output is correct
70 Correct 5 ms 13404 KB Output is correct
71 Correct 248 ms 56256 KB Output is correct
72 Correct 227 ms 51344 KB Output is correct
73 Correct 315 ms 61744 KB Output is correct
74 Correct 434 ms 69404 KB Output is correct
75 Correct 417 ms 69476 KB Output is correct
76 Correct 469 ms 69644 KB Output is correct
77 Correct 338 ms 68908 KB Output is correct
78 Correct 355 ms 69012 KB Output is correct
79 Correct 324 ms 68740 KB Output is correct
80 Correct 179 ms 69284 KB Output is correct
81 Correct 174 ms 69252 KB Output is correct
82 Correct 231 ms 69368 KB Output is correct
83 Correct 247 ms 69300 KB Output is correct
84 Correct 197 ms 58828 KB Output is correct
85 Correct 200 ms 54344 KB Output is correct
86 Correct 171 ms 43368 KB Output is correct
87 Correct 265 ms 60684 KB Output is correct
88 Correct 275 ms 60844 KB Output is correct
89 Correct 268 ms 60872 KB Output is correct
90 Correct 276 ms 60752 KB Output is correct
91 Correct 287 ms 60872 KB Output is correct
92 Correct 539 ms 66344 KB Output is correct
93 Correct 522 ms 68184 KB Output is correct
94 Correct 408 ms 61448 KB Output is correct
95 Correct 403 ms 61296 KB Output is correct
96 Correct 393 ms 61240 KB Output is correct
97 Correct 441 ms 61260 KB Output is correct
98 Correct 214 ms 60552 KB Output is correct
99 Correct 211 ms 60728 KB Output is correct
100 Correct 220 ms 60612 KB Output is correct
101 Correct 197 ms 60616 KB Output is correct
102 Correct 284 ms 60844 KB Output is correct
103 Correct 283 ms 60620 KB Output is correct
104 Correct 321 ms 60732 KB Output is correct
105 Correct 192 ms 60876 KB Output is correct
106 Correct 211 ms 60964 KB Output is correct
107 Correct 231 ms 60628 KB Output is correct
108 Correct 206 ms 60872 KB Output is correct