# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1163313 | AlgorithmWarrior | Werewolf (IOI18_werewolf) | C++20 | 427 ms | 589824 KiB |
#include <bits/stdc++.h>
#include "werewolf.h"
using namespace std;
int const MAX=4e5+5;
vector<int>sons[MAX];
set<int>nodes[MAX];
int n;
vector<int>qL[MAX],qR[MAX];
vector<int>G[MAX];
int nod_inter[MAX];
int st[MAX],dr[MAX];
struct DSU{
int tata[MAX];
int id;
void init(){
int i;
for(i=0;i<n;++i)
tata[i]=-1;
id=n-1;
}
int root(int nod){
if(tata[nod]==-1)
return nod;
return tata[nod]=root(tata[nod]);
}
void uneste1(int u,int v){
u=root(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... |