oj.uz

답안 #126312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126312 2019-07-07T11:37:50 Z TadijaSebez Cake 3 (JOI19_cake3) C++11
100 / 100
 3405 ms 89220 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const ll inf=1e18;
const int N=200050;
const int M=20*N;
int v[N],c[N],id[N],idv[N],pos[N],n,m;
int ls[M],rs[M],tsz,root[N],sz[M];
ll sum[M];
void Set(int p, int &c, int ss, int se, int qi, ll x)
{
	c=++tsz;ls[c]=ls[p];rs[c]=rs[p];sum[c]=sum[p]+x;sz[c]=sz[p]+1;
	if(ss==se) return;
	int mid=ss+se>>1;
	if(qi<=mid) Set(ls[p],ls[c],ss,mid,qi,x);
	else Set(rs[p],rs[c],mid+1,se,qi,x);
}
ll Get(int p, int c, int ss, int se, int k)
{
	ll ans=0;
	while(1)
	{
		if(ss==se){ if(k>0) ans+=sum[c];break;}
		int mid=ss+se>>1;
		int A=sz[ls[c]]-sz[ls[p]];
		if(A<=k) k-=A,ans+=sum[ls[c]]-sum[ls[p]],ss=mid+1,p=rs[p],c=rs[c];
		else se=mid,p=ls[p],c=ls[c];
	}
	return ans;
}
ll Get(int l, int r)
{
	return v[id[l]]+c[id[l]]+v[id[r]]-c[id[r]]+Get(root[l],root[r-1],1,n,m-2);
}
int nxt[N],pre[N];
vector<int> work[N];
void Del(int x)
{
	int l=pre[x],r=nxt[x];
	pre[x]=nxt[x]=0;
	nxt[l]=r;
	pre[r]=l;
}
void Add(int x)
{
	int las=pre[0];
	nxt[las]=x;
	pre[x]=las;
	pre[0]=x;
	nxt[x]=0;
}
int main()
{
	scanf("%i %i",&n,&m);
	for(int i=1;i<=n;i++) scanf("%i %i",&v[i],&c[i]),c[i]*=2,id[i]=idv[i]=i;
	sort(id+1,id+1+n,[&](int i, int j){ return c[i]<c[j];});
	sort(idv+1,idv+1+n,[&](int i, int j){ return v[i]>v[j];});
	for(int i=1;i<=n;i++) pos[idv[i]]=i;
	for(int i=1;i<=n;i++) Set(root[i-1],root[i],1,n,pos[id[i]],v[id[i]]);
	vector<int> L,R;
	for(int i=1;i<=n;i++) if(i==1 || v[id[i]]+c[id[i]]>v[id[L.back()]]+c[id[L.back()]]) L.pb(i);
	for(int i=n;i>=1;i--) if(i==n || v[id[i]]-c[id[i]]>v[id[R.back()]]-c[id[R.back()]]) R.pb(i);
	reverse(R.begin(),R.end());
	ll ans=-inf;
	for(int i=0,j=0;i<R.size();i++)
	{
		while(j<L.size() && R[i]-L[j]+1>=m)
		{
			Add(L[j]);
			work[i].pb(L[j]);
			j++;
		}
		reverse(work[i].begin(),work[i].end());
		for(int x:work[i])
		{
			while(pre[x]!=0 && Get(pre[x],R[i])<=Get(x,R[i])) Del(pre[x]);
			if(pre[x]!=0)
			{
				int top=(int)R.size()-1,bot=i+1,mid,ans=-1;
				while(top>=bot)
				{
					mid=top+bot>>1;
					if(Get(pre[x],R[mid])<=Get(x,R[mid])) ans=mid,top=mid-1;
					else bot=mid+1;
				}
				if(ans!=-1) work[ans].pb(x);
				else Del(x);
			}
		}
		if(nxt[0]!=0) ans=max(ans,Get(nxt[0],R[i]));
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'void Set(int, int&, int, int, int, long long int)':
cake3.cpp:15:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
cake3.cpp: In function 'long long int Get(int, int, int, int, int)':
cake3.cpp:25:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid=ss+se>>1;
           ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0,j=0;i<R.size();i++)
                  ~^~~~~~~~~
cake3.cpp:68:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j<L.size() && R[i]-L[j]+1>=m)
         ~^~~~~~~~~
cake3.cpp:83:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
      mid=top+bot>>1;
          ~~~^~~~
cake3.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
cake3.cpp:56:58: 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("%i %i",&v[i],&c[i]),c[i]*=2,id[i]=idv[i]=i;
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5032 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5116 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 6 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 6 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 7 ms 5112 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5032 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5116 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 6 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 6 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 7 ms 5112 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 7 ms 5624 KB Output is correct
39 Correct 8 ms 5624 KB Output is correct
40 Correct 8 ms 5628 KB Output is correct
41 Correct 7 ms 5496 KB Output is correct
42 Correct 7 ms 5624 KB Output is correct
43 Correct 7 ms 5624 KB Output is correct
44 Correct 10 ms 5628 KB Output is correct
45 Correct 10 ms 5624 KB Output is correct
46 Correct 11 ms 5624 KB Output is correct
47 Correct 11 ms 5628 KB Output is correct
48 Correct 10 ms 5624 KB Output is correct
49 Correct 10 ms 5624 KB Output is correct
50 Correct 10 ms 5624 KB Output is correct
51 Correct 10 ms 5624 KB Output is correct
52 Correct 9 ms 5624 KB Output is correct
53 Correct 9 ms 5624 KB Output is correct
54 Correct 8 ms 5624 KB Output is correct
55 Correct 8 ms 5624 KB Output is correct
56 Correct 8 ms 5624 KB Output is correct
57 Correct 8 ms 5628 KB Output is correct
58 Correct 8 ms 5752 KB Output is correct
59 Correct 7 ms 5624 KB Output is correct
60 Correct 7 ms 5624 KB Output is correct
61 Correct 7 ms 5624 KB Output is correct
62 Correct 7 ms 5624 KB Output is correct
63 Correct 7 ms 5624 KB Output is correct
64 Correct 7 ms 5624 KB Output is correct
65 Correct 9 ms 5652 KB Output is correct
66 Correct 10 ms 5624 KB Output is correct
67 Correct 10 ms 5624 KB Output is correct
68 Correct 10 ms 5624 KB Output is correct
69 Correct 8 ms 5624 KB Output is correct
70 Correct 8 ms 5624 KB Output is correct
71 Correct 7 ms 5596 KB Output is correct
72 Correct 7 ms 5624 KB Output is correct
73 Correct 7 ms 5624 KB Output is correct
74 Correct 7 ms 5624 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5032 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5116 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 6 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 6 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 7 ms 5112 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 7 ms 5624 KB Output is correct
39 Correct 8 ms 5624 KB Output is correct
40 Correct 8 ms 5628 KB Output is correct
41 Correct 7 ms 5496 KB Output is correct
42 Correct 7 ms 5624 KB Output is correct
43 Correct 7 ms 5624 KB Output is correct
44 Correct 10 ms 5628 KB Output is correct
45 Correct 10 ms 5624 KB Output is correct
46 Correct 11 ms 5624 KB Output is correct
47 Correct 11 ms 5628 KB Output is correct
48 Correct 10 ms 5624 KB Output is correct
49 Correct 10 ms 5624 KB Output is correct
50 Correct 10 ms 5624 KB Output is correct
51 Correct 10 ms 5624 KB Output is correct
52 Correct 9 ms 5624 KB Output is correct
53 Correct 9 ms 5624 KB Output is correct
54 Correct 8 ms 5624 KB Output is correct
55 Correct 8 ms 5624 KB Output is correct
56 Correct 8 ms 5624 KB Output is correct
57 Correct 8 ms 5628 KB Output is correct
58 Correct 8 ms 5752 KB Output is correct
59 Correct 7 ms 5624 KB Output is correct
60 Correct 7 ms 5624 KB Output is correct
61 Correct 7 ms 5624 KB Output is correct
62 Correct 7 ms 5624 KB Output is correct
63 Correct 7 ms 5624 KB Output is correct
64 Correct 7 ms 5624 KB Output is correct
65 Correct 9 ms 5652 KB Output is correct
66 Correct 10 ms 5624 KB Output is correct
67 Correct 10 ms 5624 KB Output is correct
68 Correct 10 ms 5624 KB Output is correct
69 Correct 8 ms 5624 KB Output is correct
70 Correct 8 ms 5624 KB Output is correct
71 Correct 7 ms 5596 KB Output is correct
72 Correct 7 ms 5624 KB Output is correct
73 Correct 7 ms 5624 KB Output is correct
74 Correct 7 ms 5624 KB Output is correct
75 Correct 267 ms 78180 KB Output is correct
76 Correct 261 ms 76052 KB Output is correct
77 Correct 263 ms 78296 KB Output is correct
78 Correct 304 ms 79480 KB Output is correct
79 Correct 259 ms 78988 KB Output is correct
80 Correct 255 ms 76672 KB Output is correct
81 Correct 2044 ms 82540 KB Output is correct
82 Correct 3405 ms 83844 KB Output is correct
83 Correct 2714 ms 86372 KB Output is correct
84 Correct 2972 ms 89220 KB Output is correct
85 Correct 2143 ms 85944 KB Output is correct
86 Correct 889 ms 82428 KB Output is correct
87 Correct 1012 ms 81512 KB Output is correct
88 Correct 1623 ms 81492 KB Output is correct
89 Correct 1408 ms 85796 KB Output is correct
90 Correct 935 ms 88936 KB Output is correct
91 Correct 530 ms 81896 KB Output is correct
92 Correct 558 ms 81260 KB Output is correct
93 Correct 710 ms 84792 KB Output is correct
94 Correct 423 ms 87908 KB Output is correct
95 Correct 880 ms 89080 KB Output is correct
96 Correct 190 ms 79820 KB Output is correct
97 Correct 214 ms 85916 KB Output is correct
98 Correct 207 ms 84672 KB Output is correct
99 Correct 206 ms 84924 KB Output is correct
100 Correct 196 ms 79992 KB Output is correct
101 Correct 195 ms 79992 KB Output is correct
102 Correct 262 ms 81148 KB Output is correct
103 Correct 255 ms 79952 KB Output is correct
104 Correct 270 ms 84344 KB Output is correct
105 Correct 260 ms 83704 KB Output is correct
106 Correct 260 ms 85880 KB Output is correct
107 Correct 245 ms 82752 KB Output is correct
108 Correct 268 ms 82552 KB Output is correct
109 Correct 330 ms 87208 KB Output is correct
110 Correct 217 ms 84840 KB Output is correct
111 Correct 283 ms 87624 KB Output is correct
112 Correct 210 ms 77048 KB Output is correct
113 Correct 274 ms 86776 KB Output is correct