Submission #291961

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
291961	2020-09-06T05:59:38 Z	jbroeksteeg	Art Exhibition (JOI18_art)	C++14	100 / 100	350 ms	48380 KB

#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int64_t __i = 0; __i<(int64_t)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
	if (c.size() == 0) {os << "{}"; return os;}
	os << "{" << c[0];
	for (int64_t i = 1; i < (int64_t)c.size(); i++) {os <<", "<<c[i];}
	os << "}";
	return os;
}

using namespace std;

int main() {
//	freopen("input","r",stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);

	int64_t n; cin >> n;
	vector<pair<int64_t,int64_t>> arts(n);
	for (int64_t i = 0; i < n; i++) {
		cin >> arts[i].first >> arts[i].second;
	}
	sort(arts.begin(),arts.end());
	vector<int64_t> prefixValue(n);
	prefixValue[0]=arts[0].second;
	for (int64_t i = 1; i < n; i++) {
		prefixValue[i] = prefixValue[i-1] + arts[i].second;
	}
	
	multiset<int64_t> before;

	int64_t ans=0;
	for (int64_t i = 0; i < n; i++) {
		if (before.size()) { // idk do calculations
			int64_t thisValue = prefixValue[i] - arts[i].first;
			// cout << "i=" << i << ": " << thisValue-*before.begin() << endl;
			pMax(ans,thisValue-*before.begin());
			pMax(ans,prefixValue[i] - (arts[i].first - arts[0].first));
		}
		
		// add to set
		if (i+1<n) before.insert(prefixValue[i] - arts[i+1].first);
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	4 ms	768 KB	Output is correct
28	Correct	3 ms	768 KB	Output is correct
29	Correct	3 ms	768 KB	Output is correct
30	Correct	3 ms	768 KB	Output is correct
31	Correct	3 ms	768 KB	Output is correct
32	Correct	3 ms	768 KB	Output is correct
33	Correct	3 ms	768 KB	Output is correct
34	Correct	3 ms	768 KB	Output is correct
35	Correct	3 ms	768 KB	Output is correct
36	Correct	3 ms	784 KB	Output is correct
37	Correct	3 ms	768 KB	Output is correct
38	Correct	3 ms	768 KB	Output is correct
39	Correct	3 ms	768 KB	Output is correct
40	Correct	4 ms	768 KB	Output is correct
41	Correct	3 ms	768 KB	Output is correct
42	Correct	3 ms	768 KB	Output is correct
43	Correct	3 ms	768 KB	Output is correct
44	Correct	3 ms	768 KB	Output is correct
45	Correct	3 ms	768 KB	Output is correct
46	Correct	3 ms	768 KB	Output is correct
47	Correct	3 ms	768 KB	Output is correct
48	Correct	3 ms	768 KB	Output is correct
49	Correct	3 ms	768 KB	Output is correct
50	Correct	3 ms	896 KB	Output is correct
51	Correct	3 ms	768 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	4 ms	768 KB	Output is correct
28	Correct	3 ms	768 KB	Output is correct
29	Correct	3 ms	768 KB	Output is correct
30	Correct	3 ms	768 KB	Output is correct
31	Correct	3 ms	768 KB	Output is correct
32	Correct	3 ms	768 KB	Output is correct
33	Correct	3 ms	768 KB	Output is correct
34	Correct	3 ms	768 KB	Output is correct
35	Correct	3 ms	768 KB	Output is correct
36	Correct	3 ms	784 KB	Output is correct
37	Correct	3 ms	768 KB	Output is correct
38	Correct	3 ms	768 KB	Output is correct
39	Correct	3 ms	768 KB	Output is correct
40	Correct	4 ms	768 KB	Output is correct
41	Correct	3 ms	768 KB	Output is correct
42	Correct	3 ms	768 KB	Output is correct
43	Correct	3 ms	768 KB	Output is correct
44	Correct	3 ms	768 KB	Output is correct
45	Correct	3 ms	768 KB	Output is correct
46	Correct	3 ms	768 KB	Output is correct
47	Correct	3 ms	768 KB	Output is correct
48	Correct	3 ms	768 KB	Output is correct
49	Correct	3 ms	768 KB	Output is correct
50	Correct	3 ms	896 KB	Output is correct
51	Correct	3 ms	768 KB	Output is correct
52	Correct	286 ms	47608 KB	Output is correct
53	Correct	303 ms	48248 KB	Output is correct
54	Correct	297 ms	48248 KB	Output is correct
55	Correct	311 ms	48248 KB	Output is correct
56	Correct	341 ms	48308 KB	Output is correct
57	Correct	350 ms	48376 KB	Output is correct
58	Correct	325 ms	48248 KB	Output is correct
59	Correct	306 ms	48140 KB	Output is correct
60	Correct	300 ms	48380 KB	Output is correct
61	Correct	299 ms	48248 KB	Output is correct
62	Correct	294 ms	48380 KB	Output is correct
63	Correct	297 ms	48248 KB	Output is correct
64	Correct	296 ms	48376 KB	Output is correct
65	Correct	280 ms	48248 KB	Output is correct
66	Correct	275 ms	48248 KB	Output is correct
67	Correct	294 ms	48284 KB	Output is correct
68	Correct	333 ms	48240 KB	Output is correct

Submission #291961

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