Submission #237389

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
237389	2020-06-06T11:40:32 Z	uacoder123	Art Exhibition (JOI18_art)	C++14	100 / 100	803 ms	28796 KB

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <ii,lli> iii;
typedef vector <lli> vi;
 
int main()
{
    lli n;
    cin>>n;
    ii av[n];
    lli p[n+1],dp[n],m;
    p[0]=0;
    for(int i=0;i<n;++i)
        cin>>av[i].F>>av[i].S;
    sort(av,av+n);
    for(int i=0;i<n;++i)
        p[i+1]=p[i]+av[i].S;
    dp[n-1]=av[n-1].S;
    m=dp[n-1];
    for(int i=n-2;i>=0;--i)
    {
        dp[i]=max(av[i].S,dp[i+1]+av[i].S-av[i+1].F+av[i].F);
        m=max(m,dp[i]);
    }
    cout<<m<<endl;
    return(0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	256 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	6 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	6 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	6 ms	256 KB	Output is correct
27	Correct	12 ms	640 KB	Output is correct
28	Correct	13 ms	640 KB	Output is correct
29	Correct	13 ms	640 KB	Output is correct
30	Correct	13 ms	640 KB	Output is correct
31	Correct	12 ms	640 KB	Output is correct
32	Correct	12 ms	640 KB	Output is correct
33	Correct	13 ms	640 KB	Output is correct
34	Correct	12 ms	640 KB	Output is correct
35	Correct	12 ms	640 KB	Output is correct
36	Correct	12 ms	640 KB	Output is correct
37	Correct	13 ms	640 KB	Output is correct
38	Correct	14 ms	640 KB	Output is correct
39	Correct	14 ms	640 KB	Output is correct
40	Correct	13 ms	640 KB	Output is correct
41	Correct	12 ms	640 KB	Output is correct
42	Correct	13 ms	640 KB	Output is correct
43	Correct	13 ms	640 KB	Output is correct
44	Correct	14 ms	640 KB	Output is correct
45	Correct	12 ms	640 KB	Output is correct
46	Correct	12 ms	640 KB	Output is correct
47	Correct	13 ms	640 KB	Output is correct
48	Correct	12 ms	640 KB	Output is correct
49	Correct	12 ms	640 KB	Output is correct
50	Correct	13 ms	640 KB	Output is correct
51	Correct	13 ms	640 KB	Output is correct
52	Correct	794 ms	28536 KB	Output is correct
53	Correct	803 ms	28664 KB	Output is correct
54	Correct	791 ms	28796 KB	Output is correct
55	Correct	803 ms	28664 KB	Output is correct
56	Correct	798 ms	28664 KB	Output is correct
57	Correct	788 ms	28668 KB	Output is correct
58	Correct	791 ms	28536 KB	Output is correct
59	Correct	789 ms	28536 KB	Output is correct
60	Correct	782 ms	28664 KB	Output is correct
61	Correct	785 ms	28536 KB	Output is correct
62	Correct	790 ms	28664 KB	Output is correct
63	Correct	793 ms	28536 KB	Output is correct
64	Correct	789 ms	28536 KB	Output is correct
65	Correct	788 ms	28664 KB	Output is correct
66	Correct	784 ms	28536 KB	Output is correct
67	Correct	790 ms	28536 KB	Output is correct
68	Correct	786 ms	28664 KB	Output is correct

Submission #237389

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