제출 #861044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
861044		guagua0407	Two Antennas (JOI19_antennas)	C++17	24 / 100	3026 ms	114516 KiB

antennas

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=200005;
multiset<ll> segtree[mxn*4];
ll h[mxn],a[mxn],b[mxn];
int n,q;
ll val;

void update(int pos,int l=1,int r=n,int v=1){
    if(l>r) return;
    segtree[v].insert(h[pos]);
    if(l==r) return;
    int mid=(l+r)/2;
    if(pos<=mid) update(pos,l,mid,v*2);
    else update(pos,mid+1,r,v*2+1);
}

void erase(int pos,int l=1,int r=n,int v=1){
    if(l>r) return;
    segtree[v].erase(segtree[v].find(h[pos]));
    if(l==r) return;
    int mid=(l+r)/2;
    if(pos<=mid) erase(pos,l,mid,v*2);
    else erase(pos,mid+1,r,v*2+1);
}

ll mnquery(int tl,int tr,int l=1,int r=n,int v=1){
    if(r<tl or tr<l){
        return 2e9;
    }
    if(tl<=l and r<=tr){
        return (segtree[v].empty()?(2e9):*segtree[v].begin());
    }
    int mid=(l+r)/2;
    return min(mnquery(tl,min(mid,tr),l,mid,v*2),mnquery(max(tl,mid+1),tr,mid+1,r,v*2+1));
}

ll mxquery(int tl,int tr,int l=1,int r=n,int v=1){
    if(r<tl or tr<l){
        return -2e9;
    }
    if(tl<=l and r<=tr){
        return (segtree[v].empty()?(-2e9):*segtree[v].rbegin());
    }
    int mid=(l+r)/2;
    return max(mxquery(tl,min(mid,tr),l,mid,v*2),mxquery(max(tl,mid+1),tr,mid+1,r,v*2+1));
}


int main() {_
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>h[i]>>a[i]>>b[i];
    }
    cin>>q;
    for(int i=0;i<q;i++){
        for(int j=0;j<mxn*4;j++){
            segtree[j].clear();
        }
        ll l,r;
        cin>>l>>r;
        vector<int> st[mxn],en[mxn];
        for(int j=l;j<=r;j++){
            if(j-b[j]+1>r or j-a[j]+1<l) continue;
            //cout<<max(l,j-b[j])<<' '<<min(r,j-a[j])+1<<'\n';
            st[max(l,j-b[j])].push_back(j);
            en[min(r,j-a[j])+1].push_back(j);
        }
        ll ans=-1;
        for(int j=l;j<=r;j++){
            for(auto v:st[j]){
                update(v);
            }
            for(auto v:en[j]){
                erase(v);
            }
            ll L=j+a[j];
            ll R=j+b[j];
            if(L>r or R<l) continue;
            L=max(L,l);
            R=min(R,r);
            val=h[j];
            if(mnquery(L,R)!=2e9) ans=max(ans,abs(h[j]-mnquery(L,R)));
            if(mxquery(L,R)!=-2e9) ans=max(ans,abs(h[j]-mxquery(L,R)));
        }
        cout<<(ans>1e9?-1:ans)<<'\n';
    }
    return 0;
}
//maybe its multiset not set

컴파일 시 표준 에러 (stderr) 메시지

antennas.cpp: In function 'void setIO(std::string)':
antennas.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 0 / 11
• Subtask 3: 22 / 22
• Subtask 4: 0 / 65