# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336572 | dlalswp25 | Werewolf (IOI18_werewolf) | C++14 | 1254 ms | 200064 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 <bits/stdc++.h>
using namespace std;
int N, M, Q;
vector<int> ans;
vector<int> adj[202020];
vector<int> tre[404040];
vector<int> qv[202020];
int st[20][404040];
int mx[20][404040];
int lft[404040];
int rgt[404040];
int pos[202020];
int id;
struct DSU {
set<int> V[202020];
int sz[404040];
int p[404040];
void init(int n, bool isV) {
for(int i = 0; i < n; i++) {
p[i] = i;
if(isV) {
sz[i] = 1;
V[i].insert(pos[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... |