oj.uz

Submission #262977

# Submission time Handle Problem Language Result Execution time Memory
262977 2020-08-13T11:36:39 Z dorijanlendvaj Cake 3 (JOI19_cake3) C++14
24 / 100
 121 ms 38788 KB 
//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)+13893829);
	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.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 5 ms 7552 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 6 ms 7424 KB Output is correct
14 Correct 6 ms 7424 KB Output is correct
15 Correct 6 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 7 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct
20 Correct 5 ms 7424 KB Output is correct
21 Correct 5 ms 7424 KB Output is correct
22 Correct 5 ms 7424 KB Output is correct
23 Correct 5 ms 7424 KB Output is correct
24 Correct 6 ms 7424 KB Output is correct
25 Correct 6 ms 7424 KB Output is correct
26 Correct 6 ms 7552 KB Output is correct
27 Correct 7 ms 7424 KB Output is correct
28 Correct 6 ms 7424 KB Output is correct
29 Correct 6 ms 7424 KB Output is correct
30 Correct 6 ms 7424 KB Output is correct
31 Correct 5 ms 7424 KB Output is correct
32 Correct 6 ms 7424 KB Output is correct
33 Correct 6 ms 7424 KB Output is correct
34 Correct 5 ms 7424 KB Output is correct
35 Correct 6 ms 7424 KB Output is correct
36 Correct 6 ms 7424 KB Output is correct
37 Correct 5 ms 7424 KB Output is correct
38 Correct 15 ms 14736 KB Output is correct
39 Correct 16 ms 17408 KB Output is correct
40 Correct 20 ms 23656 KB Output is correct
41 Correct 19 ms 20992 KB Output is correct
42 Correct 24 ms 28928 KB Output is correct
43 Correct 21 ms 23552 KB Output is correct
44 Correct 15 ms 16640 KB Output is correct
45 Correct 15 ms 17152 KB Output is correct
46 Correct 16 ms 17280 KB Output is correct
47 Correct 15 ms 14080 KB Output is correct
48 Correct 13 ms 14720 KB Output is correct
49 Correct 19 ms 21608 KB Output is correct
50 Correct 19 ms 20480 KB Output is correct
51 Correct 18 ms 21248 KB Output is correct
52 Correct 18 ms 21120 KB Output is correct
53 Correct 19 ms 21632 KB Output is correct
54 Correct 22 ms 27008 KB Output is correct
55 Correct 24 ms 28672 KB Output is correct
56 Correct 26 ms 28288 KB Output is correct
57 Correct 22 ms 26656 KB Output is correct
58 Correct 22 ms 27136 KB Output is correct
59 Correct 15 ms 17792 KB Output is correct
60 Correct 15 ms 16384 KB Output is correct
61 Correct 20 ms 18432 KB Output is correct
62 Correct 21 ms 23936 KB Output is correct
63 Correct 26 ms 24320 KB Output is correct
64 Correct 18 ms 21760 KB Output is correct
65 Correct 15 ms 15360 KB Output is correct
66 Correct 16 ms 16896 KB Output is correct
67 Correct 15 ms 14976 KB Output is correct
68 Correct 19 ms 20480 KB Output is correct
69 Correct 18 ms 20352 KB Output is correct
70 Correct 18 ms 20224 KB Output is correct
71 Correct 15 ms 13696 KB Output is correct
72 Correct 22 ms 25888 KB Output is correct
73 Correct 14 ms 15744 KB Output is correct
74 Correct 37 ms 38788 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 5 ms 7552 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 6 ms 7424 KB Output is correct
14 Correct 6 ms 7424 KB Output is correct
15 Correct 6 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 7 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct
20 Correct 5 ms 7424 KB Output is correct
21 Correct 5 ms 7424 KB Output is correct
22 Correct 5 ms 7424 KB Output is correct
23 Correct 5 ms 7424 KB Output is correct
24 Correct 6 ms 7424 KB Output is correct
25 Correct 6 ms 7424 KB Output is correct
26 Correct 6 ms 7552 KB Output is correct
27 Correct 7 ms 7424 KB Output is correct
28 Correct 6 ms 7424 KB Output is correct
29 Correct 6 ms 7424 KB Output is correct
30 Correct 6 ms 7424 KB Output is correct
31 Correct 5 ms 7424 KB Output is correct
32 Correct 6 ms 7424 KB Output is correct
33 Correct 6 ms 7424 KB Output is correct
34 Correct 5 ms 7424 KB Output is correct
35 Correct 6 ms 7424 KB Output is correct
36 Correct 6 ms 7424 KB Output is correct
37 Correct 5 ms 7424 KB Output is correct
38 Correct 15 ms 14736 KB Output is correct
39 Correct 16 ms 17408 KB Output is correct
40 Correct 20 ms 23656 KB Output is correct
41 Correct 19 ms 20992 KB Output is correct
42 Correct 24 ms 28928 KB Output is correct
43 Correct 21 ms 23552 KB Output is correct
44 Correct 15 ms 16640 KB Output is correct
45 Correct 15 ms 17152 KB Output is correct
46 Correct 16 ms 17280 KB Output is correct
47 Correct 15 ms 14080 KB Output is correct
48 Correct 13 ms 14720 KB Output is correct
49 Correct 19 ms 21608 KB Output is correct
50 Correct 19 ms 20480 KB Output is correct
51 Correct 18 ms 21248 KB Output is correct
52 Correct 18 ms 21120 KB Output is correct
53 Correct 19 ms 21632 KB Output is correct
54 Correct 22 ms 27008 KB Output is correct
55 Correct 24 ms 28672 KB Output is correct
56 Correct 26 ms 28288 KB Output is correct
57 Correct 22 ms 26656 KB Output is correct
58 Correct 22 ms 27136 KB Output is correct
59 Correct 15 ms 17792 KB Output is correct
60 Correct 15 ms 16384 KB Output is correct
61 Correct 20 ms 18432 KB Output is correct
62 Correct 21 ms 23936 KB Output is correct
63 Correct 26 ms 24320 KB Output is correct
64 Correct 18 ms 21760 KB Output is correct
65 Correct 15 ms 15360 KB Output is correct
66 Correct 16 ms 16896 KB Output is correct
67 Correct 15 ms 14976 KB Output is correct
68 Correct 19 ms 20480 KB Output is correct
69 Correct 18 ms 20352 KB Output is correct
70 Correct 18 ms 20224 KB Output is correct
71 Correct 15 ms 13696 KB Output is correct
72 Correct 22 ms 25888 KB Output is correct
73 Correct 14 ms 15744 KB Output is correct
74 Correct 37 ms 38788 KB Output is correct
75 Correct 121 ms 14072 KB Output is correct
76 Correct 100 ms 13664 KB Output is correct
77 Correct 117 ms 13920 KB Output is correct
78 Correct 121 ms 14152 KB Output is correct
79 Correct 92 ms 14072 KB Output is correct
80 Correct 102 ms 13816 KB Output is correct
81 Incorrect 113 ms 13176 KB Output isn't correct
82 Halted 0 ms 0 KB -