oj.uz

Submission #545554

# Submission time Handle Problem Language Result Execution time Memory
545554 2022-04-04T19:54:52 Z NaimSS Cake 3 (JOI19_cake3) C++14
100 / 100
 1068 ms 206352 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}
  
// debug:
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
  cerr << ' ' << H; 
  dbg_out(T...); 
}
#ifdef LOCAL
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 200100;
pll a[N];// (V,C)
int pos[N];
struct node{
  node *l,*r;
  ll sum;
  int qtd=0;
  node(ll v = 0,int q=0){
    l = r = NULL;
    sum = v;
	qtd = q;
  }
};
typedef node* pnode;
pnode version[N];


void build(pnode no,int i,int j){
  if(i == j){
    return;
  }
  int mid = (i+j)/2;
  no->l = new node();
  no->r = new node();
  build(no->l,i,mid);
  build(no->r,mid+1,j);
}

void upd(pnode no,pnode old,int i,int j,int p,ll v){

  if(i == j){
    no->sum = old->sum + v;
	no->qtd = old->qtd + 1;
    return;
  }
  int mid = (i+j)/2;
  if(p<=mid){
    no->r = old->r;
    if(no->l == NULL)no->l = new node();
    upd(no->l,old->l,i,mid,p,v);
  }else{
    no->l = old->l;
    if(no->r == NULL)no->r = new node();
    upd(no->r,old->r,mid+1,j,p,v);
  }
  no->sum = no->l->sum + no->r->sum;
  no->qtd = no->l->qtd + no->r->qtd;
}
ll rev[N];
pll query(pnode no,pnode old,int i,int j,int k){
  if(i>j || k<=0 || no==NULL || old==NULL)return pll(0,0);
  if(i==j){
	  int put = min(no->qtd-old->qtd,k); 
	  if(put ==0)return pll(0,0);
	  return pll(rev[i] * put,put);
  }
  if(no->qtd - old->qtd <= k){
	  return pll(no->sum - old->sum,no->qtd - old->qtd);
  }
  int m = (i+j)/2;
  auto a = query(no->r,old->r,m+1,j,k);
  k-=a.ss;
  auto b = query(no->l,old->l,i,m,k);
  k-=b.ss;
  return pll(a.ff + b.ff,a.ss + b.ss);
}
int T;
ll res = -1e18;
	int n,M;

void solve(int l,int r,int optl,int optr){
	if(l > r)return;
	int m = (l+r)/2;
	int optm=-1;
	ll mx = -1e18;
	for(int i = optl;i<=optr;i++){
		if(m-i+1 < M)continue;
		ll p1=-2ll * (a[m].ss - a[i].ss),p2 = a[m].ff + a[i].ff + query(version[m-1],version[i],1,T,M-2).ff;
		ll cur = p1+p2;
		if(cur > mx){
			mx = cur;
			optm = i;
		}
	}
	res=max(res,mx);
	if(optm==-1){
		solve(m+1,r,optl,optr);
	}
	else{
		solve(l,m-1,optl,optm);
		solve(m+1,r,optm,optr);
	}
}

int32_t main(){
    fastio;
	cin >> n >> M;
	vi vals;
	rep(i,1,n+1){
		cin >> a[i].ff >> a[i].ss;
		vals.pb(a[i].ff);
	}
	Unique(vals);
	sort(a+1,a+1+n,[&](pll A,pll B){
		return A.ss < B.ss;
	});

	T = sz(vals);
	rep(i,1,n+1){
		pos[i] = lower_bound(all(vals),a[i].ff) - vals.begin() + 1;
		rev[pos[i]] = a[i].ff;
	}
	version[0] = new node();
	build(version[0],1,T);
	for(int i=1;i<=n;i++){
		version[i] = new node();
		upd(version[i],version[i-1],1,T,pos[i],a[i].ff);
	}

	solve(1,n,1,n);
	cout << res << endl;


    // math -> gcd it all
    // Did u check N=1? Did you switch N,M?
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 372 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 1664 KB Output is correct
39 Correct 4 ms 1748 KB Output is correct
40 Correct 4 ms 1620 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 3 ms 1620 KB Output is correct
43 Correct 3 ms 1620 KB Output is correct
44 Correct 3 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 4 ms 1748 KB Output is correct
47 Correct 5 ms 1620 KB Output is correct
48 Correct 4 ms 1532 KB Output is correct
49 Correct 4 ms 1748 KB Output is correct
50 Correct 4 ms 1692 KB Output is correct
51 Correct 4 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 5 ms 1620 KB Output is correct
54 Correct 3 ms 1748 KB Output is correct
55 Correct 3 ms 1664 KB Output is correct
56 Correct 4 ms 1620 KB Output is correct
57 Correct 3 ms 1620 KB Output is correct
58 Correct 3 ms 1664 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 600 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 4 ms 1620 KB Output is correct
66 Correct 4 ms 1620 KB Output is correct
67 Correct 4 ms 1620 KB Output is correct
68 Correct 4 ms 1668 KB Output is correct
69 Correct 4 ms 1620 KB Output is correct
70 Correct 3 ms 1620 KB Output is correct
71 Correct 2 ms 724 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 4 ms 1620 KB Output is correct
74 Correct 3 ms 1748 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 372 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 1664 KB Output is correct
39 Correct 4 ms 1748 KB Output is correct
40 Correct 4 ms 1620 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 3 ms 1620 KB Output is correct
43 Correct 3 ms 1620 KB Output is correct
44 Correct 3 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 4 ms 1748 KB Output is correct
47 Correct 5 ms 1620 KB Output is correct
48 Correct 4 ms 1532 KB Output is correct
49 Correct 4 ms 1748 KB Output is correct
50 Correct 4 ms 1692 KB Output is correct
51 Correct 4 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 5 ms 1620 KB Output is correct
54 Correct 3 ms 1748 KB Output is correct
55 Correct 3 ms 1664 KB Output is correct
56 Correct 4 ms 1620 KB Output is correct
57 Correct 3 ms 1620 KB Output is correct
58 Correct 3 ms 1664 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 600 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 4 ms 1620 KB Output is correct
66 Correct 4 ms 1620 KB Output is correct
67 Correct 4 ms 1620 KB Output is correct
68 Correct 4 ms 1668 KB Output is correct
69 Correct 4 ms 1620 KB Output is correct
70 Correct 3 ms 1620 KB Output is correct
71 Correct 2 ms 724 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 4 ms 1620 KB Output is correct
74 Correct 3 ms 1748 KB Output is correct
75 Correct 1020 ms 188692 KB Output is correct
76 Correct 1068 ms 185892 KB Output is correct
77 Correct 924 ms 191844 KB Output is correct
78 Correct 965 ms 194860 KB Output is correct
79 Correct 350 ms 195656 KB Output is correct
80 Correct 408 ms 189644 KB Output is correct
81 Correct 662 ms 151832 KB Output is correct
82 Correct 798 ms 162612 KB Output is correct
83 Correct 789 ms 160648 KB Output is correct
84 Correct 745 ms 162036 KB Output is correct
85 Correct 622 ms 153284 KB Output is correct
86 Correct 392 ms 142284 KB Output is correct
87 Correct 396 ms 141792 KB Output is correct
88 Correct 538 ms 144712 KB Output is correct
89 Correct 512 ms 149948 KB Output is correct
90 Correct 398 ms 152084 KB Output is correct
91 Correct 353 ms 139104 KB Output is correct
92 Correct 307 ms 138436 KB Output is correct
93 Correct 359 ms 144668 KB Output is correct
94 Correct 302 ms 147780 KB Output is correct
95 Correct 411 ms 151620 KB Output is correct
96 Correct 64 ms 17492 KB Output is correct
97 Correct 72 ms 18852 KB Output is correct
98 Correct 82 ms 18608 KB Output is correct
99 Correct 71 ms 18628 KB Output is correct
100 Correct 64 ms 17600 KB Output is correct
101 Correct 62 ms 17540 KB Output is correct
102 Correct 559 ms 121676 KB Output is correct
103 Correct 500 ms 119560 KB Output is correct
104 Correct 636 ms 129340 KB Output is correct
105 Correct 396 ms 120216 KB Output is correct
106 Correct 441 ms 123000 KB Output is correct
107 Correct 400 ms 116952 KB Output is correct
108 Correct 962 ms 193684 KB Output is correct
109 Correct 860 ms 205976 KB Output is correct
110 Correct 115 ms 46916 KB Output is correct
111 Correct 158 ms 47544 KB Output is correct
112 Correct 1000 ms 183700 KB Output is correct
113 Correct 397 ms 206352 KB Output is correct