답안 #479737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479737 2021-10-13T03:06:25 Z chungdinh Art Exhibition (JOI18_art) C++17
100 / 100
604 ms 12100 KB
#include <iostream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#include <cassert>
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

#define ll long long
#define ii pair<long long int, long long int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define r first
#define c second

#define all(x) x.begin(), x.end()
#define mk(x, y) make_pair(x, y)

ostream& operator << (ostream& os, pair<int, int> a) {
    return os << a.first << " : " << a.second;
}

#define endl '\n'
#define db(val) "["#val" = "<<(val)<<"] "
#define cntbit(x) __builtin_popcount(x)

const int N = 5e5 + 5;
const int iINF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1e18;

int n;
ii a[N];

ll dp[N];

int main() {
    ios_base::sync_with_stdio();
    #ifdef CHUNGDINH
    freopen("main.inp","r",stdin);
    freopen("main.out","w",stderr);
    #endif

    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1);

    ll ff = -INF;
    for (int i = 1; i <= n; i++) {
        dp[i] = a[i].second;
        dp[i] = max(dp[i], ff + a[i].second - a[i].first);
        ff = max(ff, dp[i] + a[i].first);
    }

    cout << *max_element(dp + 1, dp + n + 1);
}

/*
Array bounds *
long long vs int
Garbage value
Sometimes, VNOI views "arrays out of bounds" as "wrong answer"
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 236 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 236 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 6 ms 332 KB Output is correct
30 Correct 6 ms 336 KB Output is correct
31 Correct 6 ms 332 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 6 ms 388 KB Output is correct
34 Correct 6 ms 372 KB Output is correct
35 Correct 6 ms 332 KB Output is correct
36 Correct 6 ms 352 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 6 ms 332 KB Output is correct
40 Correct 6 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 6 ms 364 KB Output is correct
44 Correct 6 ms 332 KB Output is correct
45 Correct 6 ms 332 KB Output is correct
46 Correct 7 ms 332 KB Output is correct
47 Correct 6 ms 332 KB Output is correct
48 Correct 6 ms 336 KB Output is correct
49 Correct 6 ms 368 KB Output is correct
50 Correct 6 ms 332 KB Output is correct
51 Correct 6 ms 380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 236 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 6 ms 332 KB Output is correct
30 Correct 6 ms 336 KB Output is correct
31 Correct 6 ms 332 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 6 ms 388 KB Output is correct
34 Correct 6 ms 372 KB Output is correct
35 Correct 6 ms 332 KB Output is correct
36 Correct 6 ms 352 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 6 ms 332 KB Output is correct
40 Correct 6 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 6 ms 364 KB Output is correct
44 Correct 6 ms 332 KB Output is correct
45 Correct 6 ms 332 KB Output is correct
46 Correct 7 ms 332 KB Output is correct
47 Correct 6 ms 332 KB Output is correct
48 Correct 6 ms 336 KB Output is correct
49 Correct 6 ms 368 KB Output is correct
50 Correct 6 ms 332 KB Output is correct
51 Correct 6 ms 380 KB Output is correct
52 Correct 574 ms 12044 KB Output is correct
53 Correct 566 ms 11900 KB Output is correct
54 Correct 570 ms 11896 KB Output is correct
55 Correct 564 ms 12080 KB Output is correct
56 Correct 558 ms 11928 KB Output is correct
57 Correct 556 ms 11972 KB Output is correct
58 Correct 604 ms 12004 KB Output is correct
59 Correct 561 ms 11972 KB Output is correct
60 Correct 560 ms 11972 KB Output is correct
61 Correct 568 ms 12100 KB Output is correct
62 Correct 561 ms 12000 KB Output is correct
63 Correct 575 ms 11972 KB Output is correct
64 Correct 593 ms 12032 KB Output is correct
65 Correct 585 ms 11976 KB Output is correct
66 Correct 560 ms 11972 KB Output is correct
67 Correct 563 ms 12052 KB Output is correct
68 Correct 561 ms 11948 KB Output is correct