답안 #1049775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049775	2024-08-09T04:54:09 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	296 ms	16076 KB

#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <time.h>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <bits/stdc++.h>

#define speed ios_base::sync_with_stdio(0), cin.tie(0)
#define TxtIO freopen("points.in","r",stdin); freopen("points.out","w",stdout);
using namespace std;
const int mod = 998244353;
#define ll long long
const int N=2e5+5;

//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll binpow (ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)
			res = res * a;
		a = a * a;
		n >>= 1;
	}
	return res;
}




void fcn(){
	ll n;
	cin>>n;
	pair <ll,ll> a[n+3];
	ll dp[n+3],dp2[n+3];
	dp[0]=0;
	for (int i=1; i<=n; i++){
		cin>>a[i].first>>a[i].second;
	}
	
	sort(a+1,a+1+n);
	
	for (int i=1; i<=n; i++){	
		dp[i]=dp[i-1]+a[i].second;
	}
	
	dp2[0]=-1e18;
	ll ans=0;
	for (int i=1; i<=n; i++){
		dp2[i]=max(dp2[i-1],a[i].first-dp[i-1]);
	}
	
	for (int i=n; i>0; i--){
		ans=max(ans,dp[i]+dp2[i]-a[i].first);
	}
	
	cout<<ans;
	
	
	
	
	
	
	
}                        

int main(){
	//srand(time(0));
	//fflush(stdout);
//	freopen("bridges.in","r",stdin); freopen("bridges.out","w",stdout);
	
	
//	speed;
	ll T=1;
//	cin>>T;
	for (int i=1; i<=T; i++){
		fcn();	
	}
}




 

/*

1
2 3
4 5
6 7


*/

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	356 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	3 ms	348 KB	Output is correct
29	Correct	3 ms	348 KB	Output is correct
30	Correct	3 ms	580 KB	Output is correct
31	Correct	3 ms	584 KB	Output is correct
32	Correct	3 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	3 ms	348 KB	Output is correct
35	Correct	3 ms	348 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	348 KB	Output is correct
38	Correct	4 ms	348 KB	Output is correct
39	Correct	4 ms	576 KB	Output is correct
40	Correct	3 ms	404 KB	Output is correct
41	Correct	3 ms	348 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	348 KB	Output is correct
46	Correct	3 ms	344 KB	Output is correct
47	Correct	3 ms	348 KB	Output is correct
48	Correct	3 ms	588 KB	Output is correct
49	Correct	3 ms	348 KB	Output is correct
50	Correct	3 ms	348 KB	Output is correct
51	Correct	3 ms	348 KB	Output is correct
52	Correct	283 ms	15960 KB	Output is correct
53	Correct	278 ms	15964 KB	Output is correct
54	Correct	284 ms	15964 KB	Output is correct
55	Correct	280 ms	16056 KB	Output is correct
56	Correct	271 ms	16056 KB	Output is correct
57	Correct	274 ms	15964 KB	Output is correct
58	Correct	288 ms	15964 KB	Output is correct
59	Correct	273 ms	15960 KB	Output is correct
60	Correct	288 ms	15964 KB	Output is correct
61	Correct	274 ms	15964 KB	Output is correct
62	Correct	276 ms	15964 KB	Output is correct
63	Correct	283 ms	16056 KB	Output is correct
64	Correct	275 ms	16060 KB	Output is correct
65	Correct	282 ms	16076 KB	Output is correct
66	Correct	296 ms	16056 KB	Output is correct
67	Correct	286 ms	16064 KB	Output is correct
68	Correct	273 ms	16060 KB	Output is correct

답안 #1049775

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