oj.uz

Submission #507545

# Submission time Handle Problem Language Result Execution time Memory
507545 2022-01-12T17:27:13 Z maco1503 Art Exhibition (JOI18_art) C++14
100 / 100
 198 ms 28692 KB 
#include <bits/stdc++.h>
#define rpd ios_base :: sync_with_stdio(0); cin.tie(0);
#define ll long long
#define fs first
#define sc second
#define pb push_back
#define mod 666013
#define NMAX 100000 + 5
#define inf LLONG_MAX

using namespace std;

pair < ll ,ll > v[500005];
ll s;
ll st[500005];
ll dr[500005];

int main()
{
    rpd;
     int n;
    cin>>n;
    for(int i=1;i<=n;++i)
    {
        ll  mar,val;
        cin>>mar >> val;
        v[i]={mar,val};
        s+=v[i].second;
    }

    sort(v+1,v+1+n);

    ll ans= s -v[n].first+v[1].first;

    long long sp=0;
    for(long long i=2;i<=n;++i)
    {
        sp+=v[i-1].sc;
        st[i]=v[i].fs-sp-v[1].fs;
        st[i]=max(st[i-1],st[i]);
    }

     sp=0;
    for(long long i=n-1;i>=1;--i)
    {
        sp+=v[i+1].sc;
        dr[i]=v[n].fs-sp-v[i].fs;
        dr[i]=max(dr[i],dr[i+1]);
    }
    ll ans2=0;
    for(int i=1;i<=n;i++)ans2=max(ans2,st[i]+dr[i]);
    cout<<ans+ans2;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 516 KB Output is correct
29 Correct 2 ms 580 KB Output is correct
30 Correct 2 ms 584 KB Output is correct
31 Correct 3 ms 580 KB Output is correct
32 Correct 2 ms 576 KB Output is correct
33 Correct 3 ms 580 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 2 ms 576 KB Output is correct
37 Correct 2 ms 588 KB Output is correct
38 Correct 2 ms 588 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 2 ms 564 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 2 ms 580 KB Output is correct
43 Correct 2 ms 588 KB Output is correct
44 Correct 2 ms 588 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 588 KB Output is correct
47 Correct 2 ms 588 KB Output is correct
48 Correct 2 ms 588 KB Output is correct
49 Correct 2 ms 588 KB Output is correct
50 Correct 3 ms 588 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 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 516 KB Output is correct
29 Correct 2 ms 580 KB Output is correct
30 Correct 2 ms 584 KB Output is correct
31 Correct 3 ms 580 KB Output is correct
32 Correct 2 ms 576 KB Output is correct
33 Correct 3 ms 580 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 2 ms 576 KB Output is correct
37 Correct 2 ms 588 KB Output is correct
38 Correct 2 ms 588 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 2 ms 564 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 2 ms 580 KB Output is correct
43 Correct 2 ms 588 KB Output is correct
44 Correct 2 ms 588 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 588 KB Output is correct
47 Correct 2 ms 588 KB Output is correct
48 Correct 2 ms 588 KB Output is correct
49 Correct 2 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 588 KB Output is correct
52 Correct 198 ms 25908 KB Output is correct
53 Correct 183 ms 27476 KB Output is correct
54 Correct 179 ms 27552 KB Output is correct
55 Correct 185 ms 27460 KB Output is correct
56 Correct 172 ms 28480 KB Output is correct
57 Correct 181 ms 28508 KB Output is correct
58 Correct 178 ms 28536 KB Output is correct
59 Correct 179 ms 27600 KB Output is correct
60 Correct 169 ms 28520 KB Output is correct
61 Correct 176 ms 28444 KB Output is correct
62 Correct 172 ms 28692 KB Output is correct
63 Correct 186 ms 27416 KB Output is correct
64 Correct 177 ms 28480 KB Output is correct
65 Correct 171 ms 28692 KB Output is correct
66 Correct 187 ms 27348 KB Output is correct
67 Correct 177 ms 28576 KB Output is correct
68 Correct 176 ms 28580 KB Output is correct