# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114734 | WhipppedCream | Werewolf (IOI18_werewolf) | C++17 | 1635 ms | 199600 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 <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<int> vi;
const int maxn = 2e5+5;
struct dsu
{
vector<int> par;
dsu(int n = 0)
{
par.resize(n);
for(int i = 0; i< n; i++) par[i] = i;
}
int findset(int x)
{
if(x == par[x]) return x;
return par[x] = findset(par[x]);
}
};
dsu hum, wolf;
Compilation message (stderr)
# | 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... |