# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434022 | frodakcin | Werewolf (IOI18_werewolf) | C++11 | 4040 ms | 38836 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 <algorithm>
#include <functional>
template<typename T> bool ckmax(T& a, const T& b) {return b>a?a=b,1:0;}
template<typename T> bool ckmin(T& a, const T& b) {return b<a?a=b,1:0;}
const int MN = 2e5+10;
const int MQ = 2e5+10;
int N, M, Q;
std::vector<int> a[MN], ans;
struct ST
{
public:
std::vector<int> v;
int S;
ST(int _S): S(_S), v(_S*4, 0) {}
void build(int n, int l, int r, const std::vector<int>& line)
{
if(r-l>1)
{
int m = l+(r-l)/2;
build(n<<1, l, m, line);
build(n<<1|1, m, r, line);
v[n]=std::min(v[n<<1], v[n<<1|1]);
}
else
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... |