oj.uz

Submission #225456

# Submission time Handle Problem Language Result Execution time Memory
225456 2020-04-20T15:20:21 Z Nightlight Art Exhibition (JOI18_art) C++14
100 / 100
 295 ms 21112 KB 
#include <bits/stdc++.h>
#define pii pair<long long, long long>
#define a first
#define b second
using namespace std;

int N;
pii A[500005];
long long ans, best = -1e9;
//pre[i] - pre[j - 1] - (A[i] - A[j])
//pre[i] - A[i] + (A[j] - pre[j - 1])

int main() {
//  freopen("inp", "r", stdin);
  scanf("%d", &N);
  for(int i = 1; i <= N; i++) {
    scanf("%lld %lld", &A[i].a, &A[i].b);
  }
  sort(A + 1, A + N + 1);
  for(int i = 1; i <= N; i++) {
    A[i].b += A[i - 1].b;
    best = max(best, A[i].a - A[i - 1].b);
    ans = max(ans, A[i].b - A[i].a + best);
  }
  printf("%lld\n", ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
   ~~~~~^~~~~~~~~~
art.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &A[i].a, &A[i].b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 360 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 8 ms 512 KB Output is correct
29 Correct 7 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 7 ms 512 KB Output is correct
32 Correct 9 ms 512 KB Output is correct
33 Correct 7 ms 560 KB Output is correct
34 Correct 8 ms 512 KB Output is correct
35 Correct 7 ms 512 KB Output is correct
36 Correct 7 ms 512 KB Output is correct
37 Correct 8 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 7 ms 512 KB Output is correct
41 Correct 8 ms 512 KB Output is correct
42 Correct 7 ms 512 KB Output is correct
43 Correct 7 ms 512 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 7 ms 512 KB Output is correct
46 Correct 7 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct
48 Correct 8 ms 512 KB Output is correct
49 Correct 7 ms 512 KB Output is correct
50 Correct 8 ms 512 KB Output is correct
51 Correct 8 ms 512 KB Output is correct
52 Correct 294 ms 20728 KB Output is correct
53 Correct 288 ms 20868 KB Output is correct
54 Correct 291 ms 20860 KB Output is correct
55 Correct 295 ms 20856 KB Output is correct
56 Correct 289 ms 20984 KB Output is correct
57 Correct 282 ms 20856 KB Output is correct
58 Correct 289 ms 20856 KB Output is correct
59 Correct 282 ms 20856 KB Output is correct
60 Correct 283 ms 21112 KB Output is correct
61 Correct 287 ms 20724 KB Output is correct
62 Correct 279 ms 20856 KB Output is correct
63 Correct 288 ms 20852 KB Output is correct
64 Correct 284 ms 20824 KB Output is correct
65 Correct 284 ms 20848 KB Output is correct
66 Correct 281 ms 20984 KB Output is correct
67 Correct 285 ms 20852 KB Output is correct
68 Correct 276 ms 20784 KB Output is correct