# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31203 | cscandkswon | Horses (IOI15_horses) | C++14 | 803 ms | 41156 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 "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=500005;
const long long MOD=(1e9)+7;
int T[MAXN*3], M[MAXN*3], N, *X, *Y;
set<int, greater<int> > S;
void initTree(int idx, int l, int r){
if(l==r){
T[idx]=Y[l];
return;
}
int m=(l+r)>>1, lidx=idx<<1, ridx=lidx+1;
initTree(lidx, l, m);
initTree(ridx, m+1, r);
T[idx]=max(T[lidx], T[ridx]);
}
void updateTree(int idx, int l, int r, int t){
if(l==r){
T[idx]=Y[t];
return;
}
int m=(l+r)>>1, lidx=idx<<1, ridx=lidx+1;
if(t<=m) updateTree(lidx, l, m, t);
if(t>m) updateTree(ridx, m+1, r, t);
T[idx]=max(T[lidx], T[ridx]);
}
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... |