oj.uz

Submission #336279

# Submission time Handle Problem Language Result Execution time Memory
336279 2020-12-15T03:42:18 Z caoash Birthday gift (IZhO18_treearray) C++17
100 / 100
 1690 ms 99180 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

template < int SZ > struct LCA {
  int depth[SZ];
  int p[SZ][33];
  vector < int > adj[SZ];
  void addEdge(int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  void dfs(int v, int par) {
    for (int to: adj[v]) {
      if (to != par) {
        p[to][0] = v;
        depth[to] = depth[v] + 1;
        dfs(to, v);
      }
    }
  }
  void precomp() {
    for (int i = 0; i < SZ; i++) {
      for (int j = 0; j < 32; j++) {
        p[i][j] = -1;
      }
    }
    p[0][0] = 0;
    dfs(0, -1);
    for (int j = 1; j < 32; j++) {
      for (int i = 0; i < SZ; i++) {
        if (p[i][j - 1] == -1) {
          p[i][j] = -1;
        } else {
          p[i][j] = p[p[i][j - 1]][j - 1];
        }
      }
    }
  }
  int query(int a, int b) {
    if (depth[a] > depth[b]) {
      swap(a, b);
    }
    int lift = depth[b] - depth[a];
    for (int j = 31; j >= 0; j--) {
      if (lift & (1 << j)) {
        b = p[b][j];
      }
    }
    for (int j = 31; j >= 0; j--) {
      if (p[a][j] != p[b][j]) {
        a = p[a][j];
        b = p[b][j];
      }
    }
    return (a == b) ? a : p[a][0];
  }
};

namespace output {
  void pr(int x) {
    cout << x;
  }
  void pr(long x) {
    cout << x;
  }
  void pr(ll x) {
    cout << x;
  }
  void pr(unsigned x) {
    cout << x;
  }
  void pr(unsigned long x) {
    cout << x;
  }
  void pr(unsigned long long x) {
    cout << x;
  }
  void pr(float x) {
    cout << x;
  }
  void pr(double x) {
    cout << x;
  }
  void pr(long double x) {
    cout << x;
  }
  void pr(char x) {
    cout << x;
  }
  void pr(const char * x) {
    cout << x;
  }
  void pr(const string & x) {
    cout << x;
  }
  void pr(bool x) {
    pr(x ? "true" : "false");
  }

  template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
  template < class T > void pr(const T & x);

  template < class T, class...Ts > void pr(const T & t,
    const Ts & ...ts) {
    pr(t);
    pr(ts...);
  }
  template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
    pr("{", x.f, ", ", x.s, "}");
  }
  template < class T > void pr(const T & x) {
    pr("{"); // const iterator needed for vector<bool>
    bool fst = 1;
    for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
    pr("}");
  }

  void ps() {
    pr("\n");
  } // print w/ spaces
  template < class T, class...Ts > void ps(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(" ");
    ps(ts...);
  }

  void pc() {
    cout << "]" << endl;
  } // debug w/ commas
  template < class T, class...Ts > void pc(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(", ");
    pc(ts...);
  }
  #define dbg(x...) pr("[", #x, "] = ["), pc(x);
}

#ifdef mikey 
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif

LCA<MX> lca;
vi adj[MX];
multiset<pi> sol[MX];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, q; cin >> n >> m >> q;
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        u--, v--;
        lca.addEdge(u, v);
        adj[u].pb(v), adj[v].pb(u);
    }
    lca.precomp();
    vi a(m);
    auto rem = [&] (int i, int j) {
        int anc = lca.query(a[i], a[j]);
        auto it = sol[anc].find(mp(i, j));
        if (it != sol[anc].end()) sol[anc].erase(it);
    };
    auto ad = [&] (int i, int j) {
        int anc = lca.query(a[i], a[j]);
        sol[anc].insert(mp(i, j));
    };
    for (int i = 0; i < m; i++) cin >> a[i], a[i]--;
    for (int i = 0; i < m - 1; i++) {
        ad(i, i + 1);
        ad(i, i);
    }
    ad(m - 1, m - 1);
    for (int i = 0; i < q; i++) {
        int qt; cin >> qt;
        if (qt == 1) {
            int pos, v; cin >> pos >> v; 
            pos--, v--;
            if (pos) rem(pos - 1, pos);
            if (pos < m - 1) rem(pos, pos + 1);
            rem(pos, pos); 
            a[pos] = v;
            if (pos) ad(pos - 1, pos);
            if (pos < m - 1) ad(pos, pos + 1);
            ad(pos, pos);
        } else {
            int l, r, v; cin >> l >> r >> v;
            l--, r--, v--;
            multiset<pi> &curr = sol[v];
            auto x = curr.lb(mp(l, INT_MIN));
            if (x == curr.end()) {
                cout << -1 << " " << -1 << '\n';
            } else {
                if (x->s <= r) cout << (x->f) + 1 << " " << (x->s) + 1 << '\n';
                else cout << -1 << " " << -1 << '\n';
            }
        }
    }
}

Compilation message

treearray.cpp:163: warning: "dbg" redefined
  163 | #define dbg(x...)
      | 
treearray.cpp:156: note: this is the location of the previous definition
  156 |   #define dbg(x...) pr("[", #x, "] = ["), pc(x);
      |

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 44908 KB n=5
2 Correct 111 ms 45028 KB n=100
3 Correct 114 ms 45036 KB n=100
4 Correct 111 ms 45028 KB n=100
5 Correct 112 ms 45036 KB n=100
6 Correct 116 ms 45060 KB n=100
7 Correct 118 ms 44936 KB n=100
8 Correct 110 ms 45036 KB n=100
9 Correct 109 ms 45036 KB n=100
10 Correct 110 ms 45036 KB n=100
11 Correct 113 ms 45028 KB n=100
12 Correct 111 ms 45028 KB n=100
13 Correct 114 ms 45036 KB n=100
14 Correct 110 ms 45036 KB n=100
15 Correct 112 ms 45036 KB n=100
16 Correct 113 ms 45036 KB n=100
17 Correct 127 ms 45036 KB n=100
18 Correct 115 ms 45036 KB n=100
19 Correct 124 ms 45036 KB n=100
20 Correct 121 ms 45028 KB n=100
21 Correct 116 ms 45036 KB n=100
22 Correct 115 ms 45036 KB n=100
23 Correct 127 ms 45036 KB n=100
24 Correct 115 ms 45036 KB n=100
25 Correct 132 ms 45036 KB n=100
26 Correct 119 ms 44908 KB n=12
27 Correct 122 ms 45028 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 44908 KB n=5
2 Correct 111 ms 45028 KB n=100
3 Correct 114 ms 45036 KB n=100
4 Correct 111 ms 45028 KB n=100
5 Correct 112 ms 45036 KB n=100
6 Correct 116 ms 45060 KB n=100
7 Correct 118 ms 44936 KB n=100
8 Correct 110 ms 45036 KB n=100
9 Correct 109 ms 45036 KB n=100
10 Correct 110 ms 45036 KB n=100
11 Correct 113 ms 45028 KB n=100
12 Correct 111 ms 45028 KB n=100
13 Correct 114 ms 45036 KB n=100
14 Correct 110 ms 45036 KB n=100
15 Correct 112 ms 45036 KB n=100
16 Correct 113 ms 45036 KB n=100
17 Correct 127 ms 45036 KB n=100
18 Correct 115 ms 45036 KB n=100
19 Correct 124 ms 45036 KB n=100
20 Correct 121 ms 45028 KB n=100
21 Correct 116 ms 45036 KB n=100
22 Correct 115 ms 45036 KB n=100
23 Correct 127 ms 45036 KB n=100
24 Correct 115 ms 45036 KB n=100
25 Correct 132 ms 45036 KB n=100
26 Correct 119 ms 44908 KB n=12
27 Correct 122 ms 45028 KB n=100
28 Correct 112 ms 45036 KB n=500
29 Correct 120 ms 45036 KB n=500
30 Correct 113 ms 45068 KB n=500
31 Correct 121 ms 45036 KB n=500
32 Correct 129 ms 45060 KB n=500
33 Correct 123 ms 45060 KB n=500
34 Correct 113 ms 45036 KB n=500
35 Correct 114 ms 45036 KB n=500
36 Correct 110 ms 45036 KB n=500
37 Correct 112 ms 45004 KB n=500
38 Correct 112 ms 45056 KB n=500
39 Correct 117 ms 45040 KB n=500
40 Correct 117 ms 45056 KB n=500
41 Correct 112 ms 45056 KB n=500
42 Correct 113 ms 45036 KB n=500
43 Correct 109 ms 45036 KB n=500
44 Correct 114 ms 45036 KB n=500
45 Correct 114 ms 45164 KB n=500
46 Correct 112 ms 45036 KB n=500
47 Correct 110 ms 45036 KB n=500
48 Correct 113 ms 45036 KB n=500
49 Correct 110 ms 45164 KB n=500
50 Correct 114 ms 45064 KB n=500
51 Correct 111 ms 45064 KB n=500
52 Correct 112 ms 45164 KB n=500
53 Correct 112 ms 45064 KB n=500
54 Correct 113 ms 45036 KB n=500
55 Correct 123 ms 45036 KB n=278
56 Correct 111 ms 45084 KB n=500
57 Correct 111 ms 45036 KB n=500
58 Correct 117 ms 45092 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 44908 KB n=5
2 Correct 111 ms 45028 KB n=100
3 Correct 114 ms 45036 KB n=100
4 Correct 111 ms 45028 KB n=100
5 Correct 112 ms 45036 KB n=100
6 Correct 116 ms 45060 KB n=100
7 Correct 118 ms 44936 KB n=100
8 Correct 110 ms 45036 KB n=100
9 Correct 109 ms 45036 KB n=100
10 Correct 110 ms 45036 KB n=100
11 Correct 113 ms 45028 KB n=100
12 Correct 111 ms 45028 KB n=100
13 Correct 114 ms 45036 KB n=100
14 Correct 110 ms 45036 KB n=100
15 Correct 112 ms 45036 KB n=100
16 Correct 113 ms 45036 KB n=100
17 Correct 127 ms 45036 KB n=100
18 Correct 115 ms 45036 KB n=100
19 Correct 124 ms 45036 KB n=100
20 Correct 121 ms 45028 KB n=100
21 Correct 116 ms 45036 KB n=100
22 Correct 115 ms 45036 KB n=100
23 Correct 127 ms 45036 KB n=100
24 Correct 115 ms 45036 KB n=100
25 Correct 132 ms 45036 KB n=100
26 Correct 119 ms 44908 KB n=12
27 Correct 122 ms 45028 KB n=100
28 Correct 112 ms 45036 KB n=500
29 Correct 120 ms 45036 KB n=500
30 Correct 113 ms 45068 KB n=500
31 Correct 121 ms 45036 KB n=500
32 Correct 129 ms 45060 KB n=500
33 Correct 123 ms 45060 KB n=500
34 Correct 113 ms 45036 KB n=500
35 Correct 114 ms 45036 KB n=500
36 Correct 110 ms 45036 KB n=500
37 Correct 112 ms 45004 KB n=500
38 Correct 112 ms 45056 KB n=500
39 Correct 117 ms 45040 KB n=500
40 Correct 117 ms 45056 KB n=500
41 Correct 112 ms 45056 KB n=500
42 Correct 113 ms 45036 KB n=500
43 Correct 109 ms 45036 KB n=500
44 Correct 114 ms 45036 KB n=500
45 Correct 114 ms 45164 KB n=500
46 Correct 112 ms 45036 KB n=500
47 Correct 110 ms 45036 KB n=500
48 Correct 113 ms 45036 KB n=500
49 Correct 110 ms 45164 KB n=500
50 Correct 114 ms 45064 KB n=500
51 Correct 111 ms 45064 KB n=500
52 Correct 112 ms 45164 KB n=500
53 Correct 112 ms 45064 KB n=500
54 Correct 113 ms 45036 KB n=500
55 Correct 123 ms 45036 KB n=278
56 Correct 111 ms 45084 KB n=500
57 Correct 111 ms 45036 KB n=500
58 Correct 117 ms 45092 KB n=500
59 Correct 115 ms 45292 KB n=2000
60 Correct 114 ms 45420 KB n=2000
61 Correct 113 ms 45420 KB n=2000
62 Correct 124 ms 45292 KB n=2000
63 Correct 119 ms 45292 KB n=2000
64 Correct 114 ms 45292 KB n=2000
65 Correct 117 ms 45292 KB n=2000
66 Correct 115 ms 45420 KB n=2000
67 Correct 116 ms 45292 KB n=2000
68 Correct 115 ms 45420 KB n=2000
69 Correct 114 ms 45292 KB n=2000
70 Correct 110 ms 45292 KB n=2000
71 Correct 114 ms 45324 KB n=2000
72 Correct 109 ms 45292 KB n=2000
73 Correct 113 ms 45292 KB n=2000
74 Correct 111 ms 45292 KB n=1844
75 Correct 110 ms 45292 KB n=2000
76 Correct 111 ms 45292 KB n=2000
77 Correct 110 ms 45292 KB n=2000
78 Correct 111 ms 45292 KB n=2000
79 Correct 108 ms 45420 KB n=2000
80 Correct 109 ms 45420 KB n=2000
81 Correct 110 ms 45332 KB n=2000
82 Correct 111 ms 45420 KB n=2000
83 Correct 111 ms 45420 KB n=2000
84 Correct 110 ms 45292 KB n=2000
85 Correct 110 ms 45420 KB n=2000
86 Correct 110 ms 45292 KB n=2000
87 Correct 109 ms 45292 KB n=2000
88 Correct 111 ms 45420 KB n=2000
89 Correct 109 ms 45420 KB n=2000
90 Correct 108 ms 45420 KB n=2000
91 Correct 110 ms 45292 KB n=2000

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 44908 KB n=5
2 Correct 111 ms 45028 KB n=100
3 Correct 114 ms 45036 KB n=100
4 Correct 111 ms 45028 KB n=100
5 Correct 112 ms 45036 KB n=100
6 Correct 116 ms 45060 KB n=100
7 Correct 118 ms 44936 KB n=100
8 Correct 110 ms 45036 KB n=100
9 Correct 109 ms 45036 KB n=100
10 Correct 110 ms 45036 KB n=100
11 Correct 113 ms 45028 KB n=100
12 Correct 111 ms 45028 KB n=100
13 Correct 114 ms 45036 KB n=100
14 Correct 110 ms 45036 KB n=100
15 Correct 112 ms 45036 KB n=100
16 Correct 113 ms 45036 KB n=100
17 Correct 127 ms 45036 KB n=100
18 Correct 115 ms 45036 KB n=100
19 Correct 124 ms 45036 KB n=100
20 Correct 121 ms 45028 KB n=100
21 Correct 116 ms 45036 KB n=100
22 Correct 115 ms 45036 KB n=100
23 Correct 127 ms 45036 KB n=100
24 Correct 115 ms 45036 KB n=100
25 Correct 132 ms 45036 KB n=100
26 Correct 119 ms 44908 KB n=12
27 Correct 122 ms 45028 KB n=100
28 Correct 112 ms 45036 KB n=500
29 Correct 120 ms 45036 KB n=500
30 Correct 113 ms 45068 KB n=500
31 Correct 121 ms 45036 KB n=500
32 Correct 129 ms 45060 KB n=500
33 Correct 123 ms 45060 KB n=500
34 Correct 113 ms 45036 KB n=500
35 Correct 114 ms 45036 KB n=500
36 Correct 110 ms 45036 KB n=500
37 Correct 112 ms 45004 KB n=500
38 Correct 112 ms 45056 KB n=500
39 Correct 117 ms 45040 KB n=500
40 Correct 117 ms 45056 KB n=500
41 Correct 112 ms 45056 KB n=500
42 Correct 113 ms 45036 KB n=500
43 Correct 109 ms 45036 KB n=500
44 Correct 114 ms 45036 KB n=500
45 Correct 114 ms 45164 KB n=500
46 Correct 112 ms 45036 KB n=500
47 Correct 110 ms 45036 KB n=500
48 Correct 113 ms 45036 KB n=500
49 Correct 110 ms 45164 KB n=500
50 Correct 114 ms 45064 KB n=500
51 Correct 111 ms 45064 KB n=500
52 Correct 112 ms 45164 KB n=500
53 Correct 112 ms 45064 KB n=500
54 Correct 113 ms 45036 KB n=500
55 Correct 123 ms 45036 KB n=278
56 Correct 111 ms 45084 KB n=500
57 Correct 111 ms 45036 KB n=500
58 Correct 117 ms 45092 KB n=500
59 Correct 115 ms 45292 KB n=2000
60 Correct 114 ms 45420 KB n=2000
61 Correct 113 ms 45420 KB n=2000
62 Correct 124 ms 45292 KB n=2000
63 Correct 119 ms 45292 KB n=2000
64 Correct 114 ms 45292 KB n=2000
65 Correct 117 ms 45292 KB n=2000
66 Correct 115 ms 45420 KB n=2000
67 Correct 116 ms 45292 KB n=2000
68 Correct 115 ms 45420 KB n=2000
69 Correct 114 ms 45292 KB n=2000
70 Correct 110 ms 45292 KB n=2000
71 Correct 114 ms 45324 KB n=2000
72 Correct 109 ms 45292 KB n=2000
73 Correct 113 ms 45292 KB n=2000
74 Correct 111 ms 45292 KB n=1844
75 Correct 110 ms 45292 KB n=2000
76 Correct 111 ms 45292 KB n=2000
77 Correct 110 ms 45292 KB n=2000
78 Correct 111 ms 45292 KB n=2000
79 Correct 108 ms 45420 KB n=2000
80 Correct 109 ms 45420 KB n=2000
81 Correct 110 ms 45332 KB n=2000
82 Correct 111 ms 45420 KB n=2000
83 Correct 111 ms 45420 KB n=2000
84 Correct 110 ms 45292 KB n=2000
85 Correct 110 ms 45420 KB n=2000
86 Correct 110 ms 45292 KB n=2000
87 Correct 109 ms 45292 KB n=2000
88 Correct 111 ms 45420 KB n=2000
89 Correct 109 ms 45420 KB n=2000
90 Correct 108 ms 45420 KB n=2000
91 Correct 110 ms 45292 KB n=2000
92 Correct 1090 ms 81300 KB n=200000
93 Correct 1413 ms 92908 KB n=200000
94 Correct 1361 ms 97260 KB n=200000
95 Correct 1088 ms 86908 KB n=200000
96 Correct 1082 ms 86944 KB n=200000
97 Correct 1459 ms 91756 KB n=200000
98 Correct 1081 ms 86996 KB n=200000
99 Correct 1345 ms 86700 KB n=200000
100 Correct 1101 ms 87004 KB n=200000
101 Correct 1352 ms 99180 KB n=200000
102 Correct 701 ms 87916 KB n=200000
103 Correct 707 ms 87916 KB n=200000
104 Correct 719 ms 87788 KB n=200000
105 Correct 711 ms 88172 KB n=200000
106 Correct 698 ms 88044 KB n=200000
107 Correct 710 ms 88172 KB n=200000
108 Correct 1269 ms 86668 KB n=200000
109 Correct 1283 ms 86508 KB n=200000
110 Correct 1288 ms 86568 KB n=200000
111 Correct 1158 ms 86484 KB n=200000
112 Correct 1417 ms 97568 KB n=200000
113 Correct 1514 ms 91668 KB n=200000
114 Correct 1170 ms 86668 KB n=200000
115 Correct 1690 ms 88760 KB n=200000
116 Correct 1073 ms 87124 KB n=200000
117 Correct 1360 ms 98156 KB n=200000
118 Correct 1496 ms 90248 KB n=200000
119 Correct 1029 ms 87124 KB n=200000
120 Correct 1305 ms 97900 KB n=200000
121 Correct 1301 ms 97900 KB n=200000
122 Correct 1304 ms 98296 KB n=200000
123 Correct 731 ms 87916 KB n=200000
124 Correct 404 ms 58988 KB n=25264