제출 #53078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53078		tncks0121	Pinball (JOI14_pinball)	C++17	100 / 100	242 ms	27772 KiB

pinball

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz=4e5;
const ll mnv=1e18;
ll s1[sz*2],s2[sz*2];
    int a[sz],b[sz],c[sz],d[sz];
void update(ll *a,int x,ll v)
{
  x+=sz;
  a[x]=min(a[x],v);
    for(;x>1;x>>=1) a[x>>1]=min(a[x],a[x^1]);
}
ll query(ll *a,int s,int e)
{
    ll ans=mnv;
    for(s+=sz,e+=sz;s<e;s>>=1,e>>=1)
    {
        if(s&1) ans=min(ans,a[s++]);
        if(e&1) ans=min(ans,a[--e]);
    }
    return ans;
}
int main()
{
    int N,M;
    scanf("%d %d",&N,&M);
    for(int i=0;i<N;i++) scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
    vector<int> e;
    e.push_back(1),e.push_back(M);
    for(int i=0;i<N;i++) e.push_back(a[i]),e.push_back(b[i]),e.push_back(c[i]);
    sort(e.begin(),e.end());
    vector<int>::iterator it;
    it=unique(e.begin(),e.end());
    e.resize(distance(e.begin(),it));
    for(int i=0;i<N;i++) a[i]=lower_bound(e.begin(),e.end(),a[i])-e.begin(),b[i]=lower_bound(e.begin(),e.end(),b[i])-e.begin(),c[i]=lower_bound(e.begin(),e.end(),c[i])-e.begin();
    for(int i=0;i<sz*2;i++) s1[i]=s2[i]=mnv;
    ll ans=mnv;
    int cnt=e.size();
    update(s1,0,0),update(s2,cnt-1,0);
    for(int i=0;i<N;i++)
    {
        ll o1=query(s1,a[i],b[i]+1)+d[i];
        update(s1,c[i],o1);
        ll o2=query(s2,a[i],b[i]+1)+d[i];
        update(s2,c[i],o2);
        ans=min(ans,o1+o2-d[i]);
    }
    return !printf("%lld",ans==mnv ? -1 : ans);
}

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

pinball.cpp: In function 'int main()':
pinball.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
pinball.cpp:28:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<N;i++) scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 49 / 49