제출 #1161967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161967		guagua0407	Tower (JOI24_tower)	C++20	0 / 100	16 ms	840 KiB

Main

//#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);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

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

const ll inf=(ll)1e18;

int main() {_
    int n,q;
    cin>>n>>q;
    ll d,a,b;
    cin>>d>>a>>b;
    vector<ll> L(n+1),R(n+1);
    L[0]=-1;
    R[0]=-1;
    for(int i=1;i<=n;i++){
        cin>>L[i]>>R[i];
    }
    auto in=[&](ll x){
        int pos=lower_bound(all(R),x)-R.begin();
        if(pos<=n and L[pos]<=x) return false;
        return true;
    };
    bool one=false;
    if(a*d<=b) one=true;
    auto solve1=[&](){
        vector<ll> pos(n+1);
        pos[0]=0;
        vector<ll> sum(n+1);
        ll bad=inf;
        for(int i=0;i<n;i++){
            if((R[i+1]-L[i+1]+2)>d){
                bad=L[i+1];
                break;
            }
            if(i<n-1 and pos[i]+d>=L[i+2]){
                bad=L[i+1];
                break;
            }
            ll r=max(R[i+1]+1-d,pos[i]);
            sum[i+1]=sum[i];
            sum[i+1]+=a*(r-pos[i]);
            sum[i+1]+=b;
            pos[i+1]=r+d;
        }
        for(int i=0;i<q;i++){
            ll x;
            cin>>x;
            if(in(x) or x>=bad){
                cout<<-1<<'\n';
                continue;
            }
            int id=upper_bound(all(L),x)-L.begin()-1;
            if(x<pos[id]){
                cout<<-1<<'\n';
                continue;
            }
            ll ans=sum[id]+a*(x-pos[id]);
            cout<<ans<<'\n';
        }
    };
    auto solve2=[&](){
        vector<ll> pos(n+1);
        pos[0]=0;
        vector<ll> sum(n+1);
        ll bad=inf;
        for(int i=0;i<n;i++){
            if((R[i+1]-L[i+1]+2)>d){
                bad=L[i+1];
                break;
            }
            if(i<n-1 and pos[i]+d>=L[i+2]){
                bad=L[i+1];
                break;
            }
            ll r=max(R[i+1]+1-d,pos[i]);
            sum[i+1]=sum[i];
            sum[i+1]+=a*(r-pos[i]);
            sum[i+1]+=b;
            pos[i+1]=r+d;
        }
        for(int i=0;i<q;i++){
            ll x;
            cin>>x;
            if(in(x) or x>=bad){
                cout<<-1<<'\n';
                continue;
            }
            int id=upper_bound(all(L),x)-L.begin()-1;
            if(x<pos[id]){
                cout<<-1<<'\n';
                continue;
            }
            ll ans=sum[id]+a*(x-pos[id]);
            cout<<ans<<'\n';
        }
    };
    if(one) solve1();
    else solve2();
    return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 38
• Subtask 3: 0 / 25
• Subtask 4: 0 / 32