Submission #678509

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
678509	2023-01-06T06:24:54 Z	SanguineChameleon	Art Exhibition (JOI18_art)	C++17	100 / 100	205 ms	8732 KB

// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int ms = 5e5 + 20;
pair<long long, long long> a[ms];

void just_do_it() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + n + 1);
	for (int i = 2; i <= n; i++) {
		a[i].second += a[i - 1].second;
	}
	long long mi = a[1].first;
	long long res = 0;
	for (int i = 1; i <= n; i++) {
		mi = max(mi, a[i].first - a[i - 1].second);
		res = max(res, a[i].second - a[i].first + mi);
	}
	cout << res;
}

// END MAIN CODE

Compilation message

art.cpp: In function 'void file_io(std::string, std::string)':
art.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	228 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 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	340 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	332 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	228 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 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	340 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	332 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	472 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	3 ms	468 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	468 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	3 ms	468 KB	Output is correct
41	Correct	3 ms	468 KB	Output is correct
42	Correct	3 ms	468 KB	Output is correct
43	Correct	3 ms	468 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	3 ms	468 KB	Output is correct
49	Correct	3 ms	468 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	228 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 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	340 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	332 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	472 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	3 ms	468 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	468 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	3 ms	468 KB	Output is correct
41	Correct	3 ms	468 KB	Output is correct
42	Correct	3 ms	468 KB	Output is correct
43	Correct	3 ms	468 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	3 ms	468 KB	Output is correct
49	Correct	3 ms	468 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct
52	Correct	166 ms	8580 KB	Output is correct
53	Correct	167 ms	8568 KB	Output is correct
54	Correct	164 ms	8732 KB	Output is correct
55	Correct	163 ms	8644 KB	Output is correct
56	Correct	155 ms	8548 KB	Output is correct
57	Correct	205 ms	8560 KB	Output is correct
58	Correct	163 ms	8624 KB	Output is correct
59	Correct	169 ms	8640 KB	Output is correct
60	Correct	161 ms	8644 KB	Output is correct
61	Correct	177 ms	8644 KB	Output is correct
62	Correct	161 ms	8600 KB	Output is correct
63	Correct	158 ms	8648 KB	Output is correct
64	Correct	161 ms	8608 KB	Output is correct
65	Correct	181 ms	8680 KB	Output is correct
66	Correct	161 ms	8556 KB	Output is correct
67	Correct	160 ms	8640 KB	Output is correct
68	Correct	174 ms	8696 KB	Output is correct

Submission #678509

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