oj.uz

Submission #730951

# Submission time Handle Problem Language Result Execution time Memory
730951 2023-04-26T16:43:47 Z sleepntsheep Art Exhibition (JOI18_art) C++17
100 / 100
 382 ms 44324 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    using ll = long long;
    ll n, z = 0;
    scanf("%lld", &n);
    vector<pair<ll, ll>> v(n+1);
    for (auto it = v.begin() + 1; it != v.end(); it++) scanf("%lld%lld", &it->first, &it->second);
    sort(v.begin(), v.end());

    set<ll> heap;
    for (int i = 1; i <= n; i++)
    {
        v[i].second += v[i-1].second;
        z = max(z, v[i].second - v[i-1].second);
        if (heap.size())
            z = max(z, v[i].second - v[i].first + *heap.rbegin());
        heap.insert(v[i].first - v[i-1].second);
        heap.insert(v[i+1].first - v[i].second);
    }

    printf("%lld", z);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
art.cpp:10:61: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     for (auto it = v.begin() + 1; it != v.end(); it++) scanf("%lld%lld", &it->first, &it->second);
      |                                                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 724 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 3 ms 692 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 672 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 3 ms 692 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 3 ms 692 KB Output is correct
38 Correct 3 ms 616 KB Output is correct
39 Correct 3 ms 692 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 3 ms 692 KB Output is correct
45 Correct 3 ms 696 KB Output is correct
46 Correct 3 ms 612 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 5 ms 724 KB Output is correct
49 Correct 3 ms 724 KB Output is correct
50 Correct 4 ms 696 KB Output is correct
51 Correct 5 ms 692 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 724 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 3 ms 692 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 672 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 3 ms 692 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 3 ms 692 KB Output is correct
38 Correct 3 ms 616 KB Output is correct
39 Correct 3 ms 692 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 3 ms 692 KB Output is correct
45 Correct 3 ms 696 KB Output is correct
46 Correct 3 ms 612 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 5 ms 724 KB Output is correct
49 Correct 3 ms 724 KB Output is correct
50 Correct 4 ms 696 KB Output is correct
51 Correct 5 ms 692 KB Output is correct
52 Correct 293 ms 44060 KB Output is correct
53 Correct 336 ms 44244 KB Output is correct
54 Correct 292 ms 44316 KB Output is correct
55 Correct 303 ms 44324 KB Output is correct
56 Correct 297 ms 44212 KB Output is correct
57 Correct 343 ms 44196 KB Output is correct
58 Correct 360 ms 44240 KB Output is correct
59 Correct 340 ms 44120 KB Output is correct
60 Correct 293 ms 44192 KB Output is correct
61 Correct 305 ms 44080 KB Output is correct
62 Correct 310 ms 44192 KB Output is correct
63 Correct 310 ms 44200 KB Output is correct
64 Correct 287 ms 44196 KB Output is correct
65 Correct 292 ms 44208 KB Output is correct
66 Correct 336 ms 44320 KB Output is correct
67 Correct 298 ms 44156 KB Output is correct
68 Correct 382 ms 44260 KB Output is correct