# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138675 | ckodser | Werewolf (IOI18_werewolf) | C++14 | 979 ms | 143604 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>
#define ll int
#define pb push_back
#define ld long double
#define F first
#define S second
#define mp make_pair
#define pii pair<ll,ll>
using namespace :: std;
const ll maxn=5e5+500;
const ll inf=1e9+900;
ll seg[maxn*4];
ll findMin(ll L,ll R,ll node,ll l,ll r){
if(l<=L && R<=r){
return seg[node];
}
if(r<=L || R<=l)return inf;
ll mid=(L+R)/2;
return min(findMin(L,mid,2*node,l,r),findMin(mid,R,2*node+1,l,r));
}
void update(ll L,ll R,ll node,ll x,ll v){
if(L+1==R){
seg[node]=v;
return;
}
ll mid=(L+R)/2;
# | 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... |