oj.uz

Submission #108779

# Submission time Handle Problem Language Result Execution time Memory
108779 2019-05-01T22:18:50 Z thebes Art Exhibition (JOI18_art) C++14
100 / 100
 281 ms 24824 KB 
#include <bits/stdc++.h>
using namespace std;

const int MN = 5e5+5;
typedef long long ll;
ll psa[MN], n, i, x, y, ans, mx;
pair<ll,ll> arr[MN];

int main(){
    for(scanf("%lld",&n),i=1;i<=n;i++){
        scanf("%lld%lld",&arr[i].first,&arr[i].second);
    }
    sort(arr+1,arr+n+1,[](pair<ll,ll>i,pair<ll,ll>j){return i.first<j.first;});
    for(i=1;i<=n;i++){
        psa[i]=psa[i-1]+arr[i].second-(arr[i].first-arr[i-1].first);
    }
    mx = -1LL<<60; ans = -1LL<<60;
    for(i=n;i>=1;i--){
        mx = max(mx, psa[i]);
        ans = max(ans, mx-psa[i-1]+arr[i].first-arr[i-1].first);
    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%lld",&n),i=1;i<=n;i++){
         ~~~~~~~~~~~~~~~~^~~~
art.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&arr[i].first,&arr[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 300 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 4 ms 508 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 640 KB Output is correct
33 Correct 5 ms 640 KB Output is correct
34 Correct 4 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 4 ms 512 KB Output is correct
39 Correct 4 ms 640 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 5 ms 640 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 8 ms 640 KB Output is correct
44 Correct 4 ms 640 KB Output is correct
45 Correct 5 ms 512 KB Output is correct
46 Correct 5 ms 640 KB Output is correct
47 Correct 6 ms 640 KB Output is correct
48 Correct 5 ms 640 KB Output is correct
49 Correct 5 ms 640 KB Output is correct
50 Correct 4 ms 640 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 247 ms 24796 KB Output is correct
53 Correct 269 ms 24768 KB Output is correct
54 Correct 232 ms 24660 KB Output is correct
55 Correct 219 ms 24824 KB Output is correct
56 Correct 235 ms 24732 KB Output is correct
57 Correct 264 ms 24776 KB Output is correct
58 Correct 227 ms 24668 KB Output is correct
59 Correct 223 ms 24696 KB Output is correct
60 Correct 223 ms 24824 KB Output is correct
61 Correct 281 ms 24568 KB Output is correct
62 Correct 242 ms 24696 KB Output is correct
63 Correct 230 ms 24696 KB Output is correct
64 Correct 237 ms 24824 KB Output is correct
65 Correct 232 ms 24752 KB Output is correct
66 Correct 229 ms 24696 KB Output is correct
67 Correct 239 ms 24824 KB Output is correct
68 Correct 253 ms 24812 KB Output is correct