oj.uz

Submission #898039

# Submission time Handle Problem Language Result Execution time Memory
898039 2024-01-04T08:51:11 Z andrei_iorgulescu Art Exhibition (JOI18_art) C++14
100 / 100
 141 ms 24920 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int n;
pair<int,int> a[500005];
int sp[500005];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i].first >> a[i].second;
    sort(a + 1,a + n + 1);
    for (int i = 1; i <= n; i++)
        sp[i] = sp[i - 1] + a[i].second;
    int ans = 0,mx = 0;
    for (int i = 1; i <= n; i++)
    {
        ///basically asta are size maxim, vreau sa maximizez sp[i] - sp[j - 1] + size[j] -> caut cea cu size[j] - sp[j - 1] maxima
        mx = max(mx,a[i].first - sp[i - 1]);
        ans = max(ans,sp[i] + mx - a[i].first);
    }
    cout << ans;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2520 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2648 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2520 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 2 ms 2480 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 2 ms 2632 KB Output is correct
44 Correct 2 ms 2652 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2648 KB Output is correct
47 Correct 2 ms 2652 KB Output is correct
48 Correct 2 ms 2652 KB Output is correct
49 Correct 2 ms 2904 KB Output is correct
50 Correct 2 ms 2648 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2520 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2648 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2520 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 2 ms 2480 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 2 ms 2632 KB Output is correct
44 Correct 2 ms 2652 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2648 KB Output is correct
47 Correct 2 ms 2652 KB Output is correct
48 Correct 2 ms 2652 KB Output is correct
49 Correct 2 ms 2904 KB Output is correct
50 Correct 2 ms 2648 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Correct 126 ms 24584 KB Output is correct
53 Correct 126 ms 24764 KB Output is correct
54 Correct 131 ms 24780 KB Output is correct
55 Correct 125 ms 24656 KB Output is correct
56 Correct 124 ms 24660 KB Output is correct
57 Correct 132 ms 24760 KB Output is correct
58 Correct 125 ms 24624 KB Output is correct
59 Correct 124 ms 24748 KB Output is correct
60 Correct 126 ms 24660 KB Output is correct
61 Correct 132 ms 24660 KB Output is correct
62 Correct 141 ms 24632 KB Output is correct
63 Correct 126 ms 24692 KB Output is correct
64 Correct 134 ms 24920 KB Output is correct
65 Correct 126 ms 24656 KB Output is correct
66 Correct 129 ms 24756 KB Output is correct
67 Correct 137 ms 24656 KB Output is correct
68 Correct 132 ms 24660 KB Output is correct