답안 #373621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
373621	2021-03-05T10:00:30 Z	Valera_Grinenko	Art Exhibition (JOI18_art)	C++17	100 / 100	248 ms	20972 KB

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int n = 0;

  cin >> n;

  vector<pair<ll, ll> > ab(n);

  for(auto& x : ab) cin >> x.fi >> x.se;

  sort(all(ab));

  ll ans = 0;

  ll ca = 0, cb = 0, cur = 0;

  for(int i = 0; i < n; i++) {
    cb = cb + (i ? ab[i - 1].fi : 0) + (i ? ab[i - 1].se : 0) - ab[i].fi;
    cur = min(cur, cb);
    ca = ca + (i ? ab[i - 1].fi : 0) + ab[i].se - ab[i].fi;
    ans = max(ans, ca - cur);
  }

  cout << ans;

  return 0;
}
/*

*/

Compilation message

art.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	508 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	3 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	3 ms	492 KB	Output is correct
34	Correct	3 ms	492 KB	Output is correct
35	Correct	4 ms	492 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	492 KB	Output is correct
38	Correct	3 ms	492 KB	Output is correct
39	Correct	3 ms	492 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	3 ms	492 KB	Output is correct
42	Correct	4 ms	492 KB	Output is correct
43	Correct	3 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	492 KB	Output is correct
46	Correct	3 ms	492 KB	Output is correct
47	Correct	3 ms	492 KB	Output is correct
48	Correct	3 ms	492 KB	Output is correct
49	Correct	3 ms	492 KB	Output is correct
50	Correct	3 ms	492 KB	Output is correct
51	Correct	3 ms	492 KB	Output is correct
52	Correct	223 ms	20864 KB	Output is correct
53	Correct	223 ms	20844 KB	Output is correct
54	Correct	222 ms	20972 KB	Output is correct
55	Correct	221 ms	20844 KB	Output is correct
56	Correct	220 ms	20844 KB	Output is correct
57	Correct	248 ms	20972 KB	Output is correct
58	Correct	219 ms	20844 KB	Output is correct
59	Correct	222 ms	20972 KB	Output is correct
60	Correct	223 ms	20844 KB	Output is correct
61	Correct	218 ms	20740 KB	Output is correct
62	Correct	219 ms	20844 KB	Output is correct
63	Correct	235 ms	20916 KB	Output is correct
64	Correct	227 ms	20972 KB	Output is correct
65	Correct	230 ms	20844 KB	Output is correct
66	Correct	220 ms	20972 KB	Output is correct
67	Correct	222 ms	20972 KB	Output is correct
68	Correct	218 ms	20972 KB	Output is correct

답안 #373621

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