# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299677 | TMJN | Werewolf (IOI18_werewolf) | C++17 | 564 ms | 29932 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;
vector<int>V[200000];
vector<int>A;
int treemin[1<<19],treemax[1<<19],B[200000];
int calcmin(int l,int r){
int a=0xE869120;
l+=(1<<18);
r+=(1<<18);
while(l<=r){
a=min({a,treemin[l],treemin[r]});
l=(l+1)/2;
r=(r-1)/2;
}
return a;
}
int calcmax(int l,int r){
int a=0;
l+=(1<<18);
r+=(1<<18);
while(l<=r){
a=max({a,treemax[l],treemax[r]});
l=(l+1)/2;
r=(r-1)/2;
}
return a;
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... |