답안 #203885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203885 2020-02-22T21:02:00 Z mode149256 Art Exhibition (JOI18_art) C++14
100 / 100
245 ms 21112 KB
/*input
15
1543361732 260774320
2089759661 257198921
1555665663 389548466
4133306295 296394520
2596448427 301103944
1701413087 274491541
2347488426 912791996
2133012079 444074242
2659886224 656957044
1345396764 259870638
2671164286 233246973
2791812672 585862344
2996614635 91065315
971304780 488995617
1523452673 988137562

6
1 5
4 1
4 2
5 3
9 1
10 3


*/
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int N;
	cin >> N;
	vpl sk(N);
	for (int i = 0; i < N; ++i)
		cin >> sk[i].x >> sk[i].y;

	sort(sk.begin(), sk.end());

	// maxmize S - max + min

	// {size, value}
	// j i
	// S = Si - Sj-1
	// Si - max - (Sj-1 - min)

	// max (Sj-1 - min)
	for (int i = 1; i < N; ++i)
		sk[i].y += sk[i - 1].y;

	int curr = 0;
	ll ats = sk[0].y;

	auto val = [&](int i) -> ll {
		return (i ? sk[i - 1].y : 0) - sk[i].x;
	};

	// for (auto u : sk)
	// 	printf("%lld ", u.y);
	// printf("\n");
	for (int i = 1; i < N; ++i)
	{
		// printf("i = %d, ski = %lld %lld, curr = %d, val = %lld\n", i, sk[i].x, sk[i].y, curr, val(curr));
		if (val(i) < val(curr)) curr = i;
		ats = max(ats, sk[i].y - sk[i].x - val(curr));
	}
	printf("%lld\n", ats);
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 7 ms 504 KB Output is correct
30 Correct 7 ms 632 KB Output is correct
31 Correct 7 ms 504 KB Output is correct
32 Correct 7 ms 504 KB Output is correct
33 Correct 7 ms 504 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 7 ms 504 KB Output is correct
37 Correct 7 ms 508 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 504 KB Output is correct
40 Correct 7 ms 504 KB Output is correct
41 Correct 7 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 7 ms 504 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 504 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 7 ms 504 KB Output is correct
48 Correct 7 ms 504 KB Output is correct
49 Correct 7 ms 504 KB Output is correct
50 Correct 7 ms 504 KB Output is correct
51 Correct 7 ms 504 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 7 ms 504 KB Output is correct
30 Correct 7 ms 632 KB Output is correct
31 Correct 7 ms 504 KB Output is correct
32 Correct 7 ms 504 KB Output is correct
33 Correct 7 ms 504 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 7 ms 504 KB Output is correct
37 Correct 7 ms 508 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 504 KB Output is correct
40 Correct 7 ms 504 KB Output is correct
41 Correct 7 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 7 ms 504 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 504 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 7 ms 504 KB Output is correct
48 Correct 7 ms 504 KB Output is correct
49 Correct 7 ms 504 KB Output is correct
50 Correct 7 ms 504 KB Output is correct
51 Correct 7 ms 504 KB Output is correct
52 Correct 231 ms 20936 KB Output is correct
53 Correct 229 ms 20856 KB Output is correct
54 Correct 245 ms 21064 KB Output is correct
55 Correct 234 ms 20976 KB Output is correct
56 Correct 240 ms 20856 KB Output is correct
57 Correct 231 ms 20916 KB Output is correct
58 Correct 231 ms 20856 KB Output is correct
59 Correct 235 ms 20984 KB Output is correct
60 Correct 228 ms 20984 KB Output is correct
61 Correct 226 ms 20728 KB Output is correct
62 Correct 245 ms 20856 KB Output is correct
63 Correct 231 ms 20856 KB Output is correct
64 Correct 238 ms 20936 KB Output is correct
65 Correct 227 ms 20856 KB Output is correct
66 Correct 240 ms 21112 KB Output is correct
67 Correct 228 ms 20856 KB Output is correct
68 Correct 240 ms 20856 KB Output is correct