oj.uz

Submission #47012

# Submission time Handle Problem Language Result Execution time Memory
47012 2018-04-26T11:21:41 Z leejseo Art Exhibition (JOI18_art) C++
100 / 100
 351 ms 239072 KB 
#include <stdio.h>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;
#define MAXN 500005
typedef long long lld;
typedef pair<lld, lld> pll;
lld S[MAXN], X[MAXN], Y[MAXN], ans;
vector<pll> U;
int N;
int main(void){
	scanf("%d", &N);
	lld a, b;
	for (int i=0; i<N; i++){
		scanf("%lld%lld", &a, &b);
		U.push_back(make_pair(a, b));
	}
	sort(U.begin(), U.end());
	for (int i=0; i<N; i++){
		S[i+1] = S[i] + U[i].second;
	}
	Y[0] = -(U[0].first);
	for (int i=1; i<=N; i++){
		X[i] = S[i] - U[i-1].first;
		if (i != N) Y[i] = min(Y[i-1], S[i]-U[i].first);
	}
	for (int i=0; i<N; i++) ans = max(ans, X[i+1]-Y[i]);
	printf("%lld", ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
art.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 2 ms 664 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 2 ms 664 KB Output is correct
12 Correct 2 ms 664 KB Output is correct
13 Correct 2 ms 672 KB Output is correct
14 Correct 2 ms 784 KB Output is correct
15 Correct 2 ms 884 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 3 ms 884 KB Output is correct
18 Correct 2 ms 884 KB Output is correct
19 Correct 2 ms 884 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 920 KB Output is correct
23 Correct 2 ms 928 KB Output is correct
24 Correct 2 ms 936 KB Output is correct
25 Correct 3 ms 944 KB Output is correct
26 Correct 2 ms 952 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 2 ms 664 KB Output is correct
12 Correct 2 ms 664 KB Output is correct
13 Correct 2 ms 672 KB Output is correct
14 Correct 2 ms 784 KB Output is correct
15 Correct 2 ms 884 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 3 ms 884 KB Output is correct
18 Correct 2 ms 884 KB Output is correct
19 Correct 2 ms 884 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 920 KB Output is correct
23 Correct 2 ms 928 KB Output is correct
24 Correct 2 ms 936 KB Output is correct
25 Correct 3 ms 944 KB Output is correct
26 Correct 2 ms 952 KB Output is correct
27 Correct 4 ms 1344 KB Output is correct
28 Correct 5 ms 1472 KB Output is correct
29 Correct 6 ms 1648 KB Output is correct
30 Correct 5 ms 1856 KB Output is correct
31 Correct 4 ms 1856 KB Output is correct
32 Correct 4 ms 1988 KB Output is correct
33 Correct 5 ms 2116 KB Output is correct
34 Correct 4 ms 2244 KB Output is correct
35 Correct 4 ms 2372 KB Output is correct
36 Correct 5 ms 2500 KB Output is correct
37 Correct 5 ms 2628 KB Output is correct
38 Correct 4 ms 2756 KB Output is correct
39 Correct 5 ms 2884 KB Output is correct
40 Correct 4 ms 3012 KB Output is correct
41 Correct 4 ms 3140 KB Output is correct
42 Correct 4 ms 3316 KB Output is correct
43 Correct 5 ms 3384 KB Output is correct
44 Correct 5 ms 3520 KB Output is correct
45 Correct 5 ms 3696 KB Output is correct
46 Correct 4 ms 3776 KB Output is correct
47 Correct 5 ms 3904 KB Output is correct
48 Correct 5 ms 4032 KB Output is correct
49 Correct 5 ms 4212 KB Output is correct
50 Correct 5 ms 4288 KB Output is correct
51 Correct 5 ms 4416 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 2 ms 664 KB Output is correct
12 Correct 2 ms 664 KB Output is correct
13 Correct 2 ms 672 KB Output is correct
14 Correct 2 ms 784 KB Output is correct
15 Correct 2 ms 884 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 3 ms 884 KB Output is correct
18 Correct 2 ms 884 KB Output is correct
19 Correct 2 ms 884 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 920 KB Output is correct
23 Correct 2 ms 928 KB Output is correct
24 Correct 2 ms 936 KB Output is correct
25 Correct 3 ms 944 KB Output is correct
26 Correct 2 ms 952 KB Output is correct
27 Correct 4 ms 1344 KB Output is correct
28 Correct 5 ms 1472 KB Output is correct
29 Correct 6 ms 1648 KB Output is correct
30 Correct 5 ms 1856 KB Output is correct
31 Correct 4 ms 1856 KB Output is correct
32 Correct 4 ms 1988 KB Output is correct
33 Correct 5 ms 2116 KB Output is correct
34 Correct 4 ms 2244 KB Output is correct
35 Correct 4 ms 2372 KB Output is correct
36 Correct 5 ms 2500 KB Output is correct
37 Correct 5 ms 2628 KB Output is correct
38 Correct 4 ms 2756 KB Output is correct
39 Correct 5 ms 2884 KB Output is correct
40 Correct 4 ms 3012 KB Output is correct
41 Correct 4 ms 3140 KB Output is correct
42 Correct 4 ms 3316 KB Output is correct
43 Correct 5 ms 3384 KB Output is correct
44 Correct 5 ms 3520 KB Output is correct
45 Correct 5 ms 3696 KB Output is correct
46 Correct 4 ms 3776 KB Output is correct
47 Correct 5 ms 3904 KB Output is correct
48 Correct 5 ms 4032 KB Output is correct
49 Correct 5 ms 4212 KB Output is correct
50 Correct 5 ms 4288 KB Output is correct
51 Correct 5 ms 4416 KB Output is correct
52 Correct 329 ms 36684 KB Output is correct
53 Correct 295 ms 49108 KB Output is correct
54 Correct 275 ms 61784 KB Output is correct
55 Correct 284 ms 74592 KB Output is correct
56 Correct 351 ms 87208 KB Output is correct
57 Correct 289 ms 99908 KB Output is correct
58 Correct 265 ms 112528 KB Output is correct
59 Correct 279 ms 125132 KB Output is correct
60 Correct 277 ms 137808 KB Output is correct
61 Correct 281 ms 150356 KB Output is correct
62 Correct 286 ms 163028 KB Output is correct
63 Correct 297 ms 175692 KB Output is correct
64 Correct 292 ms 188380 KB Output is correct
65 Correct 282 ms 201096 KB Output is correct
66 Correct 270 ms 213720 KB Output is correct
67 Correct 270 ms 226332 KB Output is correct
68 Correct 272 ms 239072 KB Output is correct