Submission #263854

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
263854	2020-08-14 02:41:30	atoiz	Synchronization (JOI13_synchronization)	C++14	100 / 100	161 ms	16888 KiB

synchronization

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
// https://oj.uz/submission/151967
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 100007;
int par[MAXN], ch[MAXN][2];
bool isroot(int u) { return (u != ch[par[u]][0] && u != ch[par[u]][1]); }
bool dir(int u) { return (u == ch[par[u]][1]); }
void rotate(int u) 
{
  int p = par[u], g = par[p], d = dir(u);
  if (!isroot(p)) { ch[g][dir(p)] = u; } par[u] = g;
  par[ch[p][d] = ch[u][!d]] = p, par[ch[u][!d] = p] = u;
}
void splay(int u) { for (; !isroot(u); rotate(u)) if (!isroot(par[u])) rotate(dir(u) == dir(par[u]) ? par[u] : u); }
void access(int u) { for (int v = 0; u; v = u, u = par[v]) splay(u), ch[u][1] = v; }
int get(int u)
{
  access(u), splay(u);
  while (ch[u][0]) u = ch[u][0];
  splay(u);
  return u;
}
int N, M, Q, last[MAXN], ans[MAXN], U[MAXN], V[MAXN], prv[MAXN];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 10 / 10
• Subtask 4: 20 / 20
• Subtask 5: 40 / 40