답안 #207535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207535	2020-03-07T19:21:22 Z	Lightning	Art Exhibition (JOI18_art)	C++14	50 / 100	79 ms	12024 KB

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
#define int ll

const int N = 2e5 + 5;
const int INF = 1e9 + 5;

int n, ans;
pll a[N];

void solve() {
	cin >> n;
	//int sum = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].F >> a[i].S;
		//sum += a[i].S;
	}
	sort(a + 1, a + n + 1);
	/**ans = sum - (a[n].F - a[1].F);
	int l = 1, r = n;
	while (l < r) {
		if (sum - a[l].S - (a[r].F - a[l+1].F) >= sum - a[r].S - (a[r-1].F - a[l].F)) {
			sum -= a[l].S;
			++l;
			ans = max(ans, sum - (a[r].F - a[l].F));
		}
		else {
			sum -= a[r].S;
			--r;
			ans = max(ans, sum - (a[r].F - a[l].F));
		}
	}**/
	for (int i = 1; i <= n; ++i) {
		int sum = 0;
		for (int j = i; j <= n; ++j) {
			sum += a[j].S;
			ans = max(ans, sum - (a[j].F - a[i].F));		
		}
	}
	cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tt = 1;
	while (tt --) {
		solve();
	}
	return 0;
}
/*
	If you only do what you can do, 
	You will never be more than you are now!
*/

Compilation message

art.cpp:75:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  main () {
        ^

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	420 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	380 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	6 ms	504 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	380 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	380 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	380 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	34 ms	632 KB	Output is correct
28	Correct	21 ms	504 KB	Output is correct
29	Correct	21 ms	504 KB	Output is correct
30	Correct	21 ms	504 KB	Output is correct
31	Correct	21 ms	504 KB	Output is correct
32	Correct	22 ms	504 KB	Output is correct
33	Correct	21 ms	504 KB	Output is correct
34	Correct	21 ms	504 KB	Output is correct
35	Correct	22 ms	632 KB	Output is correct
36	Correct	21 ms	504 KB	Output is correct
37	Correct	21 ms	504 KB	Output is correct
38	Correct	22 ms	592 KB	Output is correct
39	Correct	21 ms	504 KB	Output is correct
40	Correct	21 ms	504 KB	Output is correct
41	Correct	21 ms	504 KB	Output is correct
42	Correct	21 ms	504 KB	Output is correct
43	Correct	21 ms	504 KB	Output is correct
44	Correct	21 ms	504 KB	Output is correct
45	Correct	21 ms	504 KB	Output is correct
46	Correct	23 ms	552 KB	Output is correct
47	Correct	21 ms	504 KB	Output is correct
48	Correct	21 ms	504 KB	Output is correct
49	Correct	21 ms	632 KB	Output is correct
50	Correct	21 ms	504 KB	Output is correct
51	Correct	21 ms	504 KB	Output is correct
52	Runtime error	79 ms	12024 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

답안 #207535

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0