# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14355 | gs14004 | 전선 연결하기 (GA9_wire) | C++14 | 504 ms | 65536 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 <utility>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
int n,a[600005];
int lp[300005], rp[300005];
struct rmaxq{
int lim;
pi tree[2100000];
void init(int n){
for(lim = 1; lim <= n; lim <<= 1);
}
void add(int x, pi v){
x += lim;
tree[x] = v;
while(x > 1){
x >>= 1;
tree[x] = max(tree[2*x],tree[2*x+1]);
}
}
pi q(int s, int e){
s += lim;
e += lim;
pi r(0,0);
while(s < e){
if(s%2 == 1) r = max(r,tree[s++]);
# | 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... |