oj.uz

Submission #438141

# Submission time Handle Problem Language Result Execution time Memory
438141 2021-06-27T16:19:04 Z ToroTN Art Exhibition (JOI18_art) C++14
100 / 100
 233 ms 24992 KB 
#include<bits/stdc++.h>
using namespace std;
long long n,u_i,v_i,a[500005],mx;
vector<pair<long long,long long> > v;
int main()
{
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&u_i,&v_i);
        v.push_back(make_pair(u_i,v_i));
    }
    v.push_back(make_pair(-1e18,-1e18));
    sort(v.begin(),v.end());
    a[1]=v[1].second;
    mx=a[1];
    for(int i=2;i<=n;i++)
    {
        if(a[i-1]+v[i].second+v[i-1].first-v[i].first<0)
        {
            a[i]=0;
        }else
        {
            a[i]=a[i-1]+v[i].second+v[i-1].first-v[i].first;
        }
        a[i]=max(a[i],v[i].second);
        mx=max(mx,a[i]);
        mx=max(mx,v[i].second);
    }
    printf("%lld\n",mx);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
art.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         scanf("%lld%lld",&u_i,&v_i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 232 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 580 KB Output is correct
28 Correct 3 ms 684 KB Output is correct
29 Correct 3 ms 680 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 672 KB Output is correct
34 Correct 3 ms 636 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 612 KB Output is correct
37 Correct 3 ms 572 KB Output is correct
38 Correct 3 ms 588 KB Output is correct
39 Correct 4 ms 676 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 4 ms 572 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 3 ms 684 KB Output is correct
46 Correct 3 ms 588 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 3 ms 700 KB Output is correct
49 Correct 4 ms 588 KB Output is correct
50 Correct 3 ms 572 KB Output is correct
51 Correct 3 ms 588 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 232 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 580 KB Output is correct
28 Correct 3 ms 684 KB Output is correct
29 Correct 3 ms 680 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 672 KB Output is correct
34 Correct 3 ms 636 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 612 KB Output is correct
37 Correct 3 ms 572 KB Output is correct
38 Correct 3 ms 588 KB Output is correct
39 Correct 4 ms 676 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 4 ms 572 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 3 ms 684 KB Output is correct
46 Correct 3 ms 588 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 3 ms 700 KB Output is correct
49 Correct 4 ms 588 KB Output is correct
50 Correct 3 ms 572 KB Output is correct
51 Correct 3 ms 588 KB Output is correct
52 Correct 211 ms 24704 KB Output is correct
53 Correct 213 ms 24772 KB Output is correct
54 Correct 210 ms 24764 KB Output is correct
55 Correct 213 ms 24764 KB Output is correct
56 Correct 233 ms 24736 KB Output is correct
57 Correct 207 ms 24720 KB Output is correct
58 Correct 233 ms 24784 KB Output is correct
59 Correct 206 ms 24788 KB Output is correct
60 Correct 209 ms 24732 KB Output is correct
61 Correct 219 ms 24760 KB Output is correct
62 Correct 205 ms 24760 KB Output is correct
63 Correct 207 ms 24732 KB Output is correct
64 Correct 216 ms 24864 KB Output is correct
65 Correct 206 ms 24736 KB Output is correct
66 Correct 208 ms 24860 KB Output is correct
67 Correct 211 ms 24992 KB Output is correct
68 Correct 223 ms 24808 KB Output is correct