Submission #650808

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
650808	2022-10-15 12:05:02	jasen_penchev	ČVENK (COI15_cvenk)	C++14	100 / 100	605 ms	2952 KiB

cvenk

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <utility>
#include <random>
#define endl '\n'
#define fi first
#define se second
using namespace std;
mt19937 rg(4209008);
const int MAXN = 100000;
const int LOG = 34;
int n;
pair<int, int> p[MAXN + 5];
pair<int, int> kth_ancestor(int x, int y, long long k)
{
    if (k == 0) return make_pair(x, y);
    if (x == 0) return make_pair(x, y - k);
    if (y == 0) return make_pair(x - k, y);
    int bx = (x & (-x)), by = (y & (-y));
    if (bx < by) return kth_ancestor(x - min(1ll * bx, k), y, k - min(1ll * bx, k));
    else return kth_ancestor(x, y - min(1ll * by, k), k - min(1ll * by, k));
}
long long depth(pair<int, int> x)
{
    return (1ll * x.fi + 1ll * x.se);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 40 / 40