oj.uz

Submission #884455

# Submission time Handle Problem Language Result Execution time Memory
884455 2023-12-07T11:46:21 Z cabbit Cake 3 (JOI19_cake3) C++14
100 / 100
 597 ms 17528 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#define SIZE 200005
#define BT 256*1024*2
#define INF 1000000000000000LL

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
typedef pair <P,P> PP;

vector <P> vx;
struct segtree
{
	ll seg[BT];
	int cnt[BT];
	int mum;
	
	void init(int n)
	{
		mum=1;
		while(mum<n) mum<<=1;
		for(int i=0;i<mum*2;i++) seg[i]=0,cnt[i]=0;
	}
	void add(int k,int v)
	{
		k+=mum-1;
		cnt[k]+=v;
		seg[k]+=vx[k-mum+1].first*v;
		while(k>0)
		{
			k=(k-1)/2;
			seg[k]=seg[k*2+1]+seg[k*2+2];
			cnt[k]=cnt[k*2+1]+cnt[k*2+2];
		}
	}
	ll get(int X)
	{
		if(cnt[0]<X) return -1;
		if(cnt[0]==X) return seg[0];
		ll ret=0;
		int l=0,r=mum,k=0;
		while(r-l>1)
		{
			if(cnt[k*2+2]>X)
			{
				l=(l+r)/2;
				k=k*2+2;
			}
			else
			{
				ret+=seg[k*2+2];
				X-=cnt[k*2+2];
				r=(l+r)/2;
				k=k*2+1;
			}
		}
		return ret;
	}
}seg;
P pos[SIZE];
int id[SIZE],to[SIZE];

int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++)
	{
		int v,c;
		scanf("%d %d",&v,&c);
		pos[i]=P(c,v);
	}
	sort(pos,pos+n);
	for(int i=0;i<n;i++) vx.push_back(P(pos[i].second,i));
	sort(vx.begin(),vx.end());
	for(int i=0;i<n;i++) id[vx[i].second]=i;
	seg.init(n+2);
	ll ans=-INF;
	vector <PP> query;
	query.push_back(PP(P(0,n-m+1),P(0,n-1)));
	while(!query.empty())
	{
		vector <PP> nxt;
		seg.init(n+2);
		int s=0,e=0;
		for(int i=0;i<query.size();i++)
		{
			P p=query[i].first,q=query[i].second;
			int d=(p.first+p.second)/2;
			while(e<max(d,q.first)) seg.add(id[e++],1);
			while(s<d) seg.add(id[s++],-1);
			ll mx=-INF;
			int to=-1;
			for(int j=max(d,q.first);j<=q.second;j++)
			{
				if(e==j)
				{
					seg.add(id[j],1);
					e++;
				}
				ll vl=seg.get(m);
				if(vl!=-1)
				{
					vl-=2LL*(pos[j].first-pos[d].first);
					if(mx<vl)
					{
						mx=vl;
						to=j;
					}
				}
			}
			ans=max(ans,mx);
			if(p.first<d) nxt.push_back(PP(P(p.first,d),P(q.first,to)));
			if(d+1<p.second) nxt.push_back(PP(P(d+1,p.second),P(to,q.second)));
		}
		query=nxt;
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:93:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for(int i=0;i<query.size();i++)
      |               ~^~~~~~~~~~~~~
cake3.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |  scanf("%d %d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
cake3.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |   scanf("%d %d",&v,&c);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6596 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6576 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6556 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6744 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6576 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6576 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 6492 KB Output is correct
39 Correct 3 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 3 ms 6492 KB Output is correct
42 Correct 2 ms 6492 KB Output is correct
43 Correct 2 ms 6584 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6492 KB Output is correct
46 Correct 3 ms 6644 KB Output is correct
47 Correct 4 ms 6492 KB Output is correct
48 Correct 3 ms 6492 KB Output is correct
49 Correct 3 ms 6584 KB Output is correct
50 Correct 3 ms 6660 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6640 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6492 KB Output is correct
58 Correct 2 ms 6492 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 3 ms 6492 KB Output is correct
61 Correct 3 ms 6584 KB Output is correct
62 Correct 2 ms 6756 KB Output is correct
63 Correct 3 ms 6492 KB Output is correct
64 Correct 2 ms 6500 KB Output is correct
65 Correct 3 ms 6680 KB Output is correct
66 Correct 3 ms 6492 KB Output is correct
67 Correct 3 ms 6492 KB Output is correct
68 Correct 3 ms 6596 KB Output is correct
69 Correct 2 ms 6668 KB Output is correct
70 Correct 3 ms 6492 KB Output is correct
71 Correct 2 ms 6492 KB Output is correct
72 Correct 2 ms 6492 KB Output is correct
73 Correct 3 ms 6492 KB Output is correct
74 Correct 2 ms 6488 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6596 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6576 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6556 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6744 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6576 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6576 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 6492 KB Output is correct
39 Correct 3 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 3 ms 6492 KB Output is correct
42 Correct 2 ms 6492 KB Output is correct
43 Correct 2 ms 6584 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6492 KB Output is correct
46 Correct 3 ms 6644 KB Output is correct
47 Correct 4 ms 6492 KB Output is correct
48 Correct 3 ms 6492 KB Output is correct
49 Correct 3 ms 6584 KB Output is correct
50 Correct 3 ms 6660 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6640 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6492 KB Output is correct
58 Correct 2 ms 6492 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 3 ms 6492 KB Output is correct
61 Correct 3 ms 6584 KB Output is correct
62 Correct 2 ms 6756 KB Output is correct
63 Correct 3 ms 6492 KB Output is correct
64 Correct 2 ms 6500 KB Output is correct
65 Correct 3 ms 6680 KB Output is correct
66 Correct 3 ms 6492 KB Output is correct
67 Correct 3 ms 6492 KB Output is correct
68 Correct 3 ms 6596 KB Output is correct
69 Correct 2 ms 6668 KB Output is correct
70 Correct 3 ms 6492 KB Output is correct
71 Correct 2 ms 6492 KB Output is correct
72 Correct 2 ms 6492 KB Output is correct
73 Correct 3 ms 6492 KB Output is correct
74 Correct 2 ms 6488 KB Output is correct
75 Correct 454 ms 16424 KB Output is correct
76 Correct 536 ms 17528 KB Output is correct
77 Correct 445 ms 16032 KB Output is correct
78 Correct 485 ms 16124 KB Output is correct
79 Correct 149 ms 14216 KB Output is correct
80 Correct 209 ms 14084 KB Output is correct
81 Correct 440 ms 15436 KB Output is correct
82 Correct 534 ms 16936 KB Output is correct
83 Correct 506 ms 16932 KB Output is correct
84 Correct 597 ms 17280 KB Output is correct
85 Correct 452 ms 15440 KB Output is correct
86 Correct 376 ms 14592 KB Output is correct
87 Correct 336 ms 14472 KB Output is correct
88 Correct 426 ms 15044 KB Output is correct
89 Correct 456 ms 15352 KB Output is correct
90 Correct 387 ms 14860 KB Output is correct
91 Correct 303 ms 14248 KB Output is correct
92 Correct 294 ms 14420 KB Output is correct
93 Correct 324 ms 14468 KB Output is correct
94 Correct 275 ms 14116 KB Output is correct
95 Correct 353 ms 14784 KB Output is correct
96 Correct 286 ms 15296 KB Output is correct
97 Correct 306 ms 15808 KB Output is correct
98 Correct 323 ms 16732 KB Output is correct
99 Correct 308 ms 15736 KB Output is correct
100 Correct 259 ms 14460 KB Output is correct
101 Correct 268 ms 14516 KB Output is correct
102 Correct 430 ms 16528 KB Output is correct
103 Correct 393 ms 15492 KB Output is correct
104 Correct 470 ms 17000 KB Output is correct
105 Correct 388 ms 15284 KB Output is correct
106 Correct 376 ms 15628 KB Output is correct
107 Correct 342 ms 14632 KB Output is correct
108 Correct 435 ms 15788 KB Output is correct
109 Correct 400 ms 15552 KB Output is correct
110 Correct 286 ms 14012 KB Output is correct
111 Correct 334 ms 16172 KB Output is correct
112 Correct 344 ms 15096 KB Output is correct
113 Correct 73 ms 14280 KB Output is correct