Submission #254208

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
254208	2020-07-29T14:33:11 Z	Atill83	Art Exhibition (JOI18_art)	C++14	100 / 100	227 ms	24956 KB

#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 5e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
ll pre[MAXN];

struct p{
    ll v, s;
    bool operator < (p other) const{
        if(s == other.s){
            return v < other.v;
        }
        return s < other.s;
    };
} ps[MAXN];


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 0; i < n; i++){
        cin>>ps[i].s>>ps[i].v;
    }

    sort(ps, ps + n);
    
    pre[0] = ps[0].v;
    
    for(int i = 1; i < n; i++){
        pre[i] = pre[i - 1] + ps[i].v;
    }
    
    ll ans = ps[0].v,
       mx = ps[0].s;

    for(int i = 1; i < n; i++){
        ans = max(ans, pre[i] - ps[i].s + mx);
        ans = max(ans, ps[i].v);
        mx = max(mx, -pre[i - 1] + ps[i].s);
    }

    cout<<ans<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	3 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	640 KB	Output is correct
31	Correct	3 ms	640 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	2 ms	640 KB	Output is correct
34	Correct	3 ms	640 KB	Output is correct
35	Correct	2 ms	640 KB	Output is correct
36	Correct	2 ms	640 KB	Output is correct
37	Correct	3 ms	640 KB	Output is correct
38	Correct	2 ms	640 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	640 KB	Output is correct
42	Correct	3 ms	640 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	2 ms	640 KB	Output is correct
45	Correct	3 ms	564 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	2 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	3 ms	640 KB	Output is correct
50	Correct	3 ms	640 KB	Output is correct
51	Correct	3 ms	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	3 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	640 KB	Output is correct
31	Correct	3 ms	640 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	2 ms	640 KB	Output is correct
34	Correct	3 ms	640 KB	Output is correct
35	Correct	2 ms	640 KB	Output is correct
36	Correct	2 ms	640 KB	Output is correct
37	Correct	3 ms	640 KB	Output is correct
38	Correct	2 ms	640 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	640 KB	Output is correct
42	Correct	3 ms	640 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	2 ms	640 KB	Output is correct
45	Correct	3 ms	564 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	2 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	3 ms	640 KB	Output is correct
50	Correct	3 ms	640 KB	Output is correct
51	Correct	3 ms	640 KB	Output is correct
52	Correct	216 ms	24696 KB	Output is correct
53	Correct	210 ms	24696 KB	Output is correct
54	Correct	226 ms	24956 KB	Output is correct
55	Correct	227 ms	24696 KB	Output is correct
56	Correct	219 ms	24696 KB	Output is correct
57	Correct	216 ms	24696 KB	Output is correct
58	Correct	220 ms	24696 KB	Output is correct
59	Correct	218 ms	24952 KB	Output is correct
60	Correct	225 ms	24696 KB	Output is correct
61	Correct	221 ms	24568 KB	Output is correct
62	Correct	219 ms	24708 KB	Output is correct
63	Correct	222 ms	24696 KB	Output is correct
64	Correct	221 ms	24748 KB	Output is correct
65	Correct	215 ms	24952 KB	Output is correct
66	Correct	225 ms	24708 KB	Output is correct
67	Correct	221 ms	24696 KB	Output is correct
68	Correct	213 ms	24696 KB	Output is correct

Submission #254208

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0