답안 #690935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
690935	2023-01-30T16:55:56 Z	Nelt	Art Exhibition (JOI18_art)	C++17	100 / 100	171 ms	20792 KB

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n;
    cin >> n;
    pp(ll, ll) a[n + 1];
    for (ll i = 1; i <= n; i++)
        cin >> a[i].F >> a[i].S;
    sort(a + 1, a + n + 1);
    ll ans = 0, sum = 0, mn = 1e18;
    for (ll i = 1; i <= n; i++)
    {
        mn = min(mn, sum - a[i].F);
        ans = max(ans, sum + a[i].S - a[i].F - mn);
        sum += a[i].S;
    }
    cout << ans << endl;
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	328 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	508 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	456 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	512 KB	Output is correct
37	Correct	2 ms	508 KB	Output is correct
38	Correct	2 ms	468 KB	Output is correct
39	Correct	2 ms	464 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	2 ms	524 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	468 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	2 ms	524 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	468 KB	Output is correct
49	Correct	2 ms	468 KB	Output is correct
50	Correct	2 ms	464 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct
52	Correct	171 ms	20660 KB	Output is correct
53	Correct	169 ms	20780 KB	Output is correct
54	Correct	169 ms	20684 KB	Output is correct
55	Correct	162 ms	20656 KB	Output is correct
56	Correct	160 ms	20768 KB	Output is correct
57	Correct	170 ms	20656 KB	Output is correct
58	Correct	163 ms	20660 KB	Output is correct
59	Correct	170 ms	20656 KB	Output is correct
60	Correct	164 ms	20768 KB	Output is correct
61	Correct	161 ms	20644 KB	Output is correct
62	Correct	164 ms	20792 KB	Output is correct
63	Correct	165 ms	20784 KB	Output is correct
64	Correct	164 ms	20652 KB	Output is correct
65	Correct	162 ms	20664 KB	Output is correct
66	Correct	162 ms	20772 KB	Output is correct
67	Correct	165 ms	20656 KB	Output is correct
68	Correct	167 ms	20652 KB	Output is correct

답안 #690935

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