답안 #955911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955911	2024-03-31T17:16:32 Z	lbm364dl	Art Exhibition (JOI18_art)	C++14	100 / 100	140 ms	24776 KB

//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <queue>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#define show(x) cerr << #x" = " << (x) << "\n"
#else
#define show(x) 0
#endif

#define pb push_back
#define pp pop_back
#define mp make_pair
#define fst first
#define snd second
#define FOR(var, from, to) for(int var = from; var < int(to); ++var)
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define sz(x) int(x.size())
#define vec(x) vector<x>
#define INF 2000000000

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// use unique second element of pair to work as multiset
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const ll mod = 1000000007, mod2 = 998244353;

template<typename T, typename U> ostream &operator<<(ostream &os, pair<T,U> p){os << "(" << p.fst << "," << p.snd << ")"; return os;}
template<typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p){is >> p.fst >> p.snd; return is;}
template<typename T> istream &operator>>(istream &is, vector<T> &v){FOR(i, 0, v.size()) is >> v[i]; return is;}
template<typename T> ostream &operator<<(ostream &os, vector<T> v){for(T x : v) os << x << " "; return os;}
template<typename T> ostream &operator<<(ostream &os, set<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T> ostream &operator<<(ostream &os, multiset<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T, typename U> ostream &operator<<(ostream &os, map<T,U> m){for(auto x : m) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_set s){for(int x : s) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_multiset s){for(pii x : s) os << x.fst << " "; return os;} 
ll mod_pow(ll a, ll b, ll m){ ll sol = 1; while(b){ if(b&1){ sol = (sol*a)%m; b--; }else{ a = (a*a)%m; b/=2; } } return sol;}
ll rem(ll a, ll b){ ll res = a%b; return res < 0 ? res+b : res; }

void test_case(){
  int n; cin >> n;
  vector<pll> v(n); cin >> v;
  sort(all(v));
  vec(ll) pref(n);
  pref[0] = v[0].snd;
  FOR(i, 1, n) pref[i] = pref[i-1] + v[i].snd;
  ll mx = -2e18;
  ll ans = 0;
  FOR(i, 0, n){
    mx = max(mx, (i ? -pref[i-1] : 0) + v[i].fst);
    ll cur = mx + pref[i] - v[i].fst;
    ans = max(ans, cur);
  }
  cout << ans << "\n";
}

int main(){
	#ifndef LOCAL
	ios_base::sync_with_stdio(false);
  	cin.tie(NULL);
	#endif

  int t = 1;
	FOR(i, 0, t) test_case();
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	456 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	668 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	464 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	600 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	600 KB	Output is correct
40	Correct	2 ms	860 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	2 ms	664 KB	Output is correct
45	Correct	2 ms	472 KB	Output is correct
46	Correct	2 ms	600 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	456 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	668 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	464 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	600 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	600 KB	Output is correct
40	Correct	2 ms	860 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	2 ms	664 KB	Output is correct
45	Correct	2 ms	472 KB	Output is correct
46	Correct	2 ms	600 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	134 ms	24776 KB	Output is correct
53	Correct	130 ms	24776 KB	Output is correct
54	Correct	132 ms	24764 KB	Output is correct
55	Correct	127 ms	24664 KB	Output is correct
56	Correct	136 ms	24776 KB	Output is correct
57	Correct	132 ms	24768 KB	Output is correct
58	Correct	130 ms	24660 KB	Output is correct
59	Correct	127 ms	24660 KB	Output is correct
60	Correct	135 ms	24768 KB	Output is correct
61	Correct	131 ms	24644 KB	Output is correct
62	Correct	128 ms	24768 KB	Output is correct
63	Correct	135 ms	24644 KB	Output is correct
64	Correct	131 ms	24756 KB	Output is correct
65	Correct	129 ms	24660 KB	Output is correct
66	Correct	140 ms	24640 KB	Output is correct
67	Correct	135 ms	24660 KB	Output is correct
68	Correct	132 ms	24656 KB	Output is correct

답안 #955911

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