Submission #144077

#TimeUsernameProblemLanguageResultExecution timeMemory
144077liwi새로운 문제 (COCI19_akvizna)C++11
20 / 130
1587 ms57652 KiB
#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 solve(){ for(int k=1; k<=K; k++){ t.build(1,N,1); t.add_line(1,mp(0,mp(0,0))); for(int i=1; i<=N; i++){ dp2[k][i] = (t.get(1,i).first+i)/i; t.add_line(1,mp(i,mp(dp2[k-1][i],-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 (stderr)

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