제출 #262977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262977		dorijanlendvaj	Cake 3 (JOI19_cake3)	C++14	24 / 100	121 ms	38788 KiB

cake3

//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int n,m;
pair<ll,ll> h[N];
vl dp[N];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)[phone]);
	cin>>n>>m;
	for (int i=0;i<n;++i) cin>>h[i].y>>h[i].x;
	sort(h,h+n);
	for (int i=0;i<n;++i) swap(h[i].y,h[i].x);
	if (n*1ll*m<=1e9)
	{
		for (int i=0;i<=n;++i) dp[i]=vl(m+2,-LLINF);
		ll ma=-LLINF;
		for (int i=0;i<n;++i)
		{
			ma=max(ma,dp[i][m-1]+h[i].x-2*h[i].y);
			for (int j=0;j<m;++j) dp[i+1][j+1]=max(dp[i][j+1],dp[i][j]+h[i].x);
			dp[i+1][1]=max(dp[i+1][1],h[i].x+2*h[i].y);
		}
		cout<<ma<<en;
		exit(0);
	}
	ll lo=-MOD*3ll,hi=MOD*3ll;
	while (lo<hi)
	{
		ll mid=lo+(hi-lo+1)/2;
		pair<ll,int> bmi={-LLINF,-LLINF};
		pair<ll,int> sol={-LLINF,-LLINF};
		for (int i=0;i<n;++i)
		{
			sol=max(sol,{bmi.x+h[i].x-2*h[i].y-mid,bmi.y+1});
			bmi=max(bmi,{bmi.x+h[i].x-mid,bmi.y+1});
			bmi=max(bmi,{h[i].x+2*h[i].y-mid,1});
		}
		//cout<<mid<<' '<<sol.y<<endl;
		if (sol.y<m) hi=mid-1;
		else lo=mid;
	}
	ll mid=lo;
	pair<ll,int> bmi={-LLINF,-LLINF};
	pair<ll,int> sol={-LLINF,-LLINF};
	for (int i=0;i<n;++i)
	{
		sol=max(sol,{bmi.x+h[i].x-2*h[i].y-mid,bmi.y+1});
		bmi=max(bmi,{bmi.x+h[i].x-mid,bmi.y+1});
		bmi=max(bmi,{h[i].x+2*h[i].y-mid,1});
		//cout<<mid<<' '<<bmi.x<<' '<<bmi.y<<' '<<sol.x<<' '<<sol.y<<endl;
	}
	cout<<sol.x+m*mid<<en;
}

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