oj.uz

Submission #463682

# Submission time Handle Problem Language Result Execution time Memory
463682 2021-08-11T13:39:15 Z Blobo2_Blobo2 Art Exhibition (JOI18_art) C++14
100 / 100
 244 ms 20964 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}

signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    int n=nxt();
    vector<pair<int,int> >v;
    for(int i=0;i<n;i++)
        v.push_back({nxt(),nxt()});
    sort(all(v));
    int mx=v[0].second,ans=v[0].second,l=0;
    for(int i=1;i<n;i++){
        ans+=v[i].second;
        int x = ans - (v[i].first-v[l].first);
        if(x < v[i].second)
            l=i,ans=v[i].second,x=v[i].second;
        mx=max(x,mx);
    }
    cout<<mx;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 312 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 332 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 312 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 332 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 3 ms 588 KB Output is correct
28 Correct 3 ms 580 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 4 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 580 KB Output is correct
34 Correct 3 ms 568 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 576 KB Output is correct
37 Correct 3 ms 580 KB Output is correct
38 Correct 2 ms 576 KB Output is correct
39 Correct 3 ms 716 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 576 KB Output is correct
45 Correct 3 ms 552 KB Output is correct
46 Correct 3 ms 576 KB Output is correct
47 Correct 2 ms 588 KB Output is correct
48 Correct 3 ms 576 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 576 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 312 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 332 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 3 ms 588 KB Output is correct
28 Correct 3 ms 580 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 4 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 580 KB Output is correct
34 Correct 3 ms 568 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 576 KB Output is correct
37 Correct 3 ms 580 KB Output is correct
38 Correct 2 ms 576 KB Output is correct
39 Correct 3 ms 716 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 576 KB Output is correct
45 Correct 3 ms 552 KB Output is correct
46 Correct 3 ms 576 KB Output is correct
47 Correct 2 ms 588 KB Output is correct
48 Correct 3 ms 576 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 576 KB Output is correct
52 Correct 217 ms 20768 KB Output is correct
53 Correct 222 ms 20828 KB Output is correct
54 Correct 215 ms 20964 KB Output is correct
55 Correct 214 ms 20808 KB Output is correct
56 Correct 217 ms 20844 KB Output is correct
57 Correct 214 ms 20872 KB Output is correct
58 Correct 214 ms 20864 KB Output is correct
59 Correct 216 ms 20816 KB Output is correct
60 Correct 221 ms 20896 KB Output is correct
61 Correct 221 ms 20756 KB Output is correct
62 Correct 211 ms 20896 KB Output is correct
63 Correct 230 ms 20868 KB Output is correct
64 Correct 215 ms 20904 KB Output is correct
65 Correct 212 ms 20860 KB Output is correct
66 Correct 221 ms 20796 KB Output is correct
67 Correct 244 ms 20784 KB Output is correct
68 Correct 219 ms 20856 KB Output is correct