oj.uz

답안 #704217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704217 2023-03-02T00:53:35 Z alanl Art Exhibition (JOI18_art) C++14
100 / 100
 171 ms 20684 KB 
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define rep(X, a,b) for(int X=a;X<b;++X)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (int)(a).size()
#define NL "\n"
using namespace std;
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef long long ll;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << "," << p.second << ')'; }
template<typename A> ostream& operator<<(ostream &os, const vector<A> &p){
	for(const auto &a:p)
		os << a << " ";
	os << "\n";
	return os;
}

typedef pair<ll, pll> ppp;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n;
	cin>>n;
	vector<pll> v(n);
	rep(i,0,n) cin>>v[i].F>>v[i].S;
	sort(ALL(v));
	ll ans=0, tot=0, mx=0;
	rep(i,0,n){
		mx=max(mx, v[i].F-tot);
		tot+=v[i].S;
		ans=max(ans, tot-v[i].F+mx);
	}
	cout<<ans<<NL;
	// ll n, m;
	// cin>>n>>m;
	// vector<string> grid(n);
	// vector<vector<ll>> dp(n, vector<ll>(0,m));
	// rep(i,0,n) cin>>grid[i];
	// ll ans=0;
	// rep(i,0,n){
	// 	rep(j,0,m){
	// 		if(grid[i][j]!='R') continue;
	// 		//right
	// 		if(m-j>=2){
	// 			if(grid[i][j+1]=='G' && grid[i][j+2]=='W'){
	// 			}
	// 		}
	// 		if(n-i>=2){
	// 			;
	// 		}
	// 		if(j-m>=2){
	// 			;
	// 		}
	// 		if(i-n>=2){
	// 			;
	// 		}
	// 	}
	// }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 524 KB Output is correct
34 Correct 2 ms 516 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 528 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 528 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 524 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 2 ms 508 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 464 KB Output is correct
51 Correct 2 ms 468 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 524 KB Output is correct
34 Correct 2 ms 516 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 528 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 528 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 524 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 2 ms 508 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 464 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 171 ms 20676 KB Output is correct
53 Correct 167 ms 20680 KB Output is correct
54 Correct 161 ms 20672 KB Output is correct
55 Correct 160 ms 20672 KB Output is correct
56 Correct 162 ms 20684 KB Output is correct
57 Correct 164 ms 20668 KB Output is correct
58 Correct 159 ms 20684 KB Output is correct
59 Correct 158 ms 20672 KB Output is correct
60 Correct 167 ms 20672 KB Output is correct
61 Correct 161 ms 20540 KB Output is correct
62 Correct 162 ms 20684 KB Output is correct
63 Correct 162 ms 20684 KB Output is correct
64 Correct 164 ms 20668 KB Output is correct
65 Correct 162 ms 20668 KB Output is correct
66 Correct 159 ms 20672 KB Output is correct
67 Correct 166 ms 20680 KB Output is correct
68 Correct 160 ms 20672 KB Output is correct