답안 #551158

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551158	2022-04-19T23:57:50 Z	armashka	Art Exhibition (JOI18_art)	C++17	100 / 100	527 ms	32664 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define nano chrono::steady_clock::now().time_since_epoch().count()
#define uid uniform_int_distribution<int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz() size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 1e6 + 10;
const int M = 1e7 + 5;
const ll inf = 1e15;
ll mod = 1e9 + 7;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); }
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, pr[N], pref[N], sf[N];
pll a[N];

const void solve(/*Armashka*/) {
    cin >> n;
    for (int i = 1; i <= n; ++ i) cin >> a[i].ft >> a[i].sd;
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; ++ i) pr[i] = pr[i - 1] + a[i].sd;
	for (int i = 1; i <= n; ++ i) pref[i] = pr[i] - (a[i].ft - a[1].ft);
	sf[n + 1] = -inf;
	for (int i = n; i >= 1; -- i) sf[i] = max(sf[i + 1], pref[i]);
	
	ll ans = -inf;
	for (int i = 1; i <= n; ++ i) {
		ll val = sf[i] - pr[i - 1] + (a[i].ft - a[1].ft);
		ans = max(ans, val);
	}
	cout << ans;
}

signed main() {
    srand(time(NULL));
//    fast;
    // file("");
    int tt = 1;

    // cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        solve();
    }        
}
// Jelbiretip kok tudy, boys in the hood
// Kim qandai juz, kimde qandai ru

Compilation message

art.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	312 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	312 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	5 ms	632 KB	Output is correct
28	Correct	6 ms	580 KB	Output is correct
29	Correct	6 ms	596 KB	Output is correct
30	Correct	5 ms	596 KB	Output is correct
31	Correct	6 ms	572 KB	Output is correct
32	Correct	6 ms	572 KB	Output is correct
33	Correct	7 ms	596 KB	Output is correct
34	Correct	7 ms	576 KB	Output is correct
35	Correct	6 ms	576 KB	Output is correct
36	Correct	6 ms	596 KB	Output is correct
37	Correct	5 ms	596 KB	Output is correct
38	Correct	5 ms	596 KB	Output is correct
39	Correct	6 ms	596 KB	Output is correct
40	Correct	5 ms	584 KB	Output is correct
41	Correct	6 ms	548 KB	Output is correct
42	Correct	6 ms	580 KB	Output is correct
43	Correct	5 ms	596 KB	Output is correct
44	Correct	6 ms	608 KB	Output is correct
45	Correct	6 ms	596 KB	Output is correct
46	Correct	6 ms	596 KB	Output is correct
47	Correct	6 ms	596 KB	Output is correct
48	Correct	6 ms	580 KB	Output is correct
49	Correct	6 ms	596 KB	Output is correct
50	Correct	5 ms	596 KB	Output is correct
51	Correct	6 ms	596 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	312 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	312 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	5 ms	632 KB	Output is correct
28	Correct	6 ms	580 KB	Output is correct
29	Correct	6 ms	596 KB	Output is correct
30	Correct	5 ms	596 KB	Output is correct
31	Correct	6 ms	572 KB	Output is correct
32	Correct	6 ms	572 KB	Output is correct
33	Correct	7 ms	596 KB	Output is correct
34	Correct	7 ms	576 KB	Output is correct
35	Correct	6 ms	576 KB	Output is correct
36	Correct	6 ms	596 KB	Output is correct
37	Correct	5 ms	596 KB	Output is correct
38	Correct	5 ms	596 KB	Output is correct
39	Correct	6 ms	596 KB	Output is correct
40	Correct	5 ms	584 KB	Output is correct
41	Correct	6 ms	548 KB	Output is correct
42	Correct	6 ms	580 KB	Output is correct
43	Correct	5 ms	596 KB	Output is correct
44	Correct	6 ms	608 KB	Output is correct
45	Correct	6 ms	596 KB	Output is correct
46	Correct	6 ms	596 KB	Output is correct
47	Correct	6 ms	596 KB	Output is correct
48	Correct	6 ms	580 KB	Output is correct
49	Correct	6 ms	596 KB	Output is correct
50	Correct	5 ms	596 KB	Output is correct
51	Correct	6 ms	596 KB	Output is correct
52	Correct	507 ms	32384 KB	Output is correct
53	Correct	502 ms	32508 KB	Output is correct
54	Correct	524 ms	32520 KB	Output is correct
55	Correct	508 ms	32592 KB	Output is correct
56	Correct	495 ms	32500 KB	Output is correct
57	Correct	498 ms	32548 KB	Output is correct
58	Correct	506 ms	32664 KB	Output is correct
59	Correct	519 ms	32448 KB	Output is correct
60	Correct	527 ms	32564 KB	Output is correct
61	Correct	502 ms	32316 KB	Output is correct
62	Correct	503 ms	32440 KB	Output is correct
63	Correct	505 ms	32496 KB	Output is correct
64	Correct	516 ms	32432 KB	Output is correct
65	Correct	492 ms	32588 KB	Output is correct
66	Correct	490 ms	32608 KB	Output is correct
67	Correct	494 ms	32436 KB	Output is correct
68	Correct	497 ms	32456 KB	Output is correct

답안 #551158

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