Submission #202837

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
202837	2020-02-18T06:43:33 Z	bash	Art Exhibition (JOI18_art)	C++17	100 / 100	376 ms	48376 KB

/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64_t
#endif

const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}
pii a[MAXN];
int pref[MAXN];

main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    int n = readInt();
    for (int i = 1; i <= n; i++) {
		a[i] = {readInt(),  readInt()};
    }
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) {
    	pref[i] = pref[i - 1] + a[i].S;
    }
	set <int> kek;
	int ans = a[1].S;
	kek.insert(a[1].F);
	for (int i = 2; i <= n; i++) {
		ans = max(ans, a[i].S);
		ans = max(ans, pref[i] - a[i].F + *kek.rbegin());				
		kek.insert(-pref[i - 1] + a[i].F);
	}
	cout << ans;
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 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	504 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	372 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	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 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	504 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	372 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	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 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	6 ms	376 KB	Output is correct
23	Correct	6 ms	376 KB	Output is correct
24	Correct	5 ms	376 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 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	504 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	372 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	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 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	6 ms	376 KB	Output is correct
23	Correct	6 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	7 ms	888 KB	Output is correct
28	Correct	8 ms	760 KB	Output is correct
29	Correct	8 ms	760 KB	Output is correct
30	Correct	8 ms	760 KB	Output is correct
31	Correct	8 ms	760 KB	Output is correct
32	Correct	8 ms	764 KB	Output is correct
33	Correct	8 ms	760 KB	Output is correct
34	Correct	8 ms	760 KB	Output is correct
35	Correct	8 ms	760 KB	Output is correct
36	Correct	8 ms	760 KB	Output is correct
37	Correct	8 ms	760 KB	Output is correct
38	Correct	8 ms	888 KB	Output is correct
39	Correct	8 ms	760 KB	Output is correct
40	Correct	8 ms	760 KB	Output is correct
41	Correct	9 ms	888 KB	Output is correct
42	Correct	8 ms	888 KB	Output is correct
43	Correct	8 ms	760 KB	Output is correct
44	Correct	8 ms	760 KB	Output is correct
45	Correct	8 ms	888 KB	Output is correct
46	Correct	8 ms	820 KB	Output is correct
47	Correct	7 ms	760 KB	Output is correct
48	Correct	8 ms	760 KB	Output is correct
49	Correct	8 ms	760 KB	Output is correct
50	Correct	8 ms	760 KB	Output is correct
51	Correct	7 ms	760 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 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	504 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	372 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	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 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	6 ms	376 KB	Output is correct
23	Correct	6 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	7 ms	888 KB	Output is correct
28	Correct	8 ms	760 KB	Output is correct
29	Correct	8 ms	760 KB	Output is correct
30	Correct	8 ms	760 KB	Output is correct
31	Correct	8 ms	760 KB	Output is correct
32	Correct	8 ms	764 KB	Output is correct
33	Correct	8 ms	760 KB	Output is correct
34	Correct	8 ms	760 KB	Output is correct
35	Correct	8 ms	760 KB	Output is correct
36	Correct	8 ms	760 KB	Output is correct
37	Correct	8 ms	760 KB	Output is correct
38	Correct	8 ms	888 KB	Output is correct
39	Correct	8 ms	760 KB	Output is correct
40	Correct	8 ms	760 KB	Output is correct
41	Correct	9 ms	888 KB	Output is correct
42	Correct	8 ms	888 KB	Output is correct
43	Correct	8 ms	760 KB	Output is correct
44	Correct	8 ms	760 KB	Output is correct
45	Correct	8 ms	888 KB	Output is correct
46	Correct	8 ms	820 KB	Output is correct
47	Correct	7 ms	760 KB	Output is correct
48	Correct	8 ms	760 KB	Output is correct
49	Correct	8 ms	760 KB	Output is correct
50	Correct	8 ms	760 KB	Output is correct
51	Correct	7 ms	760 KB	Output is correct
52	Correct	306 ms	48120 KB	Output is correct
53	Correct	315 ms	48184 KB	Output is correct
54	Correct	330 ms	48192 KB	Output is correct
55	Correct	330 ms	48120 KB	Output is correct
56	Correct	363 ms	48248 KB	Output is correct
57	Correct	376 ms	48248 KB	Output is correct
58	Correct	341 ms	48376 KB	Output is correct
59	Correct	334 ms	48200 KB	Output is correct
60	Correct	332 ms	48248 KB	Output is correct
61	Correct	334 ms	48120 KB	Output is correct
62	Correct	338 ms	48248 KB	Output is correct
63	Correct	325 ms	48248 KB	Output is correct
64	Correct	324 ms	48236 KB	Output is correct
65	Correct	317 ms	48248 KB	Output is correct
66	Correct	305 ms	48248 KB	Output is correct
67	Correct	306 ms	48376 KB	Output is correct
68	Correct	346 ms	48248 KB	Output is correct

Submission #202837

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