답안 #530819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530819	2022-02-26T21:22:59 Z	SavicS	Art Exhibition (JOI18_art)	C++17	100 / 100	191 ms	24696 KB

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 500005; 

int n;
pll niz[mxN];

ll pref[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    ff(i,1,n)cin >> niz[i].fi >> niz[i].se;
    sort(niz + 1, niz + n + 1);

    ff(i,1,n)pref[i] = pref[i - 1] + niz[i].se;

    ll rez = niz[1].se; ll mn = -niz[1].fi;
    ff(i,2,n){
        mn = min(mn, pref[i - 1] - niz[i].fi);
        ll kol = pref[i] - mn;
        rez = max(rez, kol - niz[i].fi);
    }

    cout << rez << '\n';

    return 0;
}
/*

3 
2 3
11 2 
4 5

15
1543361732 260774320
2089759661 257198921
1555665663 389548466
4133306295 296394520
2596448427 301103944
1701413087 274491541
2347488426 912791996
2133012079 444074242
2659886224 656957044
1345396764 259870638
2671164286 233246973
2791812672 585862344
2996614635 91065315
971304780 488995617
1523452673 988137562

6 
4 1 
1 5 
10 3 
9 1 
4 2
5 3
 
3 2
2 3
11 2
4 5
 
// probati bojenje sahovski
*/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 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	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 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	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 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	328 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 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	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 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	328 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	580 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	588 KB	Output is correct
30	Correct	3 ms	460 KB	Output is correct
31	Correct	3 ms	576 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	528 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	3 ms	456 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	464 KB	Output is correct
40	Correct	2 ms	480 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	580 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	584 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	3 ms	456 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	2 ms	508 KB	Output is correct
50	Correct	2 ms	448 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 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	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 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	328 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	580 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	588 KB	Output is correct
30	Correct	3 ms	460 KB	Output is correct
31	Correct	3 ms	576 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	528 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	3 ms	456 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	464 KB	Output is correct
40	Correct	2 ms	480 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	580 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	584 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	3 ms	456 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	2 ms	508 KB	Output is correct
50	Correct	2 ms	448 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	183 ms	24564 KB	Output is correct
53	Correct	187 ms	24668 KB	Output is correct
54	Correct	182 ms	24644 KB	Output is correct
55	Correct	167 ms	24648 KB	Output is correct
56	Correct	173 ms	24640 KB	Output is correct
57	Correct	166 ms	24588 KB	Output is correct
58	Correct	174 ms	24620 KB	Output is correct
59	Correct	167 ms	24596 KB	Output is correct
60	Correct	182 ms	24648 KB	Output is correct
61	Correct	167 ms	24432 KB	Output is correct
62	Correct	191 ms	24664 KB	Output is correct
63	Correct	176 ms	24620 KB	Output is correct
64	Correct	172 ms	24696 KB	Output is correct
65	Correct	176 ms	24664 KB	Output is correct
66	Correct	165 ms	24680 KB	Output is correct
67	Correct	169 ms	24648 KB	Output is correct
68	Correct	172 ms	24576 KB	Output is correct

답안 #530819

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