Submission #282658

#	Time	Username	Problem	Language	Result	Execution time	Memory
282658		cgiosy	새로운 문제 (COCI19_akvizna)	C++17	125 / 130	109 ms	2000 KiB

Main

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using flt=double;

struct fn {
	flt x;
	int j, c;
};
int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int N, K;
	cin>>N>>K;
	flt l=0, r=2;
	cout<<fixed<<setprecision(9);
	auto f=[&](flt m, bool skip=true) {
		deque<fn> Q;
		Q.push_back({0., 0, 0});
		for(int i=1; i<=N; i++) {
			auto f=[&](fn& a) {
				return a.x-flt(a.j)/i+1;
			};
			flt last=f(Q.front()), prv;
			while(Q.size()>1 && last<=(prv=f(*++Q.begin())))
				last=prv, Q.pop_front();
			fn t{last-=m, i, Q.front().c+1};
			if(t.c>K && skip)
				return make_pair(t.c, t.x);
			while(Q.size() && last>=(prv=f(Q.back())))
				Q.pop_back();
			Q.push_back(t);
		}
		fn t=Q.back();
		return make_pair(t.c, t.x+K*m);
	};
	while(r-l>1e-12) {
		flt m=(l+r)/2;
		auto[k,x]=f(m);
		if(k<K) r=m;
		else if(k>K) l=m;
		else { cout<<x; return 0; }
	}
	cout<<f((l+r)/2, false).second;
}

• Subtask 1: 0 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 5 / 5
• Subtask 24: 5 / 5
• Subtask 25: 5 / 5
• Subtask 26: 5 / 5