# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155901 | imyujin | Werewolf (IOI18_werewolf) | C++17 | 881 ms | 94620 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;
typedef pair<int, int> pii;
#define eb emplace_back
#define all(v) ((v).begin()),((v).end())
#define fi first
#define se second
#define rb(x) ((x)&(-(x)))
const int MAXN = 200010;
const int MX = 1 << 18;
int N;
struct SEG {
int seg[2 * MX];
void mkseg(int idx, int l, int r, vector<int> &e) {
if(l == r) seg[idx] = e[l];
else {
int m = (l + r) / 2;
mkseg(idx * 2, l, m, e);
mkseg(idx * 2 + 1, m + 1, r, e);
seg[idx] = min(seg[idx * 2], seg[idx * 2 + 1]);
}
}
void init(vector<int> &e) { mkseg(1, 0, e.size() - 1, e); }
# | 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... |