답안 #57086 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57086	2018-07-13T21:57:55 Z	Benq	Art Exhibition (JOI18_art)	C++14	100 / 100	398 ms	224148 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n;
pl v[500005];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    F0R(i,n) cin >> v[i+1].f >> v[i+1].s;
    sort(v+1,v+n+1);
    FOR(i,1,n+1) v[i].s += v[i-1].s;
    ll mx = -INF, ans = 0;
    FORd(i,1,n+1) {
        mx = max(mx,v[i].s-v[i].f);
        ans = max(ans,mx-v[i-1].s+v[i].f);
    }
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	712 KB	Output is correct
5	Correct	3 ms	712 KB	Output is correct
6	Correct	2 ms	736 KB	Output is correct
7	Correct	2 ms	740 KB	Output is correct
8	Correct	4 ms	744 KB	Output is correct
9	Correct	2 ms	748 KB	Output is correct
10	Correct	3 ms	880 KB	Output is correct
11	Correct	2 ms	880 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	712 KB	Output is correct
5	Correct	3 ms	712 KB	Output is correct
6	Correct	2 ms	736 KB	Output is correct
7	Correct	2 ms	740 KB	Output is correct
8	Correct	4 ms	744 KB	Output is correct
9	Correct	2 ms	748 KB	Output is correct
10	Correct	3 ms	880 KB	Output is correct
11	Correct	2 ms	880 KB	Output is correct
12	Correct	2 ms	880 KB	Output is correct
13	Correct	3 ms	880 KB	Output is correct
14	Correct	2 ms	880 KB	Output is correct
15	Correct	2 ms	880 KB	Output is correct
16	Correct	2 ms	880 KB	Output is correct
17	Correct	2 ms	880 KB	Output is correct
18	Correct	3 ms	880 KB	Output is correct
19	Correct	2 ms	1024 KB	Output is correct
20	Correct	3 ms	1024 KB	Output is correct
21	Correct	4 ms	1024 KB	Output is correct
22	Correct	2 ms	1024 KB	Output is correct
23	Correct	2 ms	1024 KB	Output is correct
24	Correct	2 ms	1024 KB	Output is correct
25	Correct	2 ms	1024 KB	Output is correct
26	Correct	2 ms	1024 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	712 KB	Output is correct
5	Correct	3 ms	712 KB	Output is correct
6	Correct	2 ms	736 KB	Output is correct
7	Correct	2 ms	740 KB	Output is correct
8	Correct	4 ms	744 KB	Output is correct
9	Correct	2 ms	748 KB	Output is correct
10	Correct	3 ms	880 KB	Output is correct
11	Correct	2 ms	880 KB	Output is correct
12	Correct	2 ms	880 KB	Output is correct
13	Correct	3 ms	880 KB	Output is correct
14	Correct	2 ms	880 KB	Output is correct
15	Correct	2 ms	880 KB	Output is correct
16	Correct	2 ms	880 KB	Output is correct
17	Correct	2 ms	880 KB	Output is correct
18	Correct	3 ms	880 KB	Output is correct
19	Correct	2 ms	1024 KB	Output is correct
20	Correct	3 ms	1024 KB	Output is correct
21	Correct	4 ms	1024 KB	Output is correct
22	Correct	2 ms	1024 KB	Output is correct
23	Correct	2 ms	1024 KB	Output is correct
24	Correct	2 ms	1024 KB	Output is correct
25	Correct	2 ms	1024 KB	Output is correct
26	Correct	2 ms	1024 KB	Output is correct
27	Correct	5 ms	1092 KB	Output is correct
28	Correct	6 ms	1268 KB	Output is correct
29	Correct	6 ms	1348 KB	Output is correct
30	Correct	5 ms	1520 KB	Output is correct
31	Correct	6 ms	1628 KB	Output is correct
32	Correct	6 ms	1732 KB	Output is correct
33	Correct	5 ms	1860 KB	Output is correct
34	Correct	6 ms	2012 KB	Output is correct
35	Correct	7 ms	2116 KB	Output is correct
36	Correct	6 ms	2276 KB	Output is correct
37	Correct	6 ms	2372 KB	Output is correct
38	Correct	4 ms	2500 KB	Output is correct
39	Correct	4 ms	2628 KB	Output is correct
40	Correct	4 ms	2756 KB	Output is correct
41	Correct	4 ms	2884 KB	Output is correct
42	Correct	5 ms	3008 KB	Output is correct
43	Correct	5 ms	3136 KB	Output is correct
44	Correct	5 ms	3264 KB	Output is correct
45	Correct	7 ms	3392 KB	Output is correct
46	Correct	5 ms	3520 KB	Output is correct
47	Correct	7 ms	3648 KB	Output is correct
48	Correct	6 ms	3776 KB	Output is correct
49	Correct	5 ms	3904 KB	Output is correct
50	Correct	6 ms	4032 KB	Output is correct
51	Correct	4 ms	4160 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	712 KB	Output is correct
5	Correct	3 ms	712 KB	Output is correct
6	Correct	2 ms	736 KB	Output is correct
7	Correct	2 ms	740 KB	Output is correct
8	Correct	4 ms	744 KB	Output is correct
9	Correct	2 ms	748 KB	Output is correct
10	Correct	3 ms	880 KB	Output is correct
11	Correct	2 ms	880 KB	Output is correct
12	Correct	2 ms	880 KB	Output is correct
13	Correct	3 ms	880 KB	Output is correct
14	Correct	2 ms	880 KB	Output is correct
15	Correct	2 ms	880 KB	Output is correct
16	Correct	2 ms	880 KB	Output is correct
17	Correct	2 ms	880 KB	Output is correct
18	Correct	3 ms	880 KB	Output is correct
19	Correct	2 ms	1024 KB	Output is correct
20	Correct	3 ms	1024 KB	Output is correct
21	Correct	4 ms	1024 KB	Output is correct
22	Correct	2 ms	1024 KB	Output is correct
23	Correct	2 ms	1024 KB	Output is correct
24	Correct	2 ms	1024 KB	Output is correct
25	Correct	2 ms	1024 KB	Output is correct
26	Correct	2 ms	1024 KB	Output is correct
27	Correct	5 ms	1092 KB	Output is correct
28	Correct	6 ms	1268 KB	Output is correct
29	Correct	6 ms	1348 KB	Output is correct
30	Correct	5 ms	1520 KB	Output is correct
31	Correct	6 ms	1628 KB	Output is correct
32	Correct	6 ms	1732 KB	Output is correct
33	Correct	5 ms	1860 KB	Output is correct
34	Correct	6 ms	2012 KB	Output is correct
35	Correct	7 ms	2116 KB	Output is correct
36	Correct	6 ms	2276 KB	Output is correct
37	Correct	6 ms	2372 KB	Output is correct
38	Correct	4 ms	2500 KB	Output is correct
39	Correct	4 ms	2628 KB	Output is correct
40	Correct	4 ms	2756 KB	Output is correct
41	Correct	4 ms	2884 KB	Output is correct
42	Correct	5 ms	3008 KB	Output is correct
43	Correct	5 ms	3136 KB	Output is correct
44	Correct	5 ms	3264 KB	Output is correct
45	Correct	7 ms	3392 KB	Output is correct
46	Correct	5 ms	3520 KB	Output is correct
47	Correct	7 ms	3648 KB	Output is correct
48	Correct	6 ms	3776 KB	Output is correct
49	Correct	5 ms	3904 KB	Output is correct
50	Correct	6 ms	4032 KB	Output is correct
51	Correct	4 ms	4160 KB	Output is correct
52	Correct	246 ms	24552 KB	Output is correct
53	Correct	269 ms	37396 KB	Output is correct
54	Correct	242 ms	49920 KB	Output is correct
55	Correct	278 ms	62560 KB	Output is correct
56	Correct	398 ms	75396 KB	Output is correct
57	Correct	287 ms	87948 KB	Output is correct
58	Correct	293 ms	100644 KB	Output is correct
59	Correct	287 ms	113236 KB	Output is correct
60	Correct	299 ms	125976 KB	Output is correct
61	Correct	240 ms	138608 KB	Output is correct
62	Correct	243 ms	151244 KB	Output is correct
63	Correct	269 ms	163856 KB	Output is correct
64	Correct	305 ms	176508 KB	Output is correct
65	Correct	239 ms	188816 KB	Output is correct
66	Correct	249 ms	200840 KB	Output is correct
67	Correct	247 ms	212756 KB	Output is correct
68	Correct	272 ms	224148 KB	Output is correct

답안 #57086

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