Submission #394762

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
394762	2021-04-27T09:41:03 Z	juggernaut	Art Exhibition (JOI18_art)	C++14	100 / 100	216 ms	21844 KB

#include<bits/stdc++.h>
//#include<bits/extc++.h>
#define fr first
#define sc second
using namespace std;
void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
//using namespace __gnu_pbds;
typedef long long ll;
//template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>void umin(T &a,T b){if(b<a)a=b;}
template<class T>void umax(T &a,T b){if(a<b)a=b;}
#ifdef IOI2021SG
    #define printl(args...)printf(args)
#else
    #define printl(args...)((void)0)
#endif
pair<ll,ll>p[500005];
ll pref[500005];
int n;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%lld%lld",&p[i].fr,&p[i].sc);
    sort(p+1,p+1+n);
    ll mx=0,ans=0;
    for(int i=1;i<=n;i++){
        pref[i]=pref[i-1]+p[i].sc;
        umax(mx,p[i].fr-pref[i-1]);
        umax(ans,pref[i]-p[i].fr+mx);
    }
    printf("%lld",ans);
}

Compilation message

art.cpp: In function 'void usaco(std::string)':
art.cpp:6:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
    6 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:6:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
    6 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp: In function 'int main()':
art.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
art.cpp:22:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   22 |     for(int i=1;i<=n;i++)scanf("%lld%lld",&p[i].fr,&p[i].sc);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	3 ms	508 KB	Output is correct
28	Correct	3 ms	444 KB	Output is correct
29	Correct	3 ms	460 KB	Output is correct
30	Correct	3 ms	448 KB	Output is correct
31	Correct	3 ms	440 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	3 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct
37	Correct	3 ms	444 KB	Output is correct
38	Correct	3 ms	460 KB	Output is correct
39	Correct	3 ms	460 KB	Output is correct
40	Correct	3 ms	460 KB	Output is correct
41	Correct	3 ms	424 KB	Output is correct
42	Correct	3 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	3 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	3 ms	564 KB	Output is correct
47	Correct	3 ms	460 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	460 KB	Output is correct
50	Correct	3 ms	460 KB	Output is correct
51	Correct	3 ms	444 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	3 ms	508 KB	Output is correct
28	Correct	3 ms	444 KB	Output is correct
29	Correct	3 ms	460 KB	Output is correct
30	Correct	3 ms	448 KB	Output is correct
31	Correct	3 ms	440 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	3 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct
37	Correct	3 ms	444 KB	Output is correct
38	Correct	3 ms	460 KB	Output is correct
39	Correct	3 ms	460 KB	Output is correct
40	Correct	3 ms	460 KB	Output is correct
41	Correct	3 ms	424 KB	Output is correct
42	Correct	3 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	3 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	3 ms	564 KB	Output is correct
47	Correct	3 ms	460 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	460 KB	Output is correct
50	Correct	3 ms	460 KB	Output is correct
51	Correct	3 ms	444 KB	Output is correct
52	Correct	213 ms	21720 KB	Output is correct
53	Correct	214 ms	21708 KB	Output is correct
54	Correct	204 ms	21720 KB	Output is correct
55	Correct	212 ms	21704 KB	Output is correct
56	Correct	202 ms	21700 KB	Output is correct
57	Correct	213 ms	21828 KB	Output is correct
58	Correct	207 ms	21700 KB	Output is correct
59	Correct	206 ms	21716 KB	Output is correct
60	Correct	209 ms	21700 KB	Output is correct
61	Correct	216 ms	21672 KB	Output is correct
62	Correct	201 ms	21720 KB	Output is correct
63	Correct	210 ms	21720 KB	Output is correct
64	Correct	208 ms	21828 KB	Output is correct
65	Correct	203 ms	21712 KB	Output is correct
66	Correct	209 ms	21844 KB	Output is correct
67	Correct	211 ms	21708 KB	Output is correct
68	Correct	208 ms	21700 KB	Output is correct

Submission #394762

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0