Submission #127322

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
127322	2019-07-09T08:27:10 Z	josefu_	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	6540 KB

#define SuC_VaT              Doc_code_ban_khac
#define Nhan_cach_bang_0     Doc_code_ban_khac

#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> ii;
typedef pair<ll, ii > iii;

const int kn = 4e5 + 5, N = 1e5+5;
const ll mod = 1e9 + 7, mod2 = 1e9+9;
const ll base = 31, base1 = 37;

#define x first
#define y second
#define lwb lower_bound
#define upb upper_bound

#define pb push_back
#define popb pop_back
#define pf push_front
#define popf pop_front

#define log2(X) (31-__builtin_clz(X))
#define log2ll(X) (63-__builtin_clzll(X))
#define numbit(X) __builtin_popcount(X)
#define numbitll(X) __builtin_popcountll(X)

#define ms(val,a) memset(a,val,sizeof(a))

#define ff(i,n) for(int i=1;i<=n;i++)
#define _ff(i,n) for(int i=n;i>=1;i--)
#define f(i,a,b) for(int i = a; i <=b; i++)
#define _f(i,a,b) for(int i = b; i>=a;i--)

#define In(X) freopen(X,"r",stdin)
#define Out(X) freopen(X,"w",stdout)

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int n;
ii cac[kn];
ll pre[kn], ans = 0;

set< ii > S;

int main()
{
	scanf("%d",&n);
	ff(i,n)
	{
		scanf("%lld %lld",&cac[i].x,&cac[i].y);
	}
	sort(cac+1,cac+n+1);
	ff(i,n)
	{
		pre[i]  = pre[i-1] + cac[i].y;
		S.insert({pre[i]-cac[i].x, i});
	}
	auto it = prev(S.end());
	ff(i,n)
	{
		while(it->second < i) it--;
		ans = max(ans,(it->first) + cac[i].x - pre[i-1] );
	}
	printf("%lld",ans);
	
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	5 ms	760 KB	Output is correct
28	Correct	5 ms	760 KB	Output is correct
29	Correct	5 ms	760 KB	Output is correct
30	Correct	5 ms	760 KB	Output is correct
31	Correct	5 ms	760 KB	Output is correct
32	Correct	5 ms	764 KB	Output is correct
33	Correct	5 ms	680 KB	Output is correct
34	Correct	5 ms	760 KB	Output is correct
35	Correct	5 ms	760 KB	Output is correct
36	Correct	5 ms	760 KB	Output is correct
37	Correct	5 ms	760 KB	Output is correct
38	Correct	6 ms	760 KB	Output is correct
39	Correct	5 ms	764 KB	Output is correct
40	Correct	6 ms	760 KB	Output is correct
41	Correct	5 ms	760 KB	Output is correct
42	Correct	5 ms	760 KB	Output is correct
43	Correct	6 ms	760 KB	Output is correct
44	Correct	5 ms	760 KB	Output is correct
45	Correct	5 ms	764 KB	Output is correct
46	Correct	5 ms	760 KB	Output is correct
47	Correct	5 ms	760 KB	Output is correct
48	Correct	5 ms	760 KB	Output is correct
49	Correct	5 ms	760 KB	Output is correct
50	Correct	5 ms	760 KB	Output is correct
51	Correct	5 ms	760 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	5 ms	760 KB	Output is correct
28	Correct	5 ms	760 KB	Output is correct
29	Correct	5 ms	760 KB	Output is correct
30	Correct	5 ms	760 KB	Output is correct
31	Correct	5 ms	760 KB	Output is correct
32	Correct	5 ms	764 KB	Output is correct
33	Correct	5 ms	680 KB	Output is correct
34	Correct	5 ms	760 KB	Output is correct
35	Correct	5 ms	760 KB	Output is correct
36	Correct	5 ms	760 KB	Output is correct
37	Correct	5 ms	760 KB	Output is correct
38	Correct	6 ms	760 KB	Output is correct
39	Correct	5 ms	764 KB	Output is correct
40	Correct	6 ms	760 KB	Output is correct
41	Correct	5 ms	760 KB	Output is correct
42	Correct	5 ms	760 KB	Output is correct
43	Correct	6 ms	760 KB	Output is correct
44	Correct	5 ms	760 KB	Output is correct
45	Correct	5 ms	764 KB	Output is correct
46	Correct	5 ms	760 KB	Output is correct
47	Correct	5 ms	760 KB	Output is correct
48	Correct	5 ms	760 KB	Output is correct
49	Correct	5 ms	760 KB	Output is correct
50	Correct	5 ms	760 KB	Output is correct
51	Correct	5 ms	760 KB	Output is correct
52	Execution timed out	1069 ms	6540 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #127322

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0