답안 #128478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
128478	2019-07-11T01:41:19 Z	kjp4155	Art Exhibition (JOI18_art)	C++17	100 / 100	285 ms	33092 KB

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <unordered_map>
using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cout<<#a<<"=["; printarray(a,n); cout<<"]\n"
#define DAR(a,n,s) cout<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<int, int> pii;
typedef pair<ll, ll> Pll;
typedef pair<ll, ll> pll;
    
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define szz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define INF 987654321

#define endl '\n'


int N;
vector<Pll> p;
ll S[500500], A[500500], B[500500], Areal[500500];
int main(){
	ios::sync_with_stdio(false); cin.tie(NULL);
	geti(N);
	repp(i,N){
		ll a,b; geti(a,b);
		p.push_back({a,b});
	}

	sort(all(p));

	vector<Pll> v;
	for(auto e : p){
		//Debug(v);
		if( sz(v) == 0 ) v.pb(e);
		else{
			if( v[sz(v)-1].Fi == e.Fi ) v[sz(v)-1].Se += e.Se;
			else v.pb(e);
		}
	}
	ll ans = v[0].Se;
	ll cur = v[0].Se;
	for(int i=1;i<sz(v);i++){
		cur += v[i].Se - (v[i].Fi - v[i-1].Fi);
		//Debug(i,v[i],cur);
		if( cur < v[i].Se ){
			cur = v[i].Se;
		}
		ans = max(ans, cur);
	}
	cout << ans << endl;

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	380 KB	Output is correct
5	Correct	2 ms	380 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	5 ms	760 KB	Output is correct
28	Correct	4 ms	760 KB	Output is correct
29	Correct	5 ms	760 KB	Output is correct
30	Correct	5 ms	760 KB	Output is correct
31	Correct	5 ms	760 KB	Output is correct
32	Correct	5 ms	760 KB	Output is correct
33	Correct	5 ms	760 KB	Output is correct
34	Correct	4 ms	760 KB	Output is correct
35	Correct	5 ms	760 KB	Output is correct
36	Correct	5 ms	760 KB	Output is correct
37	Correct	5 ms	760 KB	Output is correct
38	Correct	5 ms	760 KB	Output is correct
39	Correct	5 ms	760 KB	Output is correct
40	Correct	5 ms	760 KB	Output is correct
41	Correct	5 ms	760 KB	Output is correct
42	Correct	5 ms	760 KB	Output is correct
43	Correct	5 ms	760 KB	Output is correct
44	Correct	5 ms	760 KB	Output is correct
45	Correct	5 ms	760 KB	Output is correct
46	Correct	5 ms	760 KB	Output is correct
47	Correct	4 ms	760 KB	Output is correct
48	Correct	5 ms	764 KB	Output is correct
49	Correct	5 ms	760 KB	Output is correct
50	Correct	5 ms	760 KB	Output is correct
51	Correct	5 ms	760 KB	Output is correct
52	Correct	285 ms	32716 KB	Output is correct
53	Correct	270 ms	32936 KB	Output is correct
54	Correct	270 ms	32856 KB	Output is correct
55	Correct	268 ms	32852 KB	Output is correct
56	Correct	268 ms	32960 KB	Output is correct
57	Correct	271 ms	32912 KB	Output is correct
58	Correct	281 ms	32980 KB	Output is correct
59	Correct	267 ms	32852 KB	Output is correct
60	Correct	268 ms	33092 KB	Output is correct
61	Correct	270 ms	32984 KB	Output is correct
62	Correct	269 ms	32852 KB	Output is correct
63	Correct	268 ms	32784 KB	Output is correct
64	Correct	272 ms	32820 KB	Output is correct
65	Correct	269 ms	32524 KB	Output is correct
66	Correct	269 ms	32468 KB	Output is correct
67	Correct	275 ms	32340 KB	Output is correct
68	Correct	269 ms	32376 KB	Output is correct

답안 #128478

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