Submission #699905

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
699905	2023-02-18T08:38:17 Z	Alihan_8	Art Exhibition (JOI18_art)	C++17	100 / 100	195 ms	20816 KB

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <pair<int,int>> p(n);
    for ( auto &[l, r]: p ) cin >> l >> r;
    sort(all(p));
    vector <int> pref(n+1);
    for ( int i = 1; i <= n; i++ ){
        auto [l, r] = p[i-1];
        pref[i] = pref[i-1]+r;
    }
    priority_queue <int> q;
    int Mx = 0;
    for ( int i = 1; i <= n; i++ ){
        q.push(-pref[i-1]+p[i-1].first);
        Mx = max(Mx, q.top()-p[i-1].first+pref[i]);
    }
    cout << Mx;

	cout << '\n';
}

Compilation message

art.cpp: In function 'void IO(std::string)':
art.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	316 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	320 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	316 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	328 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	316 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	320 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	316 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	328 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	596 KB	Output is correct
28	Correct	2 ms	596 KB	Output is correct
29	Correct	2 ms	596 KB	Output is correct
30	Correct	2 ms	584 KB	Output is correct
31	Correct	3 ms	584 KB	Output is correct
32	Correct	2 ms	596 KB	Output is correct
33	Correct	2 ms	640 KB	Output is correct
34	Correct	2 ms	588 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct
36	Correct	2 ms	656 KB	Output is correct
37	Correct	2 ms	584 KB	Output is correct
38	Correct	2 ms	656 KB	Output is correct
39	Correct	3 ms	652 KB	Output is correct
40	Correct	2 ms	596 KB	Output is correct
41	Correct	2 ms	636 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	3 ms	696 KB	Output is correct
44	Correct	3 ms	596 KB	Output is correct
45	Correct	2 ms	652 KB	Output is correct
46	Correct	2 ms	596 KB	Output is correct
47	Correct	2 ms	596 KB	Output is correct
48	Correct	2 ms	596 KB	Output is correct
49	Correct	2 ms	596 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	316 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	320 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	316 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	328 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	596 KB	Output is correct
28	Correct	2 ms	596 KB	Output is correct
29	Correct	2 ms	596 KB	Output is correct
30	Correct	2 ms	584 KB	Output is correct
31	Correct	3 ms	584 KB	Output is correct
32	Correct	2 ms	596 KB	Output is correct
33	Correct	2 ms	640 KB	Output is correct
34	Correct	2 ms	588 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct
36	Correct	2 ms	656 KB	Output is correct
37	Correct	2 ms	584 KB	Output is correct
38	Correct	2 ms	656 KB	Output is correct
39	Correct	3 ms	652 KB	Output is correct
40	Correct	2 ms	596 KB	Output is correct
41	Correct	2 ms	636 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	3 ms	696 KB	Output is correct
44	Correct	3 ms	596 KB	Output is correct
45	Correct	2 ms	652 KB	Output is correct
46	Correct	2 ms	596 KB	Output is correct
47	Correct	2 ms	596 KB	Output is correct
48	Correct	2 ms	596 KB	Output is correct
49	Correct	2 ms	596 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	190 ms	20816 KB	Output is correct
53	Correct	195 ms	19404 KB	Output is correct
54	Correct	189 ms	19528 KB	Output is correct
55	Correct	179 ms	19524 KB	Output is correct
56	Correct	179 ms	19488 KB	Output is correct
57	Correct	177 ms	19396 KB	Output is correct
58	Correct	175 ms	19676 KB	Output is correct
59	Correct	169 ms	19412 KB	Output is correct
60	Correct	171 ms	19488 KB	Output is correct
61	Correct	168 ms	19404 KB	Output is correct
62	Correct	170 ms	19512 KB	Output is correct
63	Correct	175 ms	19432 KB	Output is correct
64	Correct	175 ms	19484 KB	Output is correct
65	Correct	178 ms	19420 KB	Output is correct
66	Correct	175 ms	19476 KB	Output is correct
67	Correct	174 ms	20420 KB	Output is correct
68	Correct	181 ms	19568 KB	Output is correct

Submission #699905

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