Submission #300130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
300130	2020-09-16T19:15:49 Z	CSQ31	Art Exhibition (JOI18_art)	C++14	100 / 100	223 ms	19176 KB

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	//exchange argument,always optimal to take whole prefix,
	ll n;
	cin>>n;
	vector<PII>art(n);
	ll ans = 0;
	for(int i=0;i<n;i++){
		cin>>art[i].fi>>art[i].se;
	}
	sort(all(art));
	vector<PII>a;
	for(int i=0;i<n;i++){
		int j = i;
		ll w = art[i].se;
		while(j+1 < n && art[j+1].fi == art[i].fi){
			j++;
			w+=art[j].se;
		}
		ans = max(ans,w);
		a.pb({art[i].fi,w});
		i = j;
	}
	ll mx = 0;
	n = a.size();
	//for(int i=0;i<n;i++)cout<<a[i].fi<<","<<a[i].se<<" ";
	///cout<<'\n';
	for(int i=0;i<n;i++){
		mx = max(mx,a[i].fi);
		mx+=a[i].se;
		ans = max(ans,mx-a[i].fi);
			
	}
	cout<<ans;
	
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	512 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 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	1 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	512 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	1 ms	512 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	512 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 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	1 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	512 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	1 ms	512 KB	Output is correct
27	Correct	2 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	2 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	2 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	2 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	2 ms	640 KB	Output is correct
42	Correct	2 ms	640 KB	Output is correct
43	Correct	2 ms	640 KB	Output is correct
44	Correct	3 ms	640 KB	Output is correct
45	Correct	2 ms	640 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	3 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	640 KB	Output is correct
51	Correct	2 ms	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	512 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 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	1 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	512 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	1 ms	512 KB	Output is correct
27	Correct	2 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	2 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	2 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	2 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	2 ms	640 KB	Output is correct
42	Correct	2 ms	640 KB	Output is correct
43	Correct	2 ms	640 KB	Output is correct
44	Correct	3 ms	640 KB	Output is correct
45	Correct	2 ms	640 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	3 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	640 KB	Output is correct
51	Correct	2 ms	640 KB	Output is correct
52	Correct	203 ms	16616 KB	Output is correct
53	Correct	218 ms	19176 KB	Output is correct
54	Correct	202 ms	19176 KB	Output is correct
55	Correct	203 ms	19176 KB	Output is correct
56	Correct	201 ms	19048 KB	Output is correct
57	Correct	207 ms	19048 KB	Output is correct
58	Correct	213 ms	19048 KB	Output is correct
59	Correct	207 ms	19048 KB	Output is correct
60	Correct	210 ms	19052 KB	Output is correct
61	Correct	223 ms	19048 KB	Output is correct
62	Correct	201 ms	19048 KB	Output is correct
63	Correct	201 ms	19176 KB	Output is correct
64	Correct	202 ms	19048 KB	Output is correct
65	Correct	201 ms	19048 KB	Output is correct
66	Correct	200 ms	19048 KB	Output is correct
67	Correct	201 ms	19052 KB	Output is correct
68	Correct	203 ms	19048 KB	Output is correct

Submission #300130

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