답안 #1049969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049969	2024-08-09T06:28:51 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	134 ms	28860 KB

/*
Author: ArifKraw
Rating: 1379
Goal#1: Beat I_Love_Trott ))))
Goal#2: Not to allow FractalFrog beat myself
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define ppf pop_front
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define ld long double
#define nl '\n'
const ll N = 5e5 + 7;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ld pi = 3.141592653589793;
const ld eps = 1e-12;
const ll zero = 0;
const int MAX = 1e6+5;
const int A = 1e9 + 5;
/*if you cant solve the problem:
try optimized(clever) brute-force;
try prefix sums with/or binary search
try dp
try dfs
try to solve in reversed orderr
try math
try to sort(sort(a+1,a+1+n)
int overflow, array bounds
think about special cases( n=1?)
*/
ll xx1[8]={0, 0,-1, 1, 1,-1, 1,-1};
ll xx2[8]={1,-1, 0, 0, 1, 1,-1,-1};

pair<ll,ll> a[N];
ll pref[N],mxx[N];
void egoist(){
	ll n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].ff>>a[i].ss;
    }
    sort(a+1,a+n+1);
    ll val=0,pos2=0,val2=0,mx=0;
    reverse(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        pref[i]=pref[i-1]+a[i].ss;
    }
    for(int i=n;i>=1;i--){
        mxx[i]=max(mxx[i+1],pref[i]+a[i].ff);
    }
    for(int i=1;i<=n;i++){
        val=-a[i].ff;
        mx=max(val+mxx[i]-pref[i-1],mx);
    }
    cout<<mx;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//freopen("sparse.in", "r", stdin);
    //freopen("sparse.out", "w", stdout);
	egoist();
}

Compilation message

art.cpp: In function 'void egoist()':
art.cpp:52:14: warning: unused variable 'pos2' [-Wunused-variable]
   52 |     ll val=0,pos2=0,val2=0,mx=0;
      |              ^~~~
art.cpp:52:21: warning: unused variable 'val2' [-Wunused-variable]
   52 |     ll val=0,pos2=0,val2=0,mx=0;
      |                     ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	0 ms	2520 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2652 KB	Output is correct
28	Correct	1 ms	2628 KB	Output is correct
29	Correct	1 ms	2652 KB	Output is correct
30	Correct	1 ms	2532 KB	Output is correct
31	Correct	1 ms	2528 KB	Output is correct
32	Correct	1 ms	2636 KB	Output is correct
33	Correct	2 ms	2648 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2652 KB	Output is correct
36	Correct	1 ms	2652 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	1 ms	2652 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	1 ms	2652 KB	Output is correct
42	Correct	1 ms	2700 KB	Output is correct
43	Correct	1 ms	2652 KB	Output is correct
44	Correct	1 ms	2652 KB	Output is correct
45	Correct	1 ms	2652 KB	Output is correct
46	Correct	1 ms	2628 KB	Output is correct
47	Correct	1 ms	2648 KB	Output is correct
48	Correct	1 ms	2532 KB	Output is correct
49	Correct	1 ms	2652 KB	Output is correct
50	Correct	1 ms	2652 KB	Output is correct
51	Correct	1 ms	2652 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	0 ms	2520 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2652 KB	Output is correct
28	Correct	1 ms	2628 KB	Output is correct
29	Correct	1 ms	2652 KB	Output is correct
30	Correct	1 ms	2532 KB	Output is correct
31	Correct	1 ms	2528 KB	Output is correct
32	Correct	1 ms	2636 KB	Output is correct
33	Correct	2 ms	2648 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2652 KB	Output is correct
36	Correct	1 ms	2652 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	1 ms	2652 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	1 ms	2652 KB	Output is correct
42	Correct	1 ms	2700 KB	Output is correct
43	Correct	1 ms	2652 KB	Output is correct
44	Correct	1 ms	2652 KB	Output is correct
45	Correct	1 ms	2652 KB	Output is correct
46	Correct	1 ms	2628 KB	Output is correct
47	Correct	1 ms	2648 KB	Output is correct
48	Correct	1 ms	2532 KB	Output is correct
49	Correct	1 ms	2652 KB	Output is correct
50	Correct	1 ms	2652 KB	Output is correct
51	Correct	1 ms	2652 KB	Output is correct
52	Correct	106 ms	28500 KB	Output is correct
53	Correct	98 ms	28500 KB	Output is correct
54	Correct	97 ms	28496 KB	Output is correct
55	Correct	99 ms	28500 KB	Output is correct
56	Correct	96 ms	28500 KB	Output is correct
57	Correct	105 ms	28600 KB	Output is correct
58	Correct	96 ms	28600 KB	Output is correct
59	Correct	97 ms	28544 KB	Output is correct
60	Correct	96 ms	28600 KB	Output is correct
61	Correct	109 ms	28496 KB	Output is correct
62	Correct	96 ms	28728 KB	Output is correct
63	Correct	98 ms	28728 KB	Output is correct
64	Correct	97 ms	28616 KB	Output is correct
65	Correct	95 ms	28500 KB	Output is correct
66	Correct	134 ms	28860 KB	Output is correct
67	Correct	97 ms	28612 KB	Output is correct
68	Correct	96 ms	28496 KB	Output is correct

답안 #1049969

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