| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 338271 | Tosic | UFO (IZhO14_ufo) | C++14 | 240 ms | 145444 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 <bits/stdc++.h>
#define maxn 1000010
using namespace std;
int n, m, r, k, p;
vector<vector<int> > a, c, rv;
//vector<int> rv;
struct segtree
{
vector<int> tree;
vector<int> resIdx;
vector<int> *a;
int n, glR;
segtree(){
}
void init(int sz, vector<int>& tmp){
n = sz;
tree.resize(2*n+10, 0);
a = &tmp;
init(0, 0, n-1);
}
void kidsO(int idx){
tree[idx] = max(tree[idx*2+1], tree[idx*2+2]);
}
void init(int idx, int l, int r){
if(l == r){
tree[idx] = a->at(l);
return;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||