oj.uz

Submission #1071325

# Submission time Handle Problem Language Result Execution time Memory
1071325 2024-08-23T06:42:10 Z vjudge1 Art Exhibition (JOI18_art) C++17
30 / 100
 33 ms 2532 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;

const int N = 5e5 + 11;
pair<int, int> a[N];
int pref[N];
int cost(int i, int j) {
    int sum = pref[j] - pref[i - 1];
    int mx = a[j].fi, mn = a[i].fi;
    return sum - (mx - mn);
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    
    for(int i = 1; i <= n; i++){
        cin>>a[i].fi>>a[i].se;
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + a[i].se;
    }
    int res = 0;
    for(int i = 1; i <= n; i++){
        int l = i, r = n, ans = 0;
        for(int j = 1; j <= 777; j++){
            int m1 = l + (r - l) / 3;
            int m2 = r - (r - l) / 3;
            ans = max({ans, cost(i, m1), cost(i, m2)});
            if(cost(i, m1) < cost(i, m2))l = m1;
            else r = m2;
        }
        for(int j = -444; j <= 444; j++){
            if((l + j) >= i && (l + j) <= n) {
                if(cost(i, l + j) > ans)ans = cost(i, l + j);
            }
        }
        res = max(res, ans);
    }
    cout << res << '\n';
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2512 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2444 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2392 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 30 ms 2392 KB Output is correct
28 Correct 30 ms 2396 KB Output is correct
29 Correct 33 ms 2396 KB Output is correct
30 Correct 30 ms 2532 KB Output is correct
31 Correct 31 ms 2396 KB Output is correct
32 Correct 30 ms 2392 KB Output is correct
33 Correct 30 ms 2396 KB Output is correct
34 Correct 30 ms 2396 KB Output is correct
35 Correct 30 ms 2392 KB Output is correct
36 Correct 30 ms 2396 KB Output is correct
37 Correct 31 ms 2396 KB Output is correct
38 Correct 30 ms 2396 KB Output is correct
39 Correct 30 ms 2392 KB Output is correct
40 Correct 30 ms 2396 KB Output is correct
41 Correct 29 ms 2396 KB Output is correct
42 Incorrect 29 ms 2396 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2512 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2444 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2392 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 30 ms 2392 KB Output is correct
28 Correct 30 ms 2396 KB Output is correct
29 Correct 33 ms 2396 KB Output is correct
30 Correct 30 ms 2532 KB Output is correct
31 Correct 31 ms 2396 KB Output is correct
32 Correct 30 ms 2392 KB Output is correct
33 Correct 30 ms 2396 KB Output is correct
34 Correct 30 ms 2396 KB Output is correct
35 Correct 30 ms 2392 KB Output is correct
36 Correct 30 ms 2396 KB Output is correct
37 Correct 31 ms 2396 KB Output is correct
38 Correct 30 ms 2396 KB Output is correct
39 Correct 30 ms 2392 KB Output is correct
40 Correct 30 ms 2396 KB Output is correct
41 Correct 29 ms 2396 KB Output is correct
42 Incorrect 29 ms 2396 KB Output isn't correct
43 Halted 0 ms 0 KB -