# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577766 | vanic | Event Hopping (BOI22_events) | C++14 | 1587 ms | 41760 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 <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
using namespace std;
const int maxn=1e5+5;
vector < int > svi;
void query(int l, int d){
for(l+=maxn, d+=maxn; l<d; l>>=1, d>>=1){
if(l&1){
svi.push_back(l++);
}
if(d&1){
svi.push_back(--d);
}
}
/* if(L>=l && D<=d){
svi.push_back(x);
return;
}
if((L+D)/2>=l){
query(L, (L+D)/2, x*2, l, d);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |