답안 #257179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257179	2020-08-03T17:09:01 Z	jainbot27	Art Exhibition (JOI18_art)	C++17	100 / 100	226 ms	20944 KB

//Author: jainbot27
#pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;


#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ts to_string
#define ub upper_bound
#define lb lower_bound
#define ar array
#define FOR(x, y, z) for(int x = y; x < z; x++)
#define ROF(x, y, z) for(int x = y; x > z; x--)
#define all(x) x.begin(), x.end()


const char nl = '\n';
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
using vpii = vector<pii>;
using vpll = vector<pll>;


str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; for(int i = 0;i < (int)v.size(); i++) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; for(int i = 0; i < b.size(); i++) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { 
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }


#ifdef D 
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

const int mxN = 5e5 + 10;
int n;
pll a[mxN];

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].f >> a[i].s;
	}
	sort(a+1, a+1+n);
	ll ans = 0;
	ll best = 0;
	for(int i = 1; i <= n; i++){
		ans += a[i].s;
		ans -= a[i].f - a[i-1].f;
		dbg(ans);
		if(a[i].s > ans){
			ans = a[i].s;
		}
		best = max(best, ans);
	}
	cout << best << nl;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:83:11: warning: statement has no effect [-Wunused-value]
   dbg(ans);
           ^

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	384 KB	Output is correct
2	Correct	384 KB	Output is correct
3	Correct	384 KB	Output is correct
4	Correct	384 KB	Output is correct
5	Correct	384 KB	Output is correct
6	Correct	384 KB	Output is correct
7	Correct	384 KB	Output is correct
8	Correct	384 KB	Output is correct
9	Correct	384 KB	Output is correct
10	Correct	384 KB	Output is correct
11	Correct	384 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	4 ms	540 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	2 ms	512 KB	Output is correct
35	Correct	3 ms	512 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	4 ms	512 KB	Output is correct
39	Correct	4 ms	512 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	4 ms	512 KB	Output is correct
43	Correct	0 ms	512 KB	Output is correct
44	Correct	4 ms	512 KB	Output is correct
45	Correct	3 ms	512 KB	Output is correct
46	Correct	2 ms	512 KB	Output is correct
47	Correct	2 ms	512 KB	Output is correct
48	Correct	2 ms	512 KB	Output is correct
49	Correct	3 ms	512 KB	Output is correct
50	Correct	3 ms	512 KB	Output is correct
51	Correct	3 ms	512 KB	Output is correct
52	Correct	221 ms	20728 KB	Output is correct
53	Correct	225 ms	20772 KB	Output is correct
54	Correct	224 ms	20856 KB	Output is correct
55	Correct	217 ms	20856 KB	Output is correct
56	Correct	213 ms	20728 KB	Output is correct
57	Correct	223 ms	20856 KB	Output is correct
58	Correct	213 ms	20784 KB	Output is correct
59	Correct	217 ms	20856 KB	Output is correct
60	Correct	218 ms	20856 KB	Output is correct
61	Correct	217 ms	20728 KB	Output is correct
62	Correct	209 ms	20856 KB	Output is correct
63	Correct	218 ms	20860 KB	Output is correct
64	Correct	219 ms	20856 KB	Output is correct
65	Correct	213 ms	20856 KB	Output is correct
66	Correct	215 ms	20748 KB	Output is correct
67	Correct	218 ms	20944 KB	Output is correct
68	Correct	226 ms	20856 KB	Output is correct

답안 #257179

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