Submission #919975

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
919975	2024-02-02T00:19:28 Z	thunopro	Art Exhibition (JOI18_art)	C++14	100 / 100	140 ms	25368 KB

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 500009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7; 
const int INF = 1e9; 

typedef vector<int> vi; 
typedef pair<int,int> pii;
typedef vector<pii> vii;  
typedef vector<ll> vl;

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a > mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ;
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

typedef pair<ll,ll> pll ; 
int n ; 
pll a [maxn] ; 
ll sum [maxn] ; 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i].fi >> a[i].se ;
	sort (a+1,a+n+1) ; 
	for ( int i = 1 ; i <= n ; i ++ ) sum [i] = sum [i-1] + a[i].se ; 
	ll Min = 0 ; 
	ll res = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		chkmax (res,a[i].se) ; 
		chkmax (res,sum[i]-a[i].fi-Min) ; 
		chkmin (Min,sum[i-1]-a[i].fi) ; 	
	} 
	cout << res ; 
}

Compilation message

art.cpp: In function 'void rf()':
art.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	1 ms	2648 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2392 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2904 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2392 KB	Output is correct
24	Correct	1 ms	2648 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	2 ms	2648 KB	Output is correct
28	Correct	2 ms	2648 KB	Output is correct
29	Correct	2 ms	2648 KB	Output is correct
30	Correct	2 ms	2648 KB	Output is correct
31	Correct	2 ms	2648 KB	Output is correct
32	Correct	2 ms	2648 KB	Output is correct
33	Correct	2 ms	2648 KB	Output is correct
34	Correct	2 ms	2648 KB	Output is correct
35	Correct	2 ms	2648 KB	Output is correct
36	Correct	2 ms	2648 KB	Output is correct
37	Correct	2 ms	2648 KB	Output is correct
38	Correct	2 ms	2648 KB	Output is correct
39	Correct	2 ms	2648 KB	Output is correct
40	Correct	2 ms	2648 KB	Output is correct
41	Correct	2 ms	2648 KB	Output is correct
42	Correct	2 ms	2648 KB	Output is correct
43	Correct	2 ms	2648 KB	Output is correct
44	Correct	2 ms	2648 KB	Output is correct
45	Correct	2 ms	2648 KB	Output is correct
46	Correct	2 ms	2652 KB	Output is correct
47	Correct	2 ms	2648 KB	Output is correct
48	Correct	2 ms	2648 KB	Output is correct
49	Correct	3 ms	2904 KB	Output is correct
50	Correct	2 ms	2652 KB	Output is correct
51	Correct	2 ms	2648 KB	Output is correct
52	Correct	133 ms	22152 KB	Output is correct
53	Correct	131 ms	25368 KB	Output is correct
54	Correct	128 ms	24632 KB	Output is correct
55	Correct	131 ms	24724 KB	Output is correct
56	Correct	140 ms	24656 KB	Output is correct
57	Correct	128 ms	24656 KB	Output is correct
58	Correct	133 ms	24624 KB	Output is correct
59	Correct	135 ms	24632 KB	Output is correct
60	Correct	131 ms	24580 KB	Output is correct
61	Correct	130 ms	24656 KB	Output is correct
62	Correct	135 ms	24656 KB	Output is correct
63	Correct	130 ms	24656 KB	Output is correct
64	Correct	135 ms	24628 KB	Output is correct
65	Correct	133 ms	25200 KB	Output is correct
66	Correct	134 ms	24656 KB	Output is correct
67	Correct	133 ms	24756 KB	Output is correct
68	Correct	131 ms	24656 KB	Output is correct

Submission #919975

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