oj.uz

Submission #842798

# Submission time Handle Problem Language Result Execution time Memory
842798 2023-09-03T11:36:16 Z eltu0815 Two Currencies (JOI23_currencies) C++14
100 / 100
 4818 ms 75316 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#define MAXN 101010
using namespace std;

typedef long long ll;

int N, M, Q;
int parent[20][MAXN];
int depth[MAXN];
int in[MAXN], out[MAXN];
int max_height;
int dfs_ordering[MAXN];
vector<int> adj[MAXN];

typedef struct save_points {
   ll s, e, val;
   bool operator < (const save_points& right) {
      return val < right.val;
   }
} save_points;

typedef struct Query {
   ll s, t, x, y;
} Query;

vector<save_points> SP;
vector<Query> queries;
int l[MAXN], r[MAXN];
vector< pair<int, int> > roads;

void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); }

void input() {
   cin >> N >> M >> Q;
   roads.resize(N);
   for (int i = 1; i <= N - 1; i++) {
      int a, b;
      cin >> a >> b;
      adj[a].push_back(b);
      adj[b].push_back(a);
      roads[i] = { min(a, b), max(a, b) };
   }
   for (int i = 1; i <= M; i++) {
      int a, b;
      cin >> a >> b;
      save_points tmp = { roads[a].first, roads[a].second, b };
      SP.push_back(tmp);
   }
   sort(SP.begin(), SP.end());
   queries.resize(Q);
   for (int i = 0; i < Q; i++)
      cin >> queries[i].s >> queries[i].t >> queries[i].x >> queries[i].y;
}

int Euler_tour_idx, ordering_idx;

void Euler_tour(int n, int dep) { // set in, out, depth, parent
   dfs_ordering[n] = ++ordering_idx;
   in[n] = ++Euler_tour_idx;
   depth[n] = dep;
   for (int i = 0; i < adj[n].size(); i++) {
      int next = adj[n][i];
      if (in[next]) continue;
      parent[0][next] = n;
      Euler_tour(next, dep + 1);
   }
   ++Euler_tour_idx;
   out[n] = Euler_tour_idx;
}

void set_parent() { // for faster lca
   int tmp = N, cnt = 0;
   while (tmp > 1) {
      tmp >>= 1;
      cnt++;
   }
   max_height = cnt;
   for (int k = 1; k <= max_height; k++)
      for (int i = 2; i <= N; i++)
         if (parent[k - 1][i])
            parent[k][i] = parent[k - 1][parent[k - 1][i]];
}

int LCA(int a, int b) { // returns lca of node a and b
   if (depth[a] != depth[b]) {
      if (depth[a] < depth[b]) swap(a, b); // a is deeper
      ll dif = depth[a] - depth[b];
      for (ll i = 0; dif > 0; i++) {
         if (dif & 1) a = parent[i][a];
         dif >>= 1;
      }
   }

   if (a != b) {
      for (int k = max_height; 0 <= k; k--) {
         if (parent[k][a] != 0 && parent[k][a] != parent[k][b]) {
            a = parent[k][a];
            b = parent[k][b];
         }
      }
      a = parent[0][a];
   }

   return a;
}

ll tree1[8 * MAXN], tree2[8 * MAXN], tree3[8 * MAXN];

void update(ll tree[], ll n, ll s, ll e, ll tgIdx, ll val) {
   if (s == e) {
      tree[n] += val;
      return;
   }
   ll lch = n * 2, rch = lch + 1, m = (s + e) / 2;
   if (tgIdx <= m) update(tree, lch, s, m, tgIdx, val);
   else update(tree, rch, m + 1, e, tgIdx, val);
   tree[n] = tree[lch] + tree[rch];
}

ll query(ll tree[], ll n, ll s, ll e, ll fs, ll fe) {
   if (e < fs || fe < s) return 0;
   if (fs <= s && e <= fe) return tree[n];
   ll lch = n * 2, rch = lch + 1, m = (s + e) / 2;
   ll left = query(tree, lch, s, m, fs, fe);
   ll right = query(tree, rch, m + 1, e, fs, fe);
   return left + right;
}

void segclear() {
   for (ll i = 0; i < 8 * MAXN; i++)
      tree1[i] = tree3[i] = 0;
}

vector<ll> g[MAXN];
ll ans[MAXN];
ll totSP[MAXN]{};
ll cnts[MAXN]{};

void solve() {
   for (int i = 0; i < MAXN; i++)
      ans[i] = -1;
   Euler_tour(1, 0); // for setting in, out, par
   set_parent(); // for faster LCA(O(logN))
   for (int i = 0; i < Q; i++) { // set for PBS
      l[i] = -1;
      r[i] = M;
   }

   for (int i = 0; i < M; i++) {
      int S = SP[i].s, E = SP[i].e, VAL = SP[i].val;
      if (in[E] <= in[S] && in[S] <= out[E]) swap(S, E);
      update(tree2, 1, 1, Euler_tour_idx, in[E], 1); // SP 추가
      update(tree2, 1, 1, Euler_tour_idx, out[E], -1);
   }

   for (int j = 0; j < Q; j++) {
      int tmp_lca = LCA(queries[j].s, queries[j].t);
      ll tmp = query(tree2, 1, 1, Euler_tour_idx, 1, in[queries[j].s]) + query(tree2, 1, 1, Euler_tour_idx, 1, in[queries[j].t]) - 2 * query(tree2, 1, 1, Euler_tour_idx, 1, in[tmp_lca]);
      totSP[j] = tmp;
   }

   while (1) {
      for (int i = 0; i < MAXN; i++)
         g[i].clear();
      segclear();
      bool flag = 0;
      for (int i = 0; i < Q; i++) {
         if (l[i] + 1 == r[i]) continue;
         flag = 1; g[l[i] + r[i] >> 1].push_back(i);
      }
      if (!flag) break;

      for (int i = 0; i < M; i++) {
         ll S = SP[i].s, E = SP[i].e, VAL = SP[i].val;
         if (in[E] <= in[S] && in[S] <= out[E]) swap(S, E);
         update(tree1, 1, 1, Euler_tour_idx, in[E], VAL); // SP (은화 가중치) 추가
         update(tree1, 1, 1, Euler_tour_idx, out[E], -VAL);
         update(tree3, 1, 1, Euler_tour_idx, in[E], 1); // SP (단순 개수) 추가
         update(tree3, 1, 1, Euler_tour_idx, out[E], -1);
         for (auto j : g[i]) {
            ll tmp_lca = LCA(queries[j].s, queries[j].t);
            ll tmp = query(tree1, 1, 1, Euler_tour_idx, 1, in[queries[j].s]) + query(tree1, 1, 1, Euler_tour_idx, 1, in[queries[j].t]) - 2 * query(tree1, 1, 1, Euler_tour_idx, 1, in[tmp_lca]);
            ll tmp3 = query(tree3, 1, 1, Euler_tour_idx, 1, in[queries[j].s]) + query(tree3, 1, 1, Euler_tour_idx, 1, in[queries[j].t]) - 2 * query(tree3, 1, 1, Euler_tour_idx, 1, in[tmp_lca]);
            if (tmp <= queries[j].y) {
               ans[j] = max(ans[j], queries[j].x - totSP[j] + tmp3);
               l[j] = i;
            }
            else r[j] = i;
         }
      }
   }
}

void output() {
   for (int i = 0; i < Q; i++) {
      if (ans[i] == -1 && queries[i].x >= totSP[i])
         ans[i] = queries[i].x - totSP[i];
      cout << ans[i] << '\n';
   }
}

int main() {
   fastIO();
   input();
   solve();
   output();
   return 0;
}

Compilation message

currencies.cpp: In function 'void Euler_tour(int, int)':
currencies.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for (int i = 0; i < adj[n].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~
currencies.cpp: In function 'void solve()':
currencies.cpp:153:37: warning: unused variable 'VAL' [-Wunused-variable]
  153 |       int S = SP[i].s, E = SP[i].e, VAL = SP[i].val;
      |                                     ^~~
currencies.cpp:172:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  172 |          flag = 1; g[l[i] + r[i] >> 1].push_back(i);
      |                      ~~~~~^~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 6 ms 26972 KB Output is correct
5 Correct 31 ms 27304 KB Output is correct
6 Correct 32 ms 27480 KB Output is correct
7 Correct 29 ms 27472 KB Output is correct
8 Correct 33 ms 27556 KB Output is correct
9 Correct 34 ms 27556 KB Output is correct
10 Correct 36 ms 27392 KB Output is correct
11 Correct 34 ms 27552 KB Output is correct
12 Correct 37 ms 27672 KB Output is correct
13 Correct 36 ms 29608 KB Output is correct
14 Correct 34 ms 29828 KB Output is correct
15 Correct 35 ms 29576 KB Output is correct
16 Correct 35 ms 29532 KB Output is correct
17 Correct 36 ms 29532 KB Output is correct
18 Correct 36 ms 29532 KB Output is correct
19 Correct 32 ms 27484 KB Output is correct
20 Correct 33 ms 27492 KB Output is correct
21 Correct 32 ms 27416 KB Output is correct
22 Correct 32 ms 27484 KB Output is correct
23 Correct 29 ms 27496 KB Output is correct
24 Correct 33 ms 27484 KB Output is correct
25 Correct 29 ms 27484 KB Output is correct
26 Correct 25 ms 27736 KB Output is correct
27 Correct 26 ms 27684 KB Output is correct
28 Correct 28 ms 27484 KB Output is correct
29 Correct 28 ms 27484 KB Output is correct
30 Correct 34 ms 27456 KB Output is correct
31 Correct 40 ms 27472 KB Output is correct
32 Correct 34 ms 27784 KB Output is correct
33 Correct 35 ms 29532 KB Output is correct
34 Correct 35 ms 29532 KB Output is correct
35 Correct 37 ms 29532 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27132 KB Output is correct
2 Correct 34 ms 27388 KB Output is correct
3 Correct 36 ms 27348 KB Output is correct
4 Correct 34 ms 27472 KB Output is correct
5 Correct 2183 ms 52436 KB Output is correct
6 Correct 2423 ms 56708 KB Output is correct
7 Correct 2335 ms 55516 KB Output is correct
8 Correct 1897 ms 51596 KB Output is correct
9 Correct 2029 ms 51608 KB Output is correct
10 Correct 3164 ms 61116 KB Output is correct
11 Correct 3554 ms 61088 KB Output is correct
12 Correct 3367 ms 59256 KB Output is correct
13 Correct 3487 ms 61376 KB Output is correct
14 Correct 3399 ms 61196 KB Output is correct
15 Correct 4144 ms 69252 KB Output is correct
16 Correct 4245 ms 75316 KB Output is correct
17 Correct 4197 ms 74340 KB Output is correct
18 Correct 3835 ms 68616 KB Output is correct
19 Correct 3895 ms 68568 KB Output is correct
20 Correct 3772 ms 68936 KB Output is correct
21 Correct 2992 ms 64920 KB Output is correct
22 Correct 3030 ms 65000 KB Output is correct
23 Correct 3014 ms 64572 KB Output is correct
24 Correct 2930 ms 64376 KB Output is correct
25 Correct 2563 ms 66752 KB Output is correct
26 Correct 2453 ms 65964 KB Output is correct
27 Correct 2407 ms 67116 KB Output is correct
28 Correct 2000 ms 65328 KB Output is correct
29 Correct 1825 ms 63512 KB Output is correct
30 Correct 2183 ms 63776 KB Output is correct
31 Correct 2218 ms 63832 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 41 ms 29872 KB Output is correct
3 Correct 35 ms 29696 KB Output is correct
4 Correct 36 ms 29528 KB Output is correct
5 Correct 2173 ms 59976 KB Output is correct
6 Correct 2157 ms 60040 KB Output is correct
7 Correct 2619 ms 58640 KB Output is correct
8 Correct 3658 ms 69372 KB Output is correct
9 Correct 3764 ms 69820 KB Output is correct
10 Correct 3637 ms 70176 KB Output is correct
11 Correct 2581 ms 70196 KB Output is correct
12 Correct 2508 ms 69564 KB Output is correct
13 Correct 2527 ms 69444 KB Output is correct
14 Correct 2004 ms 69360 KB Output is correct
15 Correct 2019 ms 69224 KB Output is correct
16 Correct 2354 ms 69452 KB Output is correct
17 Correct 2532 ms 69344 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 6 ms 26972 KB Output is correct
5 Correct 31 ms 27304 KB Output is correct
6 Correct 32 ms 27480 KB Output is correct
7 Correct 29 ms 27472 KB Output is correct
8 Correct 33 ms 27556 KB Output is correct
9 Correct 34 ms 27556 KB Output is correct
10 Correct 36 ms 27392 KB Output is correct
11 Correct 34 ms 27552 KB Output is correct
12 Correct 37 ms 27672 KB Output is correct
13 Correct 36 ms 29608 KB Output is correct
14 Correct 34 ms 29828 KB Output is correct
15 Correct 35 ms 29576 KB Output is correct
16 Correct 35 ms 29532 KB Output is correct
17 Correct 36 ms 29532 KB Output is correct
18 Correct 36 ms 29532 KB Output is correct
19 Correct 32 ms 27484 KB Output is correct
20 Correct 33 ms 27492 KB Output is correct
21 Correct 32 ms 27416 KB Output is correct
22 Correct 32 ms 27484 KB Output is correct
23 Correct 29 ms 27496 KB Output is correct
24 Correct 33 ms 27484 KB Output is correct
25 Correct 29 ms 27484 KB Output is correct
26 Correct 25 ms 27736 KB Output is correct
27 Correct 26 ms 27684 KB Output is correct
28 Correct 28 ms 27484 KB Output is correct
29 Correct 28 ms 27484 KB Output is correct
30 Correct 34 ms 27456 KB Output is correct
31 Correct 40 ms 27472 KB Output is correct
32 Correct 34 ms 27784 KB Output is correct
33 Correct 35 ms 29532 KB Output is correct
34 Correct 35 ms 29532 KB Output is correct
35 Correct 37 ms 29532 KB Output is correct
36 Correct 5 ms 27132 KB Output is correct
37 Correct 34 ms 27388 KB Output is correct
38 Correct 36 ms 27348 KB Output is correct
39 Correct 34 ms 27472 KB Output is correct
40 Correct 2183 ms 52436 KB Output is correct
41 Correct 2423 ms 56708 KB Output is correct
42 Correct 2335 ms 55516 KB Output is correct
43 Correct 1897 ms 51596 KB Output is correct
44 Correct 2029 ms 51608 KB Output is correct
45 Correct 3164 ms 61116 KB Output is correct
46 Correct 3554 ms 61088 KB Output is correct
47 Correct 3367 ms 59256 KB Output is correct
48 Correct 3487 ms 61376 KB Output is correct
49 Correct 3399 ms 61196 KB Output is correct
50 Correct 4144 ms 69252 KB Output is correct
51 Correct 4245 ms 75316 KB Output is correct
52 Correct 4197 ms 74340 KB Output is correct
53 Correct 3835 ms 68616 KB Output is correct
54 Correct 3895 ms 68568 KB Output is correct
55 Correct 3772 ms 68936 KB Output is correct
56 Correct 2992 ms 64920 KB Output is correct
57 Correct 3030 ms 65000 KB Output is correct
58 Correct 3014 ms 64572 KB Output is correct
59 Correct 2930 ms 64376 KB Output is correct
60 Correct 2563 ms 66752 KB Output is correct
61 Correct 2453 ms 65964 KB Output is correct
62 Correct 2407 ms 67116 KB Output is correct
63 Correct 2000 ms 65328 KB Output is correct
64 Correct 1825 ms 63512 KB Output is correct
65 Correct 2183 ms 63776 KB Output is correct
66 Correct 2218 ms 63832 KB Output is correct
67 Correct 5 ms 26968 KB Output is correct
68 Correct 41 ms 29872 KB Output is correct
69 Correct 35 ms 29696 KB Output is correct
70 Correct 36 ms 29528 KB Output is correct
71 Correct 2173 ms 59976 KB Output is correct
72 Correct 2157 ms 60040 KB Output is correct
73 Correct 2619 ms 58640 KB Output is correct
74 Correct 3658 ms 69372 KB Output is correct
75 Correct 3764 ms 69820 KB Output is correct
76 Correct 3637 ms 70176 KB Output is correct
77 Correct 2581 ms 70196 KB Output is correct
78 Correct 2508 ms 69564 KB Output is correct
79 Correct 2527 ms 69444 KB Output is correct
80 Correct 2004 ms 69360 KB Output is correct
81 Correct 2019 ms 69224 KB Output is correct
82 Correct 2354 ms 69452 KB Output is correct
83 Correct 2532 ms 69344 KB Output is correct
84 Correct 2559 ms 54344 KB Output is correct
85 Correct 2300 ms 55156 KB Output is correct
86 Correct 1954 ms 53992 KB Output is correct
87 Correct 3588 ms 66288 KB Output is correct
88 Correct 3634 ms 66168 KB Output is correct
89 Correct 3411 ms 64276 KB Output is correct
90 Correct 3779 ms 64156 KB Output is correct
91 Correct 3936 ms 66704 KB Output is correct
92 Correct 4460 ms 73400 KB Output is correct
93 Correct 4818 ms 74388 KB Output is correct
94 Correct 3962 ms 68532 KB Output is correct
95 Correct 4657 ms 68660 KB Output is correct
96 Correct 4664 ms 68484 KB Output is correct
97 Correct 4599 ms 68888 KB Output is correct
98 Correct 4003 ms 64336 KB Output is correct
99 Correct 4027 ms 64040 KB Output is correct
100 Correct 3649 ms 64220 KB Output is correct
101 Correct 3740 ms 65040 KB Output is correct
102 Correct 2678 ms 66872 KB Output is correct
103 Correct 2711 ms 66680 KB Output is correct
104 Correct 2571 ms 66628 KB Output is correct
105 Correct 1998 ms 63176 KB Output is correct
106 Correct 1950 ms 64656 KB Output is correct
107 Correct 2157 ms 62916 KB Output is correct
108 Correct 2143 ms 63176 KB Output is correct