# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259182 | atoiz | Werewolf (IOI18_werewolf) | C++14 | 976 ms | 100712 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "werewolf.h"
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <vector>
#include <functional>
using namespace std;
struct DSU
{
int N;
vector<int> A;
DSU(int _N = 0): N(_N), A(N, -1) {};
int get(int u) { return (A[u] < 0 ? u : A[u] = get(A[u])); }
void set(int v, int u) { A[get(v)] = u; }
};
struct BIT
{
int N;
vector<int> A;
BIT(int _N = 0): N(_N + 5), A(N, 0) {};
void inc(int i)
{
for (; i < N; i += i & (-i)) ++A[i];
}
# | 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... |