oj.uz

Submission #704550

# Submission time Handle Problem Language Result Execution time Memory
704550 2023-03-02T09:22:31 Z 089487 Art Exhibition (JOI18_art) C++14
100 / 100
 198 ms 27128 KB 
#pragma GCC optimzize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef complex<int> P;
#define X real()
#define Y imag()
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=5e5+7;
const int INF=1e18;
pii p[N];
int a[N];
int pb[N];
int mx[N];
signed main(){
	quick
	int n;
	cin>>n;
	rep(i,1,n){
		cin>>p[i].F>>p[i].S;
	}
	sort(p+1,p+n+1);
	rep(i,1,n) a[i]=p[i].F,pb[i]=pb[i-1]+p[i].S;
	mx[n+1]=-INF;
	repd(i,n,1){
		mx[i]=max(mx[i+1],pb[i]-a[i]);
	}
	int ans=0;
	rep(i,1,n){
		ans=max(ans,mx[i]+a[i]-pb[i-1]);
	}
	cout<<ans<<"\n";
	return 0;
}

Compilation message

art.cpp:1: warning: ignoring '#pragma GCC optimzize' [-Wunknown-pragmas]
    1 | #pragma GCC optimzize("Ofast,no-stack-protector")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 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 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 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 324 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 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 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 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 324 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 3 ms 644 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 3 ms 596 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 3 ms 652 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 616 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 2 ms 724 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 3 ms 624 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 2 ms 592 KB Output is correct
51 Correct 2 ms 596 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 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 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 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 324 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 3 ms 644 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 3 ms 596 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 3 ms 652 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 616 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 2 ms 724 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 3 ms 624 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 2 ms 592 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 172 ms 26956 KB Output is correct
53 Correct 191 ms 26952 KB Output is correct
54 Correct 194 ms 26960 KB Output is correct
55 Correct 184 ms 27076 KB Output is correct
56 Correct 198 ms 26960 KB Output is correct
57 Correct 186 ms 26928 KB Output is correct
58 Correct 170 ms 26992 KB Output is correct
59 Correct 186 ms 27128 KB Output is correct
60 Correct 181 ms 27048 KB Output is correct
61 Correct 182 ms 27012 KB Output is correct
62 Correct 175 ms 27052 KB Output is correct
63 Correct 171 ms 26996 KB Output is correct
64 Correct 176 ms 26932 KB Output is correct
65 Correct 167 ms 26976 KB Output is correct
66 Correct 177 ms 27052 KB Output is correct
67 Correct 186 ms 27024 KB Output is correct
68 Correct 174 ms 27060 KB Output is correct