# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827466 | PagodePaiva | Fancy Fence (CEOI20_fancyfence) | C++17 | 0 ms | 0 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 pii pair <int, int>
#define fr first
#define sc second
#define N 100010
#define inf 1e18
#define int long long
using namespace std;
int n;
int h[N], w[N];
int pref[N];
const int mod = 1e9+7;
struct Segtree{
pair <int,int> tree[4*N];
pair <int,int> join(pii a, pii b){
if(a.fr < b.fr) return a;
if(a.fr > b.fr) return b;
if(a.sc < b.sc) return a;
return b;
}
void build(int l, int r, int node){
if(l == r){
tree[node] = {h[l], l};
return;
}