답안 #408986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
408986	2021-05-20T01:57:13 Z	arwaeystoamneg	Art Exhibition (JOI18_art)	C++17	100 / 100	235 ms	24772 KB

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 500005;
int n, b[MAX], order[MAX];
ll a[MAX], prefix[MAX];
int main()
{
	setIO("test1");
	cin >> n;
	F0R(i, n)cin >> a[i] >> b[i];
	iota(order, order + n, 0);
	sort(order, order + n, [](int i, int j) {return a[i] < a[j]; });
	F0R(i, n)prefix[i + 1] = prefix[i] + b[order[i]];
	ll best = linf;
	ll ans = -linf;
	F0R(i, n)
	{
		best = min(best, prefix[i] - a[order[i]]);
		ans = max(ans, prefix[i + 1] - a[order[i]] - best);
	}
	cout << ans << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	320 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	3 ms	588 KB	Output is correct
28	Correct	3 ms	488 KB	Output is correct
29	Correct	3 ms	588 KB	Output is correct
30	Correct	3 ms	588 KB	Output is correct
31	Correct	3 ms	592 KB	Output is correct
32	Correct	3 ms	584 KB	Output is correct
33	Correct	3 ms	592 KB	Output is correct
34	Correct	3 ms	588 KB	Output is correct
35	Correct	3 ms	452 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	588 KB	Output is correct
38	Correct	3 ms	592 KB	Output is correct
39	Correct	3 ms	588 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	4 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	3 ms	584 KB	Output is correct
44	Correct	3 ms	588 KB	Output is correct
45	Correct	3 ms	588 KB	Output is correct
46	Correct	3 ms	588 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	3 ms	588 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	3 ms	588 KB	Output is correct
51	Correct	3 ms	588 KB	Output is correct
52	Correct	224 ms	24676 KB	Output is correct
53	Correct	225 ms	24644 KB	Output is correct
54	Correct	229 ms	24772 KB	Output is correct
55	Correct	232 ms	24696 KB	Output is correct
56	Correct	229 ms	24644 KB	Output is correct
57	Correct	230 ms	24632 KB	Output is correct
58	Correct	224 ms	24692 KB	Output is correct
59	Correct	230 ms	24732 KB	Output is correct
60	Correct	225 ms	24648 KB	Output is correct
61	Correct	229 ms	24472 KB	Output is correct
62	Correct	228 ms	24736 KB	Output is correct
63	Correct	228 ms	24644 KB	Output is correct
64	Correct	228 ms	24756 KB	Output is correct
65	Correct	235 ms	24660 KB	Output is correct
66	Correct	226 ms	24692 KB	Output is correct
67	Correct	229 ms	24732 KB	Output is correct
68	Correct	235 ms	24644 KB	Output is correct

답안 #408986

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