Submission #462292

#	Time	Username	Problem	Language	Result	Execution time	Memory
462292		grt	새로운 문제 (COCI19_akvizna)	C++17	65 / 130	925 ms	536 KiB

Main

#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

using namespace std;

using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;


const int nax = 3000 + 10;
int n, k;
long double dp[nax];
int cnt[nax];

int main() {_
	cin >> n >> k;
	long double low = 0.0, high = 1.0000, mid;
	for(int rep = 0; rep < 30; ++rep) {
		mid = (low + high) / 2.0;
		for(int used = 0; used <= n; ++used) {
			dp[used] = 0;
			cnt[used] = 0;
			for(int u1 = 1; u1 <= used; ++u1) {
				if(dp[used] < dp[used - u1] + (long double)u1 / (n - (used - u1)) - mid) {
					dp[used] = dp[used - u1] + (long double)u1 / (n - (used - u1)) - mid;
					cnt[used] = cnt[used - u1] + 1;
				}
			}
		}
		if(cnt[n] <= k) {
			high = mid;
		} else {
			low = mid;
		}
	}
	mid = high;
	for(int used = 0; used <= n; ++used) {
		dp[used] = 0;
		cnt[used] = 0;
		for(int u1 = 1; u1 <= used; ++u1) {
			if(dp[used] < dp[used - u1] + (long double)u1 / (n - (used - u1)) - mid) {
				dp[used] = dp[used - u1] + (long double)u1 / (n - (used - u1)) - mid;
				cnt[used] = cnt[used - u1] + 1;
			}
		}
	}
	cout << setprecision(10);
	cout << fixed;
	cout << dp[n] + mid * k; //<< " " << cnt[n];
}

• Subtask 1: 5 / 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: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5
• Subtask 24: 0 / 5
• Subtask 25: 0 / 5
• Subtask 26: 0 / 5