oj.uz

Submission #499993

# Submission time Handle Problem Language Result Execution time Memory
499993 2021-12-30T08:28:52 Z aSSSd Art Exhibition (JOI18_art) C++17
100 / 100
 194 ms 20864 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r)
{
    return l+rng()%(r-l+1);
}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define forinc(x,a,b) for(int x=a;x<=b;x++)
#define fordec(x,a,b) for(int x=a;x>=b;x--)
#define iii pair<ii,int>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ii pair<int,int>
#define mt make_tuple
#define getbit(x,i) ((x>>(i))&1)
#define batbit(x,i) (x|(1ll<<(i)))
#define tatbit(x,i) (x&~(1<<(i)))
#define endl '\n'
#define all(v) v.begin(), v.end()
#define gg exit(0);
#define int long long
const int N = 5e5 + 100;
ii a[N];
int n;
int sum,res;
signed main()
{
    fasty;
    cin >> n;
    forinc(i,1,n) cin >> a[i].fi >> a[i].se;
    sort(a+1,a+n+1);
    int best = a[1].fi;
    forinc(i,1,n)
    {
        sum+=a[i].se;
        res = max(res ,  sum - a[i].fi + best);
        best = max(best , a[i+1].fi - sum);
    }
    cout << res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 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 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 328 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 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 328 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 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 448 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 3 ms 500 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 3 ms 440 KB Output is correct
37 Correct 2 ms 472 KB Output is correct
38 Correct 2 ms 444 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 484 KB Output is correct
41 Correct 2 ms 524 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 2 ms 464 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 460 KB Output is correct
47 Correct 3 ms 456 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 472 KB Output is correct
51 Correct 2 ms 460 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 328 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 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 448 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 3 ms 500 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 3 ms 440 KB Output is correct
37 Correct 2 ms 472 KB Output is correct
38 Correct 2 ms 444 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 484 KB Output is correct
41 Correct 2 ms 524 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 2 ms 464 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 460 KB Output is correct
47 Correct 3 ms 456 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 472 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 172 ms 20736 KB Output is correct
53 Correct 177 ms 20804 KB Output is correct
54 Correct 170 ms 20760 KB Output is correct
55 Correct 164 ms 20740 KB Output is correct
56 Correct 174 ms 20828 KB Output is correct
57 Correct 192 ms 20720 KB Output is correct
58 Correct 171 ms 20864 KB Output is correct
59 Correct 167 ms 20764 KB Output is correct
60 Correct 176 ms 20756 KB Output is correct
61 Correct 177 ms 20520 KB Output is correct
62 Correct 180 ms 20688 KB Output is correct
63 Correct 192 ms 20836 KB Output is correct
64 Correct 186 ms 20768 KB Output is correct
65 Correct 194 ms 20712 KB Output is correct
66 Correct 170 ms 20760 KB Output is correct
67 Correct 172 ms 20756 KB Output is correct
68 Correct 171 ms 20712 KB Output is correct