# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171191 | mnbvcxz123 | Werewolf (IOI18_werewolf) | C++20 | 615 ms | 85008 KiB |
#include<bits/stdc++.h>
#include"werewolf.h"
using namespace std;
constexpr int N=2e5+5;
vector<int>sons[N<<1];
set<int>nodes[N];
int n;
vector<int>ql[N],qr[N];
vector<int>g[N];
int nod_inter[N];
int st[N<<1],en[N<<1];
struct DSU{
int par[N<<1];
int id=0;
void init(){
for(int i=0;i<2*n;++i)par[i]=i;
id=n-1;
}
int root(int x){
if(par[x]==x)return x;
return par[x]=root(par[x]);
}
void unite1(int u, int v){
u=root(u);
v=root(v);
if(u==v)return;
++id;
sons[id].push_back(u);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |