제출 #462281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462281		grt	새로운 문제 (COCI19_akvizna)	C++17	20 / 130	1599 ms	10024 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][nax];

int main() {_
	cin >> n >> k;
	for(int used = 0; used <= n; ++used) {
		for(int r = 1; r <= k; ++r) {
			for(int u1 = 0; u1 <= used; ++u1) {
				dp[used][r] = max(dp[used][r], dp[used - u1][r - 1] + (long double)u1 / (n - (used - u1)));
			}
		}
	}
	cout << setprecision(10);
	cout << fixed;
	cout << dp[n][k];
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 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