답안 #66725 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66725	2018-08-12T07:38:20 Z	hamzqq9	Art Exhibition (JOI18_art)	C++14	30 / 100	4 ms	684 KB

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 10000000000000000
#define MOD 1000000007
#define N 1005
#define MAX 10000006
#define LOG 22
using namespace std;

int n;
int b[N];
ll pre[N];
ll ans;
pair<ll,int> a[N];	

int main() {

//	freopen("input.txt","r",stdin);

	scanf("%d",&n);

	for(int i=1;i<=n;i++) {

		scanf("%lld %d",&a[i].st,&a[i].nd);

	}

	sort(a+1,a+1+n);

	ll max_val=-inf;

	for(int i=1;i<=n;i++) {

		umax(max_val,-pre[i-1]+a[i].st);

		pre[i]=pre[i-1]+a[i].nd;

		umax(ans,max_val+pre[i]-a[i].st);

	}

	printf("%lld\n",ans);

}

Compilation message

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

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	4 ms	360 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	576 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	3 ms	656 KB	Output is correct
11	Correct	3 ms	656 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	4 ms	360 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	576 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	3 ms	656 KB	Output is correct
11	Correct	3 ms	656 KB	Output is correct
12	Correct	2 ms	676 KB	Output is correct
13	Correct	2 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	3 ms	684 KB	Output is correct
16	Correct	2 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	3 ms	684 KB	Output is correct
19	Correct	4 ms	684 KB	Output is correct
20	Correct	2 ms	684 KB	Output is correct
21	Correct	3 ms	684 KB	Output is correct
22	Correct	2 ms	684 KB	Output is correct
23	Correct	3 ms	684 KB	Output is correct
24	Correct	3 ms	684 KB	Output is correct
25	Correct	4 ms	684 KB	Output is correct
26	Correct	4 ms	684 KB	Output is correct
27	Execution timed out	3 ms	684 KB	Time limit exceeded (wall clock)
28	Halted	0 ms	0 KB	-

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	4 ms	360 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	576 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	3 ms	656 KB	Output is correct
11	Correct	3 ms	656 KB	Output is correct
12	Correct	2 ms	676 KB	Output is correct
13	Correct	2 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	3 ms	684 KB	Output is correct
16	Correct	2 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	3 ms	684 KB	Output is correct
19	Correct	4 ms	684 KB	Output is correct
20	Correct	2 ms	684 KB	Output is correct
21	Correct	3 ms	684 KB	Output is correct
22	Correct	2 ms	684 KB	Output is correct
23	Correct	3 ms	684 KB	Output is correct
24	Correct	3 ms	684 KB	Output is correct
25	Correct	4 ms	684 KB	Output is correct
26	Correct	4 ms	684 KB	Output is correct
27	Execution timed out	3 ms	684 KB	Time limit exceeded (wall clock)
28	Halted	0 ms	0 KB	-

답안 #66725

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 20.0

Subtask #4
0 / 50.0