답안 #666259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
666259	2022-11-27T22:16:22 Z	Bogdan1110	Art Exhibition (JOI18_art)	C++14	100 / 100	197 ms	24908 KB

#include <bits/stdc++.h>
#define FAST {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define FILES {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
#define ll long long
#define ull unsigned long long
#define pqueue priority_queue
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(a) (a).begin(), (a).end()
#define mp make_pair 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element

const double eps = 0.00000001;
const int NMAX = 2000010;
const ll inf = LLONG_MAX/3;
const ll modi = 998244353;

void solve() {
    int n;
    cin >> n;
    vector<pll>v(n);
    vector<ll>vv(n);
    for (int i = 0 ; i < n ; i++ ) {
        cin >> v[i].fi >> v[i].se;
    }

    sort(all(v));
    for (int i = 0 ; i < n ; i++ )
        vv[i] = v[i].se;

    for (int i = 1 ; i < n ; i++ ) {
        v[i].se += v[i-1].se;
    }

    ll res = LLONG_MIN;
    ll minn = inf;
    ll sum = 0;
    for (int i = 0 ; i < n ; i++ ) {
        minn = min(minn, sum - v[i].fi);
        sum += vv[i];
        res = max(res, v[i].se - v[i].fi - minn);
        //cout << res << endl;
    }

    cout << res << endl;


}

int main () { 
    FAST
    
    int t=1;

    /*
    cin >> t;
    //*/

    int i = 1;
    while(t--) {
        //cout << "Case #" << i++ << ": " ;
        solve();
    }
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:71:9: warning: unused variable 'i' [-Wunused-variable]
   71 |     int i = 1;
      |         ^

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	552 KB	Output is correct
30	Correct	3 ms	468 KB	Output is correct
31	Correct	2 ms	552 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	464 KB	Output is correct
37	Correct	2 ms	568 KB	Output is correct
38	Correct	2 ms	456 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	468 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	548 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	3 ms	468 KB	Output is correct
49	Correct	2 ms	560 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	456 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	552 KB	Output is correct
30	Correct	3 ms	468 KB	Output is correct
31	Correct	2 ms	552 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	464 KB	Output is correct
37	Correct	2 ms	568 KB	Output is correct
38	Correct	2 ms	456 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	468 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	548 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	3 ms	468 KB	Output is correct
49	Correct	2 ms	560 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	456 KB	Output is correct
52	Correct	197 ms	24612 KB	Output is correct
53	Correct	169 ms	24728 KB	Output is correct
54	Correct	170 ms	24736 KB	Output is correct
55	Correct	177 ms	24908 KB	Output is correct
56	Correct	177 ms	24736 KB	Output is correct
57	Correct	176 ms	24740 KB	Output is correct
58	Correct	176 ms	24728 KB	Output is correct
59	Correct	193 ms	24732 KB	Output is correct
60	Correct	173 ms	24728 KB	Output is correct
61	Correct	165 ms	24588 KB	Output is correct
62	Correct	167 ms	24652 KB	Output is correct
63	Correct	171 ms	24732 KB	Output is correct
64	Correct	167 ms	24716 KB	Output is correct
65	Correct	172 ms	24652 KB	Output is correct
66	Correct	169 ms	24652 KB	Output is correct
67	Correct	178 ms	24668 KB	Output is correct
68	Correct	172 ms	24544 KB	Output is correct

답안 #666259

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