Submission #895786

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
895786	2023-12-30T20:35:21 Z	Minbaev	Art Exhibition (JOI18_art)	C++17	100 / 100	521 ms	54744 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e17 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}
void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<pii>v;
	map<int,int>mp;
	for(int i = 1;i<=n;i++){
		cin>>m>>k;
		mp[m] += k;
	}
	
	for(auto to:mp)
		v.pb(to);
	
	//~ for(auto to:v)cout<<to.s<<" ";
	
	int ans = -1 * mod;
	int sum = 0,lo = 0;
	
	for(int i = 0;i<v.size();i++){
		umin(lo,sum-v[i].f);
		sum += v[i].s;
		umax(ans,sum - v[i].f - lo);
	}
	cout<<ans<<"\n";
	
	
	
}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message

art.cpp: In function 'void solve()':
art.cpp:50:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i = 0;i<v.size();i++){
      |                ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	3 ms	860 KB	Output is correct
28	Correct	2 ms	856 KB	Output is correct
29	Correct	2 ms	856 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	1056 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	860 KB	Output is correct
40	Correct	2 ms	856 KB	Output is correct
41	Correct	2 ms	860 KB	Output is correct
42	Correct	2 ms	912 KB	Output is correct
43	Correct	2 ms	1112 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	2 ms	856 KB	Output is correct
49	Correct	2 ms	856 KB	Output is correct
50	Correct	3 ms	860 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	474 ms	41412 KB	Output is correct
53	Correct	493 ms	53244 KB	Output is correct
54	Correct	475 ms	53224 KB	Output is correct
55	Correct	438 ms	52744 KB	Output is correct
56	Correct	474 ms	54692 KB	Output is correct
57	Correct	452 ms	52916 KB	Output is correct
58	Correct	472 ms	53176 KB	Output is correct
59	Correct	421 ms	52668 KB	Output is correct
60	Correct	430 ms	52920 KB	Output is correct
61	Correct	481 ms	54260 KB	Output is correct
62	Correct	462 ms	53212 KB	Output is correct
63	Correct	502 ms	54368 KB	Output is correct
64	Correct	510 ms	53528 KB	Output is correct
65	Correct	452 ms	54744 KB	Output is correct
66	Correct	461 ms	53984 KB	Output is correct
67	Correct	521 ms	53024 KB	Output is correct
68	Correct	413 ms	53176 KB	Output is correct

Submission #895786

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