Submission #249435

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
249435	2020-07-15T03:28:32 Z	jamielim	Cake 3 (JOI19_cake3)	C++14	24 / 100	4000 ms	5192 KB

cake3

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

typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
const int INF=2012345678;
const ll LLINF=4012345678012345678LL;
const ll MOD=1000000007; //998244353; //
const ld PI=3.1415926535898;
const ld EPS=1e-9;
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(b==0)return a;return gcd(b,a%b);}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll expo(ll b,ll p,ll m){ll res=1; while(p){if(p&1)res=(res*b)%m; b=(b*b)%m; p>>=1;} return res;}
inline ll modinv(ll a,ll m){return expo(a,m-2,m);}

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	pll p[n];
	for(int i=0;i<n;i++){
		scanf("%lld%lld",&p[i].se,&p[i].fi);
	}
	sort(p,p+n);
	ll ans=-LLINF;
	for(int i=0;i+m<=n;i++){
		priority_queue<ll,vector<ll>,greater<ll> > pq;
		ll sum=0;
		for(int j=i;j<i+m;j++){
			sum+=p[j].se;
			pq.push(p[j].se);
		}
		ans=max(ans,sum-2LL*(p[i+m-1].fi-p[i].fi));
		for(int j=i+m;j<n;j++){
			if(p[j].se>pq.top()){
				sum-=pq.top();sum+=p[j].se;
				pq.pop();pq.push(p[j].se);
			}
			ans=max(ans,sum-2LL*(p[j].fi-p[i].fi));
		}
	}
	printf("%lld",ans);
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
cake3.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&p[i].se,&p[i].fi);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	1 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	0 ms	256 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	1 ms	256 KB	Output is correct

Subtask #2
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	1 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	0 ms	256 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	1 ms	256 KB	Output is correct
38	Correct	60 ms	384 KB	Output is correct
39	Correct	75 ms	444 KB	Output is correct
40	Correct	45 ms	384 KB	Output is correct
41	Correct	45 ms	440 KB	Output is correct
42	Correct	23 ms	464 KB	Output is correct
43	Correct	31 ms	384 KB	Output is correct
44	Correct	56 ms	384 KB	Output is correct
45	Correct	65 ms	384 KB	Output is correct
46	Correct	69 ms	384 KB	Output is correct
47	Correct	62 ms	384 KB	Output is correct
48	Correct	59 ms	384 KB	Output is correct
49	Correct	54 ms	384 KB	Output is correct
50	Correct	57 ms	384 KB	Output is correct
51	Correct	53 ms	384 KB	Output is correct
52	Correct	48 ms	384 KB	Output is correct
53	Correct	56 ms	384 KB	Output is correct
54	Correct	35 ms	384 KB	Output is correct
55	Correct	24 ms	384 KB	Output is correct
56	Correct	24 ms	384 KB	Output is correct
57	Correct	41 ms	384 KB	Output is correct
58	Correct	25 ms	384 KB	Output is correct
59	Correct	9 ms	384 KB	Output is correct
60	Correct	9 ms	384 KB	Output is correct
61	Correct	7 ms	384 KB	Output is correct
62	Correct	11 ms	384 KB	Output is correct
63	Correct	13 ms	384 KB	Output is correct
64	Correct	7 ms	384 KB	Output is correct
65	Correct	55 ms	384 KB	Output is correct
66	Correct	50 ms	436 KB	Output is correct
67	Correct	58 ms	384 KB	Output is correct
68	Correct	48 ms	384 KB	Output is correct
69	Correct	44 ms	384 KB	Output is correct
70	Correct	43 ms	384 KB	Output is correct
71	Correct	51 ms	384 KB	Output is correct
72	Correct	35 ms	384 KB	Output is correct
73	Correct	49 ms	384 KB	Output is correct
74	Correct	1 ms	384 KB	Output is correct

Subtask #3
0 / 76.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	1 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	0 ms	256 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	1 ms	256 KB	Output is correct
38	Correct	60 ms	384 KB	Output is correct
39	Correct	75 ms	444 KB	Output is correct
40	Correct	45 ms	384 KB	Output is correct
41	Correct	45 ms	440 KB	Output is correct
42	Correct	23 ms	464 KB	Output is correct
43	Correct	31 ms	384 KB	Output is correct
44	Correct	56 ms	384 KB	Output is correct
45	Correct	65 ms	384 KB	Output is correct
46	Correct	69 ms	384 KB	Output is correct
47	Correct	62 ms	384 KB	Output is correct
48	Correct	59 ms	384 KB	Output is correct
49	Correct	54 ms	384 KB	Output is correct
50	Correct	57 ms	384 KB	Output is correct
51	Correct	53 ms	384 KB	Output is correct
52	Correct	48 ms	384 KB	Output is correct
53	Correct	56 ms	384 KB	Output is correct
54	Correct	35 ms	384 KB	Output is correct
55	Correct	24 ms	384 KB	Output is correct
56	Correct	24 ms	384 KB	Output is correct
57	Correct	41 ms	384 KB	Output is correct
58	Correct	25 ms	384 KB	Output is correct
59	Correct	9 ms	384 KB	Output is correct
60	Correct	9 ms	384 KB	Output is correct
61	Correct	7 ms	384 KB	Output is correct
62	Correct	11 ms	384 KB	Output is correct
63	Correct	13 ms	384 KB	Output is correct
64	Correct	7 ms	384 KB	Output is correct
65	Correct	55 ms	384 KB	Output is correct
66	Correct	50 ms	436 KB	Output is correct
67	Correct	58 ms	384 KB	Output is correct
68	Correct	48 ms	384 KB	Output is correct
69	Correct	44 ms	384 KB	Output is correct
70	Correct	43 ms	384 KB	Output is correct
71	Correct	51 ms	384 KB	Output is correct
72	Correct	35 ms	384 KB	Output is correct
73	Correct	49 ms	384 KB	Output is correct
74	Correct	1 ms	384 KB	Output is correct
75	Execution timed out	4086 ms	5192 KB	Time limit exceeded
76	Halted	0 ms	0 KB	-

Submission #249435

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 19.0 / 19.0

Subtask #3 0 / 76.0

Subtask #1
5.0 / 5.0

Subtask #2
19.0 / 19.0

Subtask #3
0 / 76.0