답안 #1088477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1088477	2024-09-14T13:29:59 Z	LucasLe	Art Exhibition (JOI18_art)	C++17	100 / 100	205 ms	28756 KB

#include <bits/stdc++.h>


#define                int  long long
#define              moony  long long
#define                pii  pair<int, int>
#define                 fi  first
#define                 se  second
#define                 ld  long double
#define                 vi  vector<int>
#define                vii  vector<vector<int>>
#define             all(v)  (v).begin(), (v).end()
#define       rep(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define       per(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)

using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}

int mul(int a, int b) {
  (a *= b) %= MOD;
  return a;
}

int ceil(int x, int y) {
  return (x + y - 1) / y;
}

int bin_pow(int x, int y) {
  int res=1;
  while(y){if(y&1)res=res*x%MOD;x=x*x%MOD;y>>=1;}
  return res;
}

const int INF = 1e17;
const int maxn = 1e6 + 5;

int pref[maxn + 5];

int calc(int l, int r) {
  if (l > r) return 0;
  if (!l) return pref[r];
  return pref[r] - pref[l - 1];
}

void solve(int tc) {
  int n; cin >> n;
  vector<pair<int, int>> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second;
  sort(a.begin(), a.end());
  for (int i = 0; i < n; ++i) {
    if (!i) pref[0] = a[0].second;
    else pref[i] = pref[i - 1] + a[i].second;
  }
  vector<int> orz(n);
  for (int i = 0; i < n; ++i)
    orz[i] = a[i].first + calc(i, n - 1);
  int sum = -INF, ans = 0;
  for (int i = 0; i < n; ++i) {
    sum = max(sum, orz[i]);
    ans = max(ans, sum - calc(i + 1, n - 1) - a[i].first);
  }
  cout << ans << '\n';
}

signed main() {

  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);

  int tc = 1;
  //cin >> tc;

  for (int i = 1; i <= tc; ++i) {
    solve(i);
  }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	464 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	3 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	3 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	2 ms	752 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	728 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	3 ms	652 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	860 KB	Output is correct
50	Correct	2 ms	600 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	464 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	3 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	3 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	2 ms	752 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	728 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	3 ms	652 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	860 KB	Output is correct
50	Correct	2 ms	600 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	136 ms	28616 KB	Output is correct
53	Correct	128 ms	28748 KB	Output is correct
54	Correct	121 ms	28752 KB	Output is correct
55	Correct	122 ms	28756 KB	Output is correct
56	Correct	120 ms	28636 KB	Output is correct
57	Correct	119 ms	28748 KB	Output is correct
58	Correct	120 ms	28744 KB	Output is correct
59	Correct	125 ms	28612 KB	Output is correct
60	Correct	145 ms	28752 KB	Output is correct
61	Correct	120 ms	28744 KB	Output is correct
62	Correct	178 ms	28752 KB	Output is correct
63	Correct	123 ms	28504 KB	Output is correct
64	Correct	130 ms	28504 KB	Output is correct
65	Correct	160 ms	28756 KB	Output is correct
66	Correct	205 ms	28752 KB	Output is correct
67	Correct	126 ms	28508 KB	Output is correct
68	Correct	126 ms	28748 KB	Output is correct

답안 #1088477

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