oj.uz

Submission #868051

# Submission time Handle Problem Language Result Execution time Memory
868051 2023-10-30T10:10:19 Z MongHwa Art Exhibition (JOI18_art) C++17
100 / 100
 145 ms 20960 KB 
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define X first
#define Y second

pair<ll, ll> arr[500001];

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

    for(int i = 0; i < n; i++)
        cin >> arr[i].X >> arr[i].Y;

    sort(arr, arr+n);

    ll ans = 0;
    ll cur = 0;
    for(int i = 0; i < n; i++)
        ans = max(ans, arr[i].Y);
        
    for(int i = 0; i < n; i++)
    {
        if(ans < cur+arr[i].Y - arr[i].X)
            ans = cur+arr[i].Y - arr[i].X;

        if(cur < arr[i].X)
            cur = arr[i].X;
        cur += arr[i].Y;
    }

    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 624 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 608 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 628 KB Output is correct
39 Correct 1 ms 608 KB Output is correct
40 Correct 1 ms 584 KB Output is correct
41 Correct 2 ms 476 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 600 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 2 ms 600 KB Output is correct
46 Correct 2 ms 600 KB Output is correct
47 Correct 2 ms 856 KB Output is correct
48 Correct 2 ms 488 KB Output is correct
49 Correct 1 ms 472 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 624 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 608 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 628 KB Output is correct
39 Correct 1 ms 608 KB Output is correct
40 Correct 1 ms 584 KB Output is correct
41 Correct 2 ms 476 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 600 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 2 ms 600 KB Output is correct
46 Correct 2 ms 600 KB Output is correct
47 Correct 2 ms 856 KB Output is correct
48 Correct 2 ms 488 KB Output is correct
49 Correct 1 ms 472 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 125 ms 20716 KB Output is correct
53 Correct 142 ms 20960 KB Output is correct
54 Correct 124 ms 20816 KB Output is correct
55 Correct 125 ms 20820 KB Output is correct
56 Correct 123 ms 20712 KB Output is correct
57 Correct 124 ms 20820 KB Output is correct
58 Correct 143 ms 20816 KB Output is correct
59 Correct 125 ms 20820 KB Output is correct
60 Correct 124 ms 20836 KB Output is correct
61 Correct 129 ms 20572 KB Output is correct
62 Correct 124 ms 20852 KB Output is correct
63 Correct 145 ms 20840 KB Output is correct
64 Correct 130 ms 20708 KB Output is correct
65 Correct 128 ms 20820 KB Output is correct
66 Correct 145 ms 20960 KB Output is correct
67 Correct 132 ms 20712 KB Output is correct
68 Correct 126 ms 20844 KB Output is correct