답안 #53078 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53078	2018-06-28T05:01:09 Z	tncks0121	Pinball (JOI14_pinball)	C++17	100 / 100	242 ms	27772 KB

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);
}

Compilation message

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.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	12884 KB	Output is correct
2	Correct	11 ms	13012 KB	Output is correct
3	Correct	13 ms	13108 KB	Output is correct
4	Correct	11 ms	13108 KB	Output is correct
5	Correct	11 ms	13108 KB	Output is correct
6	Correct	11 ms	13184 KB	Output is correct
7	Correct	12 ms	13184 KB	Output is correct
8	Correct	12 ms	13184 KB	Output is correct

Subtask #2
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	12884 KB	Output is correct
2	Correct	11 ms	13012 KB	Output is correct
3	Correct	13 ms	13108 KB	Output is correct
4	Correct	11 ms	13108 KB	Output is correct
5	Correct	11 ms	13108 KB	Output is correct
6	Correct	11 ms	13184 KB	Output is correct
7	Correct	12 ms	13184 KB	Output is correct
8	Correct	12 ms	13184 KB	Output is correct
9	Correct	12 ms	13184 KB	Output is correct
10	Correct	11 ms	13184 KB	Output is correct
11	Correct	11 ms	13184 KB	Output is correct
12	Correct	12 ms	13184 KB	Output is correct
13	Correct	11 ms	13184 KB	Output is correct
14	Correct	11 ms	13236 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	12884 KB	Output is correct
2	Correct	11 ms	13012 KB	Output is correct
3	Correct	13 ms	13108 KB	Output is correct
4	Correct	11 ms	13108 KB	Output is correct
5	Correct	11 ms	13108 KB	Output is correct
6	Correct	11 ms	13184 KB	Output is correct
7	Correct	12 ms	13184 KB	Output is correct
8	Correct	12 ms	13184 KB	Output is correct
9	Correct	12 ms	13184 KB	Output is correct
10	Correct	11 ms	13184 KB	Output is correct
11	Correct	11 ms	13184 KB	Output is correct
12	Correct	12 ms	13184 KB	Output is correct
13	Correct	11 ms	13184 KB	Output is correct
14	Correct	11 ms	13236 KB	Output is correct
15	Correct	12 ms	13236 KB	Output is correct
16	Correct	12 ms	13284 KB	Output is correct
17	Correct	12 ms	13284 KB	Output is correct
18	Correct	12 ms	13284 KB	Output is correct
19	Correct	12 ms	13284 KB	Output is correct
20	Correct	16 ms	13284 KB	Output is correct
21	Correct	11 ms	13284 KB	Output is correct
22	Correct	12 ms	13284 KB	Output is correct
23	Correct	15 ms	13284 KB	Output is correct
24	Correct	12 ms	13284 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	12884 KB	Output is correct
2	Correct	11 ms	13012 KB	Output is correct
3	Correct	13 ms	13108 KB	Output is correct
4	Correct	11 ms	13108 KB	Output is correct
5	Correct	11 ms	13108 KB	Output is correct
6	Correct	11 ms	13184 KB	Output is correct
7	Correct	12 ms	13184 KB	Output is correct
8	Correct	12 ms	13184 KB	Output is correct
9	Correct	12 ms	13184 KB	Output is correct
10	Correct	11 ms	13184 KB	Output is correct
11	Correct	11 ms	13184 KB	Output is correct
12	Correct	12 ms	13184 KB	Output is correct
13	Correct	11 ms	13184 KB	Output is correct
14	Correct	11 ms	13236 KB	Output is correct
15	Correct	12 ms	13236 KB	Output is correct
16	Correct	12 ms	13284 KB	Output is correct
17	Correct	12 ms	13284 KB	Output is correct
18	Correct	12 ms	13284 KB	Output is correct
19	Correct	12 ms	13284 KB	Output is correct
20	Correct	16 ms	13284 KB	Output is correct
21	Correct	11 ms	13284 KB	Output is correct
22	Correct	12 ms	13284 KB	Output is correct
23	Correct	15 ms	13284 KB	Output is correct
24	Correct	12 ms	13284 KB	Output is correct
25	Correct	26 ms	13548 KB	Output is correct
26	Correct	51 ms	13924 KB	Output is correct
27	Correct	138 ms	15112 KB	Output is correct
28	Correct	144 ms	15924 KB	Output is correct
29	Correct	99 ms	15924 KB	Output is correct
30	Correct	171 ms	15980 KB	Output is correct
31	Correct	207 ms	16040 KB	Output is correct
32	Correct	209 ms	16040 KB	Output is correct
33	Correct	35 ms	16040 KB	Output is correct
34	Correct	101 ms	16040 KB	Output is correct
35	Correct	183 ms	16040 KB	Output is correct
36	Correct	242 ms	19928 KB	Output is correct
37	Correct	221 ms	23704 KB	Output is correct
38	Correct	207 ms	27772 KB	Output is correct

답안 #53078

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 18.0 / 18.0

Subtask #3 22.0 / 22.0

Subtask #4 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
18.0 / 18.0

Subtask #3
22.0 / 22.0

Subtask #4
49.0 / 49.0