제출 #121495

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
121495	2019-06-26 14:40:53	TadijaSebez	늑대인간 (IOI18_werewolf)	C++11	100 / 100	1377 ms	117480 KiB

werewolf

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 "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
const int N=200050;
const int L=19;
struct DSU
{
  int p[N];
  void init(){ for(int i=0;i<N;i++) p[i]=i;}
  DSU(){ init();}
  int Find(int x){ return p[x]==x?x:p[x]=Find(p[x]);}
  void Union(int x, int y){ p[Find(x)]=Find(y);}
} DS;
struct BIT
{
  int sum[N];
  void init(){ for(int i=0;i<N;i++) sum[i]=0;}
  BIT(){ init();}
  void Add(int i, int f){ for(;i<N;i+=i&-i) sum[i]+=f;}
  int Get(int i){ int ret=0;for(;i;i-=i&-i) ret+=sum[i];return ret;}
  int Get(int l, int r){ return Get(r)-Get(l-1);}
} BT;
struct Tree
{
  vector<int> E[N];
  int par[N][L],dep[N],root,nod[N],lid[N],rid[N],tid;
  Tree(){}
  void AddEdge(int u, int v){ E[u].pb(v);E[v].pb(u);}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 34 / 34
• Subtask 4: 51 / 51