oj.uz

Submission #126359

# Submission time Handle Problem Language Result Execution time Memory
126359 2019-07-07T13:18:05 Z EntityIT Art Exhibition (JOI18_art) C++14
100 / 100
 272 ms 12604 KB 
#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second

const int N = (int)5e5 + 5;
const long long infll = (long long)1e18 + 123;
int n;
long long ans = -infll, prv = -infll;
pair<long long, long long> a[N];

int main () {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%lld %lld", &a[i].fi, &a[i].se);
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) a[i].se += a[i - 1].se;

    for (int i = 1; i <= n; ++i) {
        prv = max(prv, a[i].fi - a[i - 1].se);
        ans = max(ans, a[i].se - a[i].fi + prv);
    }

    printf("%lld", ans);

    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
art.cpp:16:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; ++i) scanf("%lld %lld", &a[i].fi, &a[i].se);
                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 400 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 424 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 5 ms 564 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 5 ms 504 KB Output is correct
32 Correct 5 ms 504 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 4 ms 524 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 4 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 4 ms 504 KB Output is correct
42 Correct 4 ms 632 KB Output is correct
43 Correct 4 ms 504 KB Output is correct
44 Correct 4 ms 504 KB Output is correct
45 Correct 4 ms 504 KB Output is correct
46 Correct 4 ms 504 KB Output is correct
47 Correct 4 ms 504 KB Output is correct
48 Correct 5 ms 532 KB Output is correct
49 Correct 4 ms 504 KB Output is correct
50 Correct 4 ms 504 KB Output is correct
51 Correct 5 ms 504 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 400 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 424 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 5 ms 564 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 5 ms 504 KB Output is correct
32 Correct 5 ms 504 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 4 ms 524 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 4 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 4 ms 504 KB Output is correct
42 Correct 4 ms 632 KB Output is correct
43 Correct 4 ms 504 KB Output is correct
44 Correct 4 ms 504 KB Output is correct
45 Correct 4 ms 504 KB Output is correct
46 Correct 4 ms 504 KB Output is correct
47 Correct 4 ms 504 KB Output is correct
48 Correct 5 ms 532 KB Output is correct
49 Correct 4 ms 504 KB Output is correct
50 Correct 4 ms 504 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 272 ms 12376 KB Output is correct
53 Correct 263 ms 12280 KB Output is correct
54 Correct 261 ms 12280 KB Output is correct
55 Correct 271 ms 12456 KB Output is correct
56 Correct 264 ms 12392 KB Output is correct
57 Correct 263 ms 12408 KB Output is correct
58 Correct 263 ms 12584 KB Output is correct
59 Correct 262 ms 12408 KB Output is correct
60 Correct 261 ms 12280 KB Output is correct
61 Correct 264 ms 12304 KB Output is correct
62 Correct 264 ms 12408 KB Output is correct
63 Correct 264 ms 12556 KB Output is correct
64 Correct 262 ms 12412 KB Output is correct
65 Correct 266 ms 12460 KB Output is correct
66 Correct 262 ms 12604 KB Output is correct
67 Correct 263 ms 12528 KB Output is correct
68 Correct 255 ms 12548 KB Output is correct