답안 #420054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420054 2021-06-08T04:04:01 Z Trickster Art Exhibition (JOI18_art) C++14
100 / 100
721 ms 37468 KB
//Suleyman Atayew

#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
 
#define N 500010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) (ll)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }

using namespace std;

ll n;
pii p[N];
ll T[N*4], L[N*4];

void shift(ll node, ll to)
{
    T[to] += L[node];
    L[to] += L[node];
}

void upd(ll a, ll b, ll x, ll l, ll r, ll node)
{
    if(l > b || r < a) return;

    if(l >= a && r <= b) {
        T[node] += x;
        L[node] += x;
        return;
    }

    shift(node, node*2);
    shift(node, node*2+1);
    L[node] = 0;

    upd(a, b, x, l, (l+r)/2, node*2);
    upd(a, b, x, (l+r)/2+1, r, node*2+1);

    T[node] = max(T[node*2], T[node*2+1]);
}

int main()
{
    ios::sync_with_stdio(false);
	cin.tie(0);

    cin >> n;

    for(ll i = 1; i <= n; i++)
        cin >> p[i].ff >> p[i].ss;

    sort(p+1, p+n+1);

    ll ans = 0;
    for(ll i = 1; i <= n; i++) {
        upd(i, i, p[i].ss, 1, n, 1);
        upd(1, i-1, p[i-1].ff - p[i].ff + p[i].ss, 1, n, 1);

        ll cur = T[1];

        ans = max(ans, cur);

        upd(i, i, cur-p[i].ss, 1, n, 1);
    }

    cout << ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 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 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 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 1 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 356 KB Output is correct
15 Correct 1 ms 460 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 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 324 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 320 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 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 1 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 356 KB Output is correct
15 Correct 1 ms 460 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 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 324 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 320 KB Output is correct
27 Correct 6 ms 716 KB Output is correct
28 Correct 6 ms 716 KB Output is correct
29 Correct 6 ms 716 KB Output is correct
30 Correct 6 ms 716 KB Output is correct
31 Correct 5 ms 736 KB Output is correct
32 Correct 6 ms 712 KB Output is correct
33 Correct 7 ms 752 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 772 KB Output is correct
36 Correct 7 ms 716 KB Output is correct
37 Correct 6 ms 716 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 6 ms 716 KB Output is correct
40 Correct 6 ms 728 KB Output is correct
41 Correct 6 ms 720 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 6 ms 700 KB Output is correct
44 Correct 6 ms 716 KB Output is correct
45 Correct 7 ms 704 KB Output is correct
46 Correct 6 ms 700 KB Output is correct
47 Correct 6 ms 696 KB Output is correct
48 Correct 5 ms 716 KB Output is correct
49 Correct 6 ms 716 KB Output is correct
50 Correct 6 ms 716 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 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 1 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 356 KB Output is correct
15 Correct 1 ms 460 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 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 324 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 320 KB Output is correct
27 Correct 6 ms 716 KB Output is correct
28 Correct 6 ms 716 KB Output is correct
29 Correct 6 ms 716 KB Output is correct
30 Correct 6 ms 716 KB Output is correct
31 Correct 5 ms 736 KB Output is correct
32 Correct 6 ms 712 KB Output is correct
33 Correct 7 ms 752 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 772 KB Output is correct
36 Correct 7 ms 716 KB Output is correct
37 Correct 6 ms 716 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 6 ms 716 KB Output is correct
40 Correct 6 ms 728 KB Output is correct
41 Correct 6 ms 720 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 6 ms 700 KB Output is correct
44 Correct 6 ms 716 KB Output is correct
45 Correct 7 ms 704 KB Output is correct
46 Correct 6 ms 700 KB Output is correct
47 Correct 6 ms 696 KB Output is correct
48 Correct 5 ms 716 KB Output is correct
49 Correct 6 ms 716 KB Output is correct
50 Correct 6 ms 716 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
52 Correct 681 ms 37108 KB Output is correct
53 Correct 679 ms 37092 KB Output is correct
54 Correct 720 ms 37156 KB Output is correct
55 Correct 721 ms 37172 KB Output is correct
56 Correct 686 ms 37116 KB Output is correct
57 Correct 677 ms 37172 KB Output is correct
58 Correct 693 ms 37136 KB Output is correct
59 Correct 677 ms 37148 KB Output is correct
60 Correct 676 ms 37152 KB Output is correct
61 Correct 679 ms 37032 KB Output is correct
62 Correct 674 ms 37164 KB Output is correct
63 Correct 694 ms 37468 KB Output is correct
64 Correct 685 ms 37220 KB Output is correct
65 Correct 681 ms 37152 KB Output is correct
66 Correct 700 ms 37132 KB Output is correct
67 Correct 698 ms 37188 KB Output is correct
68 Correct 681 ms 37132 KB Output is correct