제출 #204950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204950		cheetose	Cake 3 (JOI19_cake3)	C++11	100 / 100	1940 ms	18784 KiB

cake3

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

Pll tree[524288];
VPll vv;
int b[200000];
void upd(int node, int S, int E, int k,int c)
{
	if (S == E)
	{
		if(c>0)tree[node]=mp(1,vv[k].X);
		else tree[node]=mp(0,0);
		return;
	}
	if (k <= (S + E) / 2)upd(node * 2, S, (S + E) / 2, k,c);
	else upd(node * 2 + 1, (S + E) / 2 + 1, E, k,c);
	tree[node].X=tree[node<<1].X+tree[node<<1|1].X;
	tree[node].Y=tree[node<<1].Y+tree[node<<1|1].Y;
}

ll find(int node, int S, int E, int k)
{
	if (tree[node].X==k)return tree[node].Y;
	if(tree[node<<1|1].X<k)return tree[node<<1|1].Y+find(node<<1,S,S+E>>1,k-tree[node<<1|1].X);
	return find(node<<1|1,(S+E>>1)+1,E,k);
}
Pll p[200000];
int n,m;
int L,R;
void ins(int i)
{
	upd(1,0,n-1,b[i],1);
}
void era(int i)
{
	upd(1,0,n-1,b[i],-1);
}
ll f(int l,int r)
{
	if(r-l+1<m-2)return -INF;
	while(r>R)ins(++R);
	while(L>l)ins(--L);
	while(r<R)era(R--);
	while(L<l)era(L++);
	return find(1,0,n-1,m-2);
}
ll g(int S,int E,int l,int r)
{
	S=max(S,l+m-1);
	if(S>E)return -INF;
	int M=S+E>>1;
	ll res=-INF;
	int w=-1;
	fdn(i,min(r,M-m+1),l,1)
	{
		ll tmp=f(i+1,M-1)+p[i].X+p[M].X-2*(p[M].Y-p[i].Y);
		if(tmp>res)res=tmp,w=i;
	}
	return max({res,g(M+1,E,w,r),g(S,M-1,l,w)});
}
int main() {
	scanf("%d%d",&n,&m);
	L=R=n-1>>1;
	R--;
	fup(i,0,n-1,1)scanf("%lld%lld",&p[i].X,&p[i].Y);
	sort(p,p+n,[&](Pll p1,Pll p2){return p1.Y<p2.Y;});
	fup(i,0,n-1,1)vv.pb(mp(p[i].X,i));
	sort(ALL(vv));
	fup(i,0,n-1,1)b[vv[i].Y]=i;
	printf("%lld\n",g(0,n-1,0,n-1));
}

컴파일 시 표준 에러 (stderr) 메시지

cake3.cpp: In function 'll find(int, int, int, int)':
cake3.cpp:64:66: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  if(tree[node<<1|1].X<k)return tree[node<<1|1].Y+find(node<<1,S,S+E>>1,k-tree[node<<1|1].X);
                                                                 ~^~
cake3.cpp:65:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  return find(node<<1|1,(S+E>>1)+1,E,k);
                         ~^~
cake3.cpp: In function 'll g(int, int, int, int)':
cake3.cpp:91:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int M=S+E>>1;
        ~^~
cake3.cpp: In function 'int main()':
cake3.cpp:103:7: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  L=R=n-1>>1;
      ~^~
cake3.cpp:102: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:105:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%lld%lld",&p[i].X,&p[i].Y);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 76 / 76