제출 #897311

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
8973112024-01-02 21:40:42ttamxTwo Antennas (JOI19_antennas)C++14
100 / 100
505 ms45196 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
const int K=1<<19;
const int INF=1e9+7;
int n,q;
int h[N],a[N],b[N];
int ql[N],qr[N],ans[N];
vector<int> qrs[N],add[N],del[N];
struct Segtree{
struct Node{
int mx,mn,ans;
Node():mx(-INF),mn(INF),ans(-1){}
Node(int h):mx(h),mn(h),ans(-1){}
friend Node operator+(const Node &lhs,const Node &rhs){
Node res;
res.mx=max(lhs.mx,rhs.mx);
res.mn=min(lhs.mn,rhs.mn);
res.ans=max(lhs.ans,rhs.ans);
return res;
}
}t[K];
struct Tag{
int mx,mn;
Tag():mx(-INF),mn(INF){}
Tag(int h):mx(h),mn(h){}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...