답안 #547319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547319	2022-04-10T11:47:55 Z	tmn2005	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24848 KB

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;

#define fr first
#define sc second

#define mk make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define int long long
#define pii pair<int,int>
#define piii pair<int,pii>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0), cin.tie(0)
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 5e5 + 12;
int n, m, k, a, b, c, d, pref[N];
vector<pii>v;

void solve(){
	cin>>n;
	v.pb({0, 0});
	for(int i=0; i<n; i++){
		int x, y;
		cin>>x>>y;
		v.pb({x, y});
	}sort(all(v));
	
	for(int i=1; i<=n; i++){
		pref[i] = pref[i-1] + v[i].sc;
	}
	int l = 0, res = 0;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=i; j++){
			res = max(res, pref[i] - pref[j-1] - v[i].fr + v[j].fr);			
		}
	}
	cout<<res<<"\n";
}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message

art.cpp: In function 'void solve()':
art.cpp:43:6: warning: unused variable 'l' [-Wunused-variable]
   43 |  int l = 0, res = 0;
      |      ^
art.cpp: At global scope:
art.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	15 ms	596 KB	Output is correct
28	Correct	15 ms	596 KB	Output is correct
29	Correct	16 ms	596 KB	Output is correct
30	Correct	15 ms	712 KB	Output is correct
31	Correct	17 ms	608 KB	Output is correct
32	Correct	14 ms	712 KB	Output is correct
33	Correct	20 ms	596 KB	Output is correct
34	Correct	21 ms	628 KB	Output is correct
35	Correct	17 ms	712 KB	Output is correct
36	Correct	18 ms	596 KB	Output is correct
37	Correct	15 ms	720 KB	Output is correct
38	Correct	16 ms	596 KB	Output is correct
39	Correct	16 ms	724 KB	Output is correct
40	Correct	16 ms	596 KB	Output is correct
41	Correct	16 ms	636 KB	Output is correct
42	Correct	16 ms	632 KB	Output is correct
43	Correct	15 ms	640 KB	Output is correct
44	Correct	17 ms	600 KB	Output is correct
45	Correct	19 ms	596 KB	Output is correct
46	Correct	18 ms	688 KB	Output is correct
47	Correct	20 ms	628 KB	Output is correct
48	Correct	15 ms	596 KB	Output is correct
49	Correct	17 ms	664 KB	Output is correct
50	Correct	16 ms	636 KB	Output is correct
51	Correct	18 ms	600 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	15 ms	596 KB	Output is correct
28	Correct	15 ms	596 KB	Output is correct
29	Correct	16 ms	596 KB	Output is correct
30	Correct	15 ms	712 KB	Output is correct
31	Correct	17 ms	608 KB	Output is correct
32	Correct	14 ms	712 KB	Output is correct
33	Correct	20 ms	596 KB	Output is correct
34	Correct	21 ms	628 KB	Output is correct
35	Correct	17 ms	712 KB	Output is correct
36	Correct	18 ms	596 KB	Output is correct
37	Correct	15 ms	720 KB	Output is correct
38	Correct	16 ms	596 KB	Output is correct
39	Correct	16 ms	724 KB	Output is correct
40	Correct	16 ms	596 KB	Output is correct
41	Correct	16 ms	636 KB	Output is correct
42	Correct	16 ms	632 KB	Output is correct
43	Correct	15 ms	640 KB	Output is correct
44	Correct	17 ms	600 KB	Output is correct
45	Correct	19 ms	596 KB	Output is correct
46	Correct	18 ms	688 KB	Output is correct
47	Correct	20 ms	628 KB	Output is correct
48	Correct	15 ms	596 KB	Output is correct
49	Correct	17 ms	664 KB	Output is correct
50	Correct	16 ms	636 KB	Output is correct
51	Correct	18 ms	600 KB	Output is correct
52	Execution timed out	1056 ms	24848 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #547319

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0