답안 #445980

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
445980	2021-07-20T10:22:08 Z	kym	Art Exhibition (JOI18_art)	C++14	100 / 100	215 ms	24772 KB

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 500005;
int n;
pi A[MAXN];
int lf[MAXN], rg[MAXN];
int32_t main() 
{
	IAMSPEED
	cin >> n;
	FOR(i,1,n) cin>> A[i].f >> A[i].s;
	sort(A+1,A+n+1,[](pi a, pi b) {
		return a.f < b.f;
	});
	int sum = 0;
	FOR(i,2,n) {
		sum -= A[i-1].s;
		sum += A[i].f - A[i-1].f;
		lf[i] = sum;
		lf[i] = max(lf[i], lf[i-1]);
	}
	int ans=0;
	sum = 0;
	int tot =0 ;
	FOR(i,1,n) tot += A[i].s;
	tot -= A[n].f-A[1].f;
	chmax(ans, tot);
	chmax(ans, tot + lf[n]);
	DEC(i,n-1,1) {
		sum -= A[i+1].s;
		sum += A[i+1].f - A[i].f;
		chmax(ans, tot + sum + lf[i]);
	}
	cout << ans;
}

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	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 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	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 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	332 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	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 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	332 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	2 ms	588 KB	Output is correct
29	Correct	3 ms	588 KB	Output is correct
30	Correct	2 ms	588 KB	Output is correct
31	Correct	3 ms	588 KB	Output is correct
32	Correct	3 ms	592 KB	Output is correct
33	Correct	3 ms	588 KB	Output is correct
34	Correct	2 ms	588 KB	Output is correct
35	Correct	2 ms	588 KB	Output is correct
36	Correct	3 ms	496 KB	Output is correct
37	Correct	2 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	596 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	2 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	2 ms	588 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	2 ms	588 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 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	0 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	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 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	332 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	2 ms	588 KB	Output is correct
29	Correct	3 ms	588 KB	Output is correct
30	Correct	2 ms	588 KB	Output is correct
31	Correct	3 ms	588 KB	Output is correct
32	Correct	3 ms	592 KB	Output is correct
33	Correct	3 ms	588 KB	Output is correct
34	Correct	2 ms	588 KB	Output is correct
35	Correct	2 ms	588 KB	Output is correct
36	Correct	3 ms	496 KB	Output is correct
37	Correct	2 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	596 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	2 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	2 ms	588 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	2 ms	588 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	214 ms	24612 KB	Output is correct
53	Correct	210 ms	24676 KB	Output is correct
54	Correct	211 ms	24772 KB	Output is correct
55	Correct	208 ms	24620 KB	Output is correct
56	Correct	215 ms	24700 KB	Output is correct
57	Correct	214 ms	24696 KB	Output is correct
58	Correct	208 ms	24660 KB	Output is correct
59	Correct	208 ms	24624 KB	Output is correct
60	Correct	205 ms	24644 KB	Output is correct
61	Correct	213 ms	24488 KB	Output is correct
62	Correct	208 ms	24644 KB	Output is correct
63	Correct	209 ms	24708 KB	Output is correct
64	Correct	213 ms	24644 KB	Output is correct
65	Correct	212 ms	24588 KB	Output is correct
66	Correct	208 ms	24772 KB	Output is correct
67	Correct	209 ms	24684 KB	Output is correct
68	Correct	211 ms	24624 KB	Output is correct

답안 #445980

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