oj.uz

Submission #806243

# Submission time Handle Problem Language Result Execution time Memory
806243 2023-08-04T05:28:09 Z arush_agu Birthday gift (IZhO18_treearray) C++17
56 / 100
 4 ms 1384 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

const int MAXN = 2020;
const int MAX_EULER = MAXN * 2 + 10;
const int MAXLG = 22;

int n, m, q;
vi adj[MAXN];
int a[MAXN];
int depth[MAXN];
ii euler_tour[MAXLG][MAX_EULER];
int first_occ[MAXN], lg2[MAX_EULER];
int tin[MAXN], tout[MAXN];
set<ii> s[MAXN];

void solve() {
  cin >> n >> m >> q;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    adj[u].push_back(v), adj[v].push_back(u);
  }

  for (int i = 0; i < m; i++)
    cin >> a[i], a[i]--;

  int timer = 0;
  int euler_sz = 0;
  function<void(int, int, int)> f = [&](int u, int p, int d) {
    depth[u] = d;
    first_occ[u] = euler_sz;
    euler_tour[0][euler_sz++] = {d, u};
    tin[u] = timer++;

    for (int &v : adj[u])
      if (v != p) {
        f(v, u, d + 1);
        euler_tour[0][euler_sz++] = {d, u};
      }

    tout[u] = timer++;
  };
  f(0, -1, 0);

  lg2[1] = 0;
  for (int i = 2; i < MAX_EULER; i++)
    lg2[i] = lg2[i / 2] + 1;

  for (int j = 1; j < MAXLG; j++)
    for (int i = 0; i + (1 << j) <= euler_sz; i++)
      euler_tour[j][i] =
          min(euler_tour[j - 1][i], euler_tour[j - 1][i + (1 << (j - 1))]);

  auto is_anc = [&](int u, int v) {
    return tin[u] <= tin[v] && tout[v] <= tout[u];
  };

  auto lca = [&](int u, int v) {
    if (u == v)
      return u;
    if (first_occ[u] > first_occ[v])
      swap(u, v);
    int k = lg2[first_occ[v] - first_occ[u] + 1];
    return min(euler_tour[k][first_occ[u]],
               euler_tour[k][first_occ[v] - (1 << k) + 1])
        .second;
  };

  for (int i = 0; i < m; i++) {
    s[a[i]].insert({i, i});
    if (i < m - 1)
      s[lca(a[i], a[i + 1])].insert({i, i + 1});
  }

  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int p, v;
      cin >> p >> v;
      p--, v--;
      s[a[p]].erase({p, p});
      if (p > 0)
        s[lca(a[p - 1], a[p])].erase({p - 1, p});
      if (p < m - 1)
        s[lca(a[p], a[p + 1])].erase({p, p + 1});

      a[p] = v;
      s[a[p]].insert({p, p});
      if (p > 0)
        s[lca(a[p - 1], a[p])].insert({p - 1, p});
      if (p < m - 1)
        s[lca(a[p], a[p + 1])].insert({p, p + 1});
    } else {
      int l, r, v;
      cin >> l >> r >> v;
      l--, r--, v--;

      auto it = s[v].lower_bound({l, l});
      if (it == s[v].end() || it->second > r)
        cout << "-1 -1\n";
      else
        cout << it->first + 1 << " " << it->second + 1 << "\n";
    }
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

treearray.cpp: In function 'void solve()':
treearray.cpp:146:8: warning: variable 'is_anc' set but not used [-Wunused-but-set-variable]
  146 |   auto is_anc = [&](int u, int v) {
      |        ^~~~~~
treearray.cpp: In function 'int main()':
treearray.cpp:204:11: warning: unused variable 'start' [-Wunused-variable]
  204 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n=5
2 Correct 1 ms 468 KB n=100
3 Correct 1 ms 468 KB n=100
4 Correct 1 ms 468 KB n=100
5 Correct 1 ms 468 KB n=100
6 Correct 1 ms 476 KB n=100
7 Correct 1 ms 468 KB n=100
8 Correct 1 ms 468 KB n=100
9 Correct 1 ms 472 KB n=100
10 Correct 1 ms 468 KB n=100
11 Correct 1 ms 468 KB n=100
12 Correct 1 ms 468 KB n=100
13 Correct 1 ms 468 KB n=100
14 Correct 1 ms 468 KB n=100
15 Correct 1 ms 468 KB n=100
16 Correct 1 ms 468 KB n=100
17 Correct 1 ms 468 KB n=100
18 Correct 1 ms 468 KB n=100
19 Correct 1 ms 476 KB n=100
20 Correct 1 ms 468 KB n=100
21 Correct 1 ms 468 KB n=100
22 Correct 1 ms 476 KB n=100
23 Correct 1 ms 596 KB n=100
24 Correct 1 ms 468 KB n=100
25 Correct 1 ms 468 KB n=100
26 Correct 1 ms 472 KB n=12
27 Correct 1 ms 468 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n=5
2 Correct 1 ms 468 KB n=100
3 Correct 1 ms 468 KB n=100
4 Correct 1 ms 468 KB n=100
5 Correct 1 ms 468 KB n=100
6 Correct 1 ms 476 KB n=100
7 Correct 1 ms 468 KB n=100
8 Correct 1 ms 468 KB n=100
9 Correct 1 ms 472 KB n=100
10 Correct 1 ms 468 KB n=100
11 Correct 1 ms 468 KB n=100
12 Correct 1 ms 468 KB n=100
13 Correct 1 ms 468 KB n=100
14 Correct 1 ms 468 KB n=100
15 Correct 1 ms 468 KB n=100
16 Correct 1 ms 468 KB n=100
17 Correct 1 ms 468 KB n=100
18 Correct 1 ms 468 KB n=100
19 Correct 1 ms 476 KB n=100
20 Correct 1 ms 468 KB n=100
21 Correct 1 ms 468 KB n=100
22 Correct 1 ms 476 KB n=100
23 Correct 1 ms 596 KB n=100
24 Correct 1 ms 468 KB n=100
25 Correct 1 ms 468 KB n=100
26 Correct 1 ms 472 KB n=12
27 Correct 1 ms 468 KB n=100
28 Correct 1 ms 604 KB n=500
29 Correct 1 ms 724 KB n=500
30 Correct 1 ms 724 KB n=500
31 Correct 1 ms 740 KB n=500
32 Correct 1 ms 596 KB n=500
33 Correct 1 ms 620 KB n=500
34 Correct 1 ms 612 KB n=500
35 Correct 1 ms 724 KB n=500
36 Correct 1 ms 596 KB n=500
37 Correct 1 ms 596 KB n=500
38 Correct 1 ms 596 KB n=500
39 Correct 1 ms 596 KB n=500
40 Correct 1 ms 596 KB n=500
41 Correct 1 ms 596 KB n=500
42 Correct 1 ms 596 KB n=500
43 Correct 1 ms 596 KB n=500
44 Correct 1 ms 596 KB n=500
45 Correct 1 ms 596 KB n=500
46 Correct 1 ms 748 KB n=500
47 Correct 1 ms 724 KB n=500
48 Correct 1 ms 612 KB n=500
49 Correct 1 ms 724 KB n=500
50 Correct 1 ms 596 KB n=500
51 Correct 1 ms 724 KB n=500
52 Correct 1 ms 724 KB n=500
53 Correct 1 ms 724 KB n=500
54 Correct 1 ms 724 KB n=500
55 Correct 1 ms 596 KB n=278
56 Correct 1 ms 736 KB n=500
57 Correct 1 ms 724 KB n=500
58 Correct 1 ms 596 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n=5
2 Correct 1 ms 468 KB n=100
3 Correct 1 ms 468 KB n=100
4 Correct 1 ms 468 KB n=100
5 Correct 1 ms 468 KB n=100
6 Correct 1 ms 476 KB n=100
7 Correct 1 ms 468 KB n=100
8 Correct 1 ms 468 KB n=100
9 Correct 1 ms 472 KB n=100
10 Correct 1 ms 468 KB n=100
11 Correct 1 ms 468 KB n=100
12 Correct 1 ms 468 KB n=100
13 Correct 1 ms 468 KB n=100
14 Correct 1 ms 468 KB n=100
15 Correct 1 ms 468 KB n=100
16 Correct 1 ms 468 KB n=100
17 Correct 1 ms 468 KB n=100
18 Correct 1 ms 468 KB n=100
19 Correct 1 ms 476 KB n=100
20 Correct 1 ms 468 KB n=100
21 Correct 1 ms 468 KB n=100
22 Correct 1 ms 476 KB n=100
23 Correct 1 ms 596 KB n=100
24 Correct 1 ms 468 KB n=100
25 Correct 1 ms 468 KB n=100
26 Correct 1 ms 472 KB n=12
27 Correct 1 ms 468 KB n=100
28 Correct 1 ms 604 KB n=500
29 Correct 1 ms 724 KB n=500
30 Correct 1 ms 724 KB n=500
31 Correct 1 ms 740 KB n=500
32 Correct 1 ms 596 KB n=500
33 Correct 1 ms 620 KB n=500
34 Correct 1 ms 612 KB n=500
35 Correct 1 ms 724 KB n=500
36 Correct 1 ms 596 KB n=500
37 Correct 1 ms 596 KB n=500
38 Correct 1 ms 596 KB n=500
39 Correct 1 ms 596 KB n=500
40 Correct 1 ms 596 KB n=500
41 Correct 1 ms 596 KB n=500
42 Correct 1 ms 596 KB n=500
43 Correct 1 ms 596 KB n=500
44 Correct 1 ms 596 KB n=500
45 Correct 1 ms 596 KB n=500
46 Correct 1 ms 748 KB n=500
47 Correct 1 ms 724 KB n=500
48 Correct 1 ms 612 KB n=500
49 Correct 1 ms 724 KB n=500
50 Correct 1 ms 596 KB n=500
51 Correct 1 ms 724 KB n=500
52 Correct 1 ms 724 KB n=500
53 Correct 1 ms 724 KB n=500
54 Correct 1 ms 724 KB n=500
55 Correct 1 ms 596 KB n=278
56 Correct 1 ms 736 KB n=500
57 Correct 1 ms 724 KB n=500
58 Correct 1 ms 596 KB n=500
59 Correct 3 ms 1208 KB n=2000
60 Correct 3 ms 1364 KB n=2000
61 Correct 3 ms 1364 KB n=2000
62 Correct 3 ms 1252 KB n=2000
63 Correct 3 ms 1108 KB n=2000
64 Correct 3 ms 1236 KB n=2000
65 Correct 3 ms 1108 KB n=2000
66 Correct 3 ms 1364 KB n=2000
67 Correct 3 ms 1236 KB n=2000
68 Correct 3 ms 1252 KB n=2000
69 Correct 2 ms 1108 KB n=2000
70 Correct 3 ms 1108 KB n=2000
71 Correct 2 ms 1124 KB n=2000
72 Correct 2 ms 1108 KB n=2000
73 Correct 2 ms 1108 KB n=2000
74 Correct 3 ms 1108 KB n=1844
75 Correct 2 ms 1108 KB n=2000
76 Correct 3 ms 1108 KB n=2000
77 Correct 3 ms 1108 KB n=2000
78 Correct 4 ms 1108 KB n=2000
79 Correct 3 ms 1108 KB n=2000
80 Correct 3 ms 1364 KB n=2000
81 Correct 3 ms 1236 KB n=2000
82 Correct 3 ms 1108 KB n=2000
83 Correct 3 ms 1364 KB n=2000
84 Correct 3 ms 1108 KB n=2000
85 Correct 3 ms 1236 KB n=2000
86 Correct 3 ms 1236 KB n=2000
87 Correct 3 ms 1108 KB n=2000
88 Correct 2 ms 1364 KB n=2000
89 Correct 2 ms 1384 KB n=2000
90 Correct 3 ms 1364 KB n=2000
91 Correct 2 ms 1108 KB n=2000

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n=5
2 Correct 1 ms 468 KB n=100
3 Correct 1 ms 468 KB n=100
4 Correct 1 ms 468 KB n=100
5 Correct 1 ms 468 KB n=100
6 Correct 1 ms 476 KB n=100
7 Correct 1 ms 468 KB n=100
8 Correct 1 ms 468 KB n=100
9 Correct 1 ms 472 KB n=100
10 Correct 1 ms 468 KB n=100
11 Correct 1 ms 468 KB n=100
12 Correct 1 ms 468 KB n=100
13 Correct 1 ms 468 KB n=100
14 Correct 1 ms 468 KB n=100
15 Correct 1 ms 468 KB n=100
16 Correct 1 ms 468 KB n=100
17 Correct 1 ms 468 KB n=100
18 Correct 1 ms 468 KB n=100
19 Correct 1 ms 476 KB n=100
20 Correct 1 ms 468 KB n=100
21 Correct 1 ms 468 KB n=100
22 Correct 1 ms 476 KB n=100
23 Correct 1 ms 596 KB n=100
24 Correct 1 ms 468 KB n=100
25 Correct 1 ms 468 KB n=100
26 Correct 1 ms 472 KB n=12
27 Correct 1 ms 468 KB n=100
28 Correct 1 ms 604 KB n=500
29 Correct 1 ms 724 KB n=500
30 Correct 1 ms 724 KB n=500
31 Correct 1 ms 740 KB n=500
32 Correct 1 ms 596 KB n=500
33 Correct 1 ms 620 KB n=500
34 Correct 1 ms 612 KB n=500
35 Correct 1 ms 724 KB n=500
36 Correct 1 ms 596 KB n=500
37 Correct 1 ms 596 KB n=500
38 Correct 1 ms 596 KB n=500
39 Correct 1 ms 596 KB n=500
40 Correct 1 ms 596 KB n=500
41 Correct 1 ms 596 KB n=500
42 Correct 1 ms 596 KB n=500
43 Correct 1 ms 596 KB n=500
44 Correct 1 ms 596 KB n=500
45 Correct 1 ms 596 KB n=500
46 Correct 1 ms 748 KB n=500
47 Correct 1 ms 724 KB n=500
48 Correct 1 ms 612 KB n=500
49 Correct 1 ms 724 KB n=500
50 Correct 1 ms 596 KB n=500
51 Correct 1 ms 724 KB n=500
52 Correct 1 ms 724 KB n=500
53 Correct 1 ms 724 KB n=500
54 Correct 1 ms 724 KB n=500
55 Correct 1 ms 596 KB n=278
56 Correct 1 ms 736 KB n=500
57 Correct 1 ms 724 KB n=500
58 Correct 1 ms 596 KB n=500
59 Correct 3 ms 1208 KB n=2000
60 Correct 3 ms 1364 KB n=2000
61 Correct 3 ms 1364 KB n=2000
62 Correct 3 ms 1252 KB n=2000
63 Correct 3 ms 1108 KB n=2000
64 Correct 3 ms 1236 KB n=2000
65 Correct 3 ms 1108 KB n=2000
66 Correct 3 ms 1364 KB n=2000
67 Correct 3 ms 1236 KB n=2000
68 Correct 3 ms 1252 KB n=2000
69 Correct 2 ms 1108 KB n=2000
70 Correct 3 ms 1108 KB n=2000
71 Correct 2 ms 1124 KB n=2000
72 Correct 2 ms 1108 KB n=2000
73 Correct 2 ms 1108 KB n=2000
74 Correct 3 ms 1108 KB n=1844
75 Correct 2 ms 1108 KB n=2000
76 Correct 3 ms 1108 KB n=2000
77 Correct 3 ms 1108 KB n=2000
78 Correct 4 ms 1108 KB n=2000
79 Correct 3 ms 1108 KB n=2000
80 Correct 3 ms 1364 KB n=2000
81 Correct 3 ms 1236 KB n=2000
82 Correct 3 ms 1108 KB n=2000
83 Correct 3 ms 1364 KB n=2000
84 Correct 3 ms 1108 KB n=2000
85 Correct 3 ms 1236 KB n=2000
86 Correct 3 ms 1236 KB n=2000
87 Correct 3 ms 1108 KB n=2000
88 Correct 2 ms 1364 KB n=2000
89 Correct 2 ms 1384 KB n=2000
90 Correct 3 ms 1364 KB n=2000
91 Correct 2 ms 1108 KB n=2000
92 Runtime error 1 ms 724 KB Execution killed with signal 11
93 Halted 0 ms 0 KB -