| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 16186 | jihoon | K blocks (IZhO14_blocks) | C++98 | 0 ms | 109120 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<cstdio>
#include<vector>
#include<algorithm>
#define base 131072
using namespace std;
vector< pair<int,int> > st;
int stp=0;
int idxtree[105][262144]={0};
int su[100001];
int n,k;
int ans;
int getmn(int ss,int ee,int tm){
int res=2100000000;
ss+=base;ee+=base;
while(1){
if(ss%2){
if(idxtree[tm][ss]>0) res=min(res,idxtree[tm][ss]);
ss++;
}
if(ee%2==0){
if(idxtree[tm][ee]>0) res=min(res,idxtree[tm][ee]);
ee--;
}
if(ss>ee) break;
ss/=2;ee/=2;
}
return res;
}
| # | 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... | ||||