답안 #66733 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66733	2018-08-12T07:57:51 Z	MrTEK	Art Exhibition (JOI18_art)	C++14	100 / 100	338 ms	12424 KB

#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left ind+ind
#define right ind+ind+1
#define mid (l+r)/2
#define FAST_IO ios_base::sync_with_stdio(false);
#define endl '\n'

typedef long long int ll;

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 5e5 + 5;
const int M = 1e4 + 5;
const int SQ = 350;
const int MOD = 998244353;

typedef pair <int,int> pii;

pair <ll ,ll> ar[N];
ll pre[N],ans;
int n,opt = 1;

int main() {
	scanf("%d",&n);
	for (int i = 1 ; i <= n ; i++) scanf("%lld %lld",&ar[i].fi,&ar[i].sc);
	sort(ar + 1,ar + n + 1);
	for (int i = 1 ; i <= n ; i++) pre[i] = pre[i - 1] + ar[i].sc;
	ans = ar[1].sc;
	for (int i = 2 ; i <= n ; i++) {
		if (ar[i].fi > ar[opt].fi + pre[i - 1] - pre[opt - 1]) opt = i;
		ans = max(ans,-ar[i].fi + ar[opt].fi + pre[i] - pre[opt - 1]);
	}
	printf("%lld\n",ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:37:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1 ; i <= n ; i++) scanf("%lld %lld",&ar[i].fi,&ar[i].sc);
                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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	412 KB	Output is correct
4	Correct	2 ms	412 KB	Output is correct
5	Correct	3 ms	412 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	536 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 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	412 KB	Output is correct
4	Correct	2 ms	412 KB	Output is correct
5	Correct	3 ms	412 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	536 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	3 ms	596 KB	Output is correct
14	Correct	3 ms	596 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	3 ms	620 KB	Output is correct
26	Correct	2 ms	740 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	412 KB	Output is correct
4	Correct	2 ms	412 KB	Output is correct
5	Correct	3 ms	412 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	536 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	3 ms	596 KB	Output is correct
14	Correct	3 ms	596 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	3 ms	620 KB	Output is correct
26	Correct	2 ms	740 KB	Output is correct
27	Correct	5 ms	740 KB	Output is correct
28	Correct	5 ms	740 KB	Output is correct
29	Correct	5 ms	740 KB	Output is correct
30	Correct	6 ms	740 KB	Output is correct
31	Correct	5 ms	740 KB	Output is correct
32	Correct	6 ms	740 KB	Output is correct
33	Correct	4 ms	740 KB	Output is correct
34	Correct	4 ms	740 KB	Output is correct
35	Correct	6 ms	740 KB	Output is correct
36	Correct	5 ms	740 KB	Output is correct
37	Correct	6 ms	740 KB	Output is correct
38	Correct	5 ms	740 KB	Output is correct
39	Correct	5 ms	740 KB	Output is correct
40	Correct	5 ms	740 KB	Output is correct
41	Correct	5 ms	740 KB	Output is correct
42	Correct	6 ms	740 KB	Output is correct
43	Correct	6 ms	740 KB	Output is correct
44	Correct	6 ms	772 KB	Output is correct
45	Correct	6 ms	772 KB	Output is correct
46	Correct	5 ms	772 KB	Output is correct
47	Correct	6 ms	772 KB	Output is correct
48	Correct	5 ms	772 KB	Output is correct
49	Correct	5 ms	772 KB	Output is correct
50	Correct	6 ms	772 KB	Output is correct
51	Correct	7 ms	772 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	412 KB	Output is correct
4	Correct	2 ms	412 KB	Output is correct
5	Correct	3 ms	412 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	536 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	3 ms	596 KB	Output is correct
14	Correct	3 ms	596 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	3 ms	620 KB	Output is correct
26	Correct	2 ms	740 KB	Output is correct
27	Correct	5 ms	740 KB	Output is correct
28	Correct	5 ms	740 KB	Output is correct
29	Correct	5 ms	740 KB	Output is correct
30	Correct	6 ms	740 KB	Output is correct
31	Correct	5 ms	740 KB	Output is correct
32	Correct	6 ms	740 KB	Output is correct
33	Correct	4 ms	740 KB	Output is correct
34	Correct	4 ms	740 KB	Output is correct
35	Correct	6 ms	740 KB	Output is correct
36	Correct	5 ms	740 KB	Output is correct
37	Correct	6 ms	740 KB	Output is correct
38	Correct	5 ms	740 KB	Output is correct
39	Correct	5 ms	740 KB	Output is correct
40	Correct	5 ms	740 KB	Output is correct
41	Correct	5 ms	740 KB	Output is correct
42	Correct	6 ms	740 KB	Output is correct
43	Correct	6 ms	740 KB	Output is correct
44	Correct	6 ms	772 KB	Output is correct
45	Correct	6 ms	772 KB	Output is correct
46	Correct	5 ms	772 KB	Output is correct
47	Correct	6 ms	772 KB	Output is correct
48	Correct	5 ms	772 KB	Output is correct
49	Correct	5 ms	772 KB	Output is correct
50	Correct	6 ms	772 KB	Output is correct
51	Correct	7 ms	772 KB	Output is correct
52	Correct	279 ms	12352 KB	Output is correct
53	Correct	317 ms	12412 KB	Output is correct
54	Correct	338 ms	12412 KB	Output is correct
55	Correct	305 ms	12412 KB	Output is correct
56	Correct	284 ms	12412 KB	Output is correct
57	Correct	274 ms	12412 KB	Output is correct
58	Correct	324 ms	12412 KB	Output is correct
59	Correct	302 ms	12412 KB	Output is correct
60	Correct	300 ms	12412 KB	Output is correct
61	Correct	334 ms	12412 KB	Output is correct
62	Correct	315 ms	12424 KB	Output is correct
63	Correct	297 ms	12424 KB	Output is correct
64	Correct	288 ms	12424 KB	Output is correct
65	Correct	275 ms	12424 KB	Output is correct
66	Correct	281 ms	12424 KB	Output is correct
67	Correct	314 ms	12424 KB	Output is correct
68	Correct	288 ms	12424 KB	Output is correct

답안 #66733

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