oj.uz

Submission #144079

# Submission time Handle Problem Language Result Execution time Memory
144079 2019-08-16T01:36:32 Z liwi Akvizna (COCI19_akvizna) C++11
65 / 130
 1500 ms 63352 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1190492669
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 3005
#define MAXV 3005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

struct node{
	int l,r;
	pair<int,pdd> bst;
};

struct MaxLiChaoTree{
	node seg[4*MAXV];
	inline double calc(int rt, int m){return seg[rt].bst.second.first*m+seg[rt].bst.second.second;}
	inline double calc(pdd bst, int m){return bst.first*m+bst.second;}
	inline ld inter(pdd f, pdd s){return (s.second-f.second)/(f.first-s.first);}
	void build(int l, int r, int rt){
		seg[rt].l = l, seg[rt].r = r, seg[rt].bst = mp(-1,mp(0,-LL_INF));
		if(l == r) return;
		int mid = (l+r)/2;
		build(l,mid,rt<<1);
		build(mid+1,r,rt<<1|1);
	}
	void add_line(int rt, pair<int,pdd> line){
		if(seg[rt].l == seg[rt].r){
			if(calc(line.second,seg[rt].l) >= calc(rt,seg[rt].l)) seg[rt].bst = line;
			return;
		}
		int mid = (seg[rt].l+seg[rt].r)/2;
		bool f = calc(rt,seg[rt].l) <= calc(line.second,seg[rt].l);
		bool s = calc(rt,seg[rt].r) <= calc(line.second,seg[rt].r);
		if(f && s){
			seg[rt].bst = line;
			return;
		}else if(!f && !s) return;
		ld x = inter(line.second,seg[rt].bst.second);
		if(x <= mid){
			if(calc(line.second,mid) >= calc(rt,mid)) swap(line,seg[rt].bst);
			add_line(rt<<1,line);
		}else{
			if(calc(line.second,mid) >= calc(rt,mid)) swap(line,seg[rt].bst);
			add_line(rt<<1|1,line);
		}
	}
	pair<double,int> get(int rt, int pos){
		if(seg[rt].l == seg[rt].r) return mp(calc(rt,pos),seg[rt].bst.first);
		int mid = (seg[rt].l+seg[rt].r)/2;
		if(pos <= mid) return max(mp(calc(rt,pos),seg[rt].bst.first),get(rt<<1,pos));
		return max(mp(calc(rt,pos),seg[rt].bst.first),get(rt<<1|1,pos));
	}
};

int N,K;
double dp2[MAXN][MAXN];
pair<double,int> dp[MAXN];
MaxLiChaoTree t;

inline int getGroups(double C){
	t.build(1,N,1);
	t.add_line(1,mp(0,mp(0,0)));
	for(int k=1; k<=N; k++){
		pair<double,int> q = t.get(1,k);
		dp[k] = mp((q.first+k)/k-C,dp[q.second].second+1);
		t.add_line(1,mp(k,mp(dp[k].first,-k)));
	}
	return dp[N].second;
}

inline double inter(int g, int j, int k){
	double m1 = dp2[g-1][j], b1 = -j;
	double m2 = dp2[g-1][k], b2 = -k;
	return (b2-b1)/(m1-m2);
}

inline double solve(){
	for(int k=1; k<=K; k++){
		deque<int> dq; dq.pb(0);
		for(int i=1; i<=N; i++){
			while(dq.size() >= 2 && dp2[k-1][dq[0]]*i-dq[0] <= dp2[k-1][dq[1]]*i-dq[1]) dq.pop_front();
			dp2[k][i] = (dp2[k-1][dq[0]]*i-dq[0])/i+1;
			while(dq.size() >= 2 && inter(k,dq[dq.size()-2],i) <= inter(k,dq[dq.size()-2],dq.back())) dq.pop_back();
			dq.pb(i);
		}
	}
	return dp2[K][N];
}

int main(){
	scanf("%d %d",&N,&K);
//	double low = 0, high = 20, ans = 0;
//	while(high-low >= 1e-15){
//		double mid = (low+high)/2;
//		int g = getGroups(mid);
//		if(g <= K){
//			ans = mid;
//			high = mid-1e-15;
//		}else low = mid+1e-15;
//	}
//	getGroups(ans);
	double res = solve(); //dp[N].first-ans*K;
	printf("%.8f\n",res);
}
/*
2 1
ans=1.5
 */

Compilation message

akvizna.cpp: In function 'int main()':
akvizna.cpp:130:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&N,&K);
  ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 732 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1016 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 3 ms 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 10516 KB Output is correct
2 Correct 159 ms 37436 KB Output is correct
3 Correct 184 ms 53652 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 13612 KB Output is correct
2 Correct 127 ms 32764 KB Output is correct
3 Correct 199 ms 57656 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11000 KB Output is correct
2 Correct 89 ms 25160 KB Output is correct
3 Correct 186 ms 57928 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 13952 KB Output is correct
2 Correct 119 ms 30260 KB Output is correct
3 Correct 200 ms 58952 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 9528 KB Output is correct
2 Correct 118 ms 29816 KB Output is correct
3 Correct 180 ms 51420 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10104 KB Output is correct
2 Correct 160 ms 41080 KB Output is correct
3 Correct 204 ms 57116 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 8696 KB Output is correct
2 Correct 157 ms 41292 KB Output is correct
3 Correct 219 ms 63352 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 9040 KB Output is correct
2 Correct 118 ms 30964 KB Output is correct
3 Correct 193 ms 55628 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 12536 KB Output is correct
2 Correct 132 ms 35676 KB Output is correct
3 Correct 199 ms 57620 KB Output is correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1550 ms 15076 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1575 ms 15256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1556 ms 15144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1572 ms 14664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1557 ms 15160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1569 ms 14320 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1563 ms 14676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1552 ms 15236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #22
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1568 ms 14520 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1564 ms 14420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #24
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1564 ms 14212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #25
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1552 ms 14140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #26
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1574 ms 14488 KB Time limit exceeded
2 Halted 0 ms 0 KB -