# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338296 | Tosic | UFO (IZhO14_ufo) | C++14 | 291 ms | 140800 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, rv;
vector<vector<long long> > c;
//vector<int> rv;
struct segtree
{
vector<int> tree;
vector<int> resIdx;
bool isC;
int rowCol;
int n, glR;
segtree(){
}
void init(int sz, int rowCol, bool isC){
n = sz;
tree.resize(4*n+10, 0);
this->isC = isC;
this->rowCol = rowCol;
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){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |