oj.uz

Submission #842792

# Submission time Handle Problem Language Result Execution time Memory
842792 2023-09-03T11:32:39 Z eltu0815 Two Currencies (JOI23_currencies) C++14
40 / 100
 5000 ms 85896 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#define MAXN 101010
using namespace std;

typedef long long ll;

ll N, M, Q;
ll parent[20][MAXN];
ll depth[MAXN];
ll in[MAXN], out[MAXN];
ll max_height;
ll dfs_ordering[MAXN];
vector<ll> 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;
ll l[MAXN], r[MAXN];
vector< pair<ll, ll> > roads;

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

void input() {
   cin >> N >> M >> Q;
   roads.resize(N);
   for (ll i = 1; i <= N - 1; i++) {
      ll a, b;
      cin >> a >> b;
      adj[a].push_back(b);
      adj[b].push_back(a);
      roads[i] = { min(a, b), max(a, b) };
   }
   for (ll i = 1; i <= M; i++) {
      ll 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 (ll 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(ll n, ll dep) { // set in, out, depth, parent
   dfs_ordering[n] = ++ordering_idx;
   in[n] = ++Euler_tour_idx;
   depth[n] = dep;
   for (ll i = 0; i < adj[n].size(); i++) {
      ll 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
   ll tmp = N, cnt = 0;
   while (tmp > 1) {
      tmp >>= 1;
      cnt++;
   }
   max_height = cnt;
   for (ll k = 1; k <= max_height; k++)
      for (ll i = 2; i <= N; i++)
         if (parent[k - 1][i])
            parent[k][i] = parent[k - 1][parent[k - 1][i]];
}

int LCA(ll a, ll 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 (ll 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 (ll i = 0; i < Q; i++) { // set for PBS
      l[i] = -1;
      r[i] = M;
   }

   for (ll 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(tree2, 1, 1, Euler_tour_idx, in[E], 1); // SP 추가
      update(tree2, 1, 1, Euler_tour_idx, out[E], -1);
   }

   for (ll j = 0; j < Q; j++) {
      ll 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 (ll i = 0; i < MAXN; i++)
         g[i].clear();
      segclear();
      bool flag = 0;
      for (ll 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 (ll 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 (ll 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(ll, ll)':
currencies.cpp:64:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for (ll i = 0; i < adj[n].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
currencies.cpp: In function 'void solve()':
currencies.cpp:153:36: warning: unused variable 'VAL' [-Wunused-variable]
  153 |       ll 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 8 ms 29020 KB Output is correct
2 Correct 8 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 29020 KB Output is correct
5 Correct 39 ms 31560 KB Output is correct
6 Correct 45 ms 31580 KB Output is correct
7 Correct 31 ms 31632 KB Output is correct
8 Correct 37 ms 31776 KB Output is correct
9 Correct 37 ms 31580 KB Output is correct
10 Correct 35 ms 31800 KB Output is correct
11 Correct 34 ms 31576 KB Output is correct
12 Correct 35 ms 31576 KB Output is correct
13 Correct 43 ms 36188 KB Output is correct
14 Correct 36 ms 35924 KB Output is correct
15 Correct 35 ms 35920 KB Output is correct
16 Correct 35 ms 35788 KB Output is correct
17 Correct 35 ms 35676 KB Output is correct
18 Correct 38 ms 35932 KB Output is correct
19 Correct 34 ms 29712 KB Output is correct
20 Correct 32 ms 29528 KB Output is correct
21 Correct 37 ms 31828 KB Output is correct
22 Correct 34 ms 29716 KB Output is correct
23 Correct 30 ms 31792 KB Output is correct
24 Correct 31 ms 31580 KB Output is correct
25 Correct 34 ms 31724 KB Output is correct
26 Correct 30 ms 31672 KB Output is correct
27 Correct 26 ms 31832 KB Output is correct
28 Correct 28 ms 31576 KB Output is correct
29 Correct 29 ms 31580 KB Output is correct
30 Correct 35 ms 31580 KB Output is correct
31 Correct 36 ms 31576 KB Output is correct
32 Correct 36 ms 31720 KB Output is correct
33 Correct 43 ms 35792 KB Output is correct
34 Correct 38 ms 35836 KB Output is correct
35 Correct 45 ms 35916 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31064 KB Output is correct
2 Correct 36 ms 31684 KB Output is correct
3 Correct 38 ms 31716 KB Output is correct
4 Correct 40 ms 31796 KB Output is correct
5 Correct 3047 ms 61916 KB Output is correct
6 Correct 3045 ms 68060 KB Output is correct
7 Correct 2807 ms 66440 KB Output is correct
8 Correct 2163 ms 60776 KB Output is correct
9 Correct 2153 ms 61636 KB Output is correct
10 Correct 3648 ms 72208 KB Output is correct
11 Correct 3663 ms 71888 KB Output is correct
12 Correct 3626 ms 71604 KB Output is correct
13 Correct 4213 ms 71584 KB Output is correct
14 Correct 4478 ms 72160 KB Output is correct
15 Execution timed out 5044 ms 85896 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31068 KB Output is correct
2 Correct 40 ms 35892 KB Output is correct
3 Correct 37 ms 35920 KB Output is correct
4 Correct 36 ms 35992 KB Output is correct
5 Correct 2574 ms 75360 KB Output is correct
6 Correct 2491 ms 74192 KB Output is correct
7 Correct 2891 ms 71904 KB Output is correct
8 Correct 4514 ms 85248 KB Output is correct
9 Correct 4562 ms 85332 KB Output is correct
10 Correct 4495 ms 85152 KB Output is correct
11 Correct 2784 ms 85624 KB Output is correct
12 Correct 2750 ms 85112 KB Output is correct
13 Correct 2696 ms 85124 KB Output is correct
14 Correct 2270 ms 85888 KB Output is correct
15 Correct 2302 ms 85124 KB Output is correct
16 Correct 2557 ms 85328 KB Output is correct
17 Correct 2457 ms 85220 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29020 KB Output is correct
2 Correct 8 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 29020 KB Output is correct
5 Correct 39 ms 31560 KB Output is correct
6 Correct 45 ms 31580 KB Output is correct
7 Correct 31 ms 31632 KB Output is correct
8 Correct 37 ms 31776 KB Output is correct
9 Correct 37 ms 31580 KB Output is correct
10 Correct 35 ms 31800 KB Output is correct
11 Correct 34 ms 31576 KB Output is correct
12 Correct 35 ms 31576 KB Output is correct
13 Correct 43 ms 36188 KB Output is correct
14 Correct 36 ms 35924 KB Output is correct
15 Correct 35 ms 35920 KB Output is correct
16 Correct 35 ms 35788 KB Output is correct
17 Correct 35 ms 35676 KB Output is correct
18 Correct 38 ms 35932 KB Output is correct
19 Correct 34 ms 29712 KB Output is correct
20 Correct 32 ms 29528 KB Output is correct
21 Correct 37 ms 31828 KB Output is correct
22 Correct 34 ms 29716 KB Output is correct
23 Correct 30 ms 31792 KB Output is correct
24 Correct 31 ms 31580 KB Output is correct
25 Correct 34 ms 31724 KB Output is correct
26 Correct 30 ms 31672 KB Output is correct
27 Correct 26 ms 31832 KB Output is correct
28 Correct 28 ms 31576 KB Output is correct
29 Correct 29 ms 31580 KB Output is correct
30 Correct 35 ms 31580 KB Output is correct
31 Correct 36 ms 31576 KB Output is correct
32 Correct 36 ms 31720 KB Output is correct
33 Correct 43 ms 35792 KB Output is correct
34 Correct 38 ms 35836 KB Output is correct
35 Correct 45 ms 35916 KB Output is correct
36 Correct 5 ms 31064 KB Output is correct
37 Correct 36 ms 31684 KB Output is correct
38 Correct 38 ms 31716 KB Output is correct
39 Correct 40 ms 31796 KB Output is correct
40 Correct 3047 ms 61916 KB Output is correct
41 Correct 3045 ms 68060 KB Output is correct
42 Correct 2807 ms 66440 KB Output is correct
43 Correct 2163 ms 60776 KB Output is correct
44 Correct 2153 ms 61636 KB Output is correct
45 Correct 3648 ms 72208 KB Output is correct
46 Correct 3663 ms 71888 KB Output is correct
47 Correct 3626 ms 71604 KB Output is correct
48 Correct 4213 ms 71584 KB Output is correct
49 Correct 4478 ms 72160 KB Output is correct
50 Execution timed out 5044 ms 85896 KB Time limit exceeded
51 Halted 0 ms 0 KB -