답안 #359247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
359247 2021-01-26T13:53:03 Z AmineWeslati Art Exhibition (JOI18_art) C++14
100 / 100
213 ms 25060 KB
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int32_t main() {
    boost; IO();

    int N; cin>>N;
    vpi vec;
    FOR(i,0,N){
    	int a,b; cin>>a>>b;
    	vec.eb(a,b);
    }
    sort(all(vec));

    int dp[N],ans=0;
    FOR(i,0,N){
    	dp[i]=vec[i].fi+vec[i].se;
    	if(i){
    		ckmax(dp[i],dp[i-1]+vec[i].se);
    	}
    	ckmax(ans,dp[i]-vec[i].fi);
    }
    cout << ans << endl;

    

    return 0;
}
//Change your approach 
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 4 ms 748 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 3 ms 748 KB Output is correct
36 Correct 3 ms 748 KB Output is correct
37 Correct 3 ms 748 KB Output is correct
38 Correct 3 ms 748 KB Output is correct
39 Correct 3 ms 748 KB Output is correct
40 Correct 3 ms 748 KB Output is correct
41 Correct 3 ms 896 KB Output is correct
42 Correct 3 ms 876 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 748 KB Output is correct
45 Correct 3 ms 748 KB Output is correct
46 Correct 3 ms 748 KB Output is correct
47 Correct 3 ms 748 KB Output is correct
48 Correct 3 ms 748 KB Output is correct
49 Correct 3 ms 748 KB Output is correct
50 Correct 2 ms 748 KB Output is correct
51 Correct 3 ms 764 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 4 ms 748 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 3 ms 748 KB Output is correct
36 Correct 3 ms 748 KB Output is correct
37 Correct 3 ms 748 KB Output is correct
38 Correct 3 ms 748 KB Output is correct
39 Correct 3 ms 748 KB Output is correct
40 Correct 3 ms 748 KB Output is correct
41 Correct 3 ms 896 KB Output is correct
42 Correct 3 ms 876 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 748 KB Output is correct
45 Correct 3 ms 748 KB Output is correct
46 Correct 3 ms 748 KB Output is correct
47 Correct 3 ms 748 KB Output is correct
48 Correct 3 ms 748 KB Output is correct
49 Correct 3 ms 748 KB Output is correct
50 Correct 2 ms 748 KB Output is correct
51 Correct 3 ms 764 KB Output is correct
52 Correct 211 ms 24872 KB Output is correct
53 Correct 213 ms 24912 KB Output is correct
54 Correct 205 ms 24912 KB Output is correct
55 Correct 206 ms 25000 KB Output is correct
56 Correct 205 ms 24912 KB Output is correct
57 Correct 208 ms 25060 KB Output is correct
58 Correct 212 ms 25048 KB Output is correct
59 Correct 212 ms 24912 KB Output is correct
60 Correct 206 ms 24912 KB Output is correct
61 Correct 206 ms 24784 KB Output is correct
62 Correct 204 ms 24936 KB Output is correct
63 Correct 207 ms 24912 KB Output is correct
64 Correct 206 ms 24912 KB Output is correct
65 Correct 207 ms 24912 KB Output is correct
66 Correct 208 ms 24912 KB Output is correct
67 Correct 209 ms 24916 KB Output is correct
68 Correct 204 ms 24912 KB Output is correct