제출 #249538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249538		NONAME	새로운 문제 (COCI19_akvizna)	C++14	65 / 130	783 ms	262148 KiB

Main

#include  <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;

int n, m;
ld f[5000][5000];

int main() {
    fast_io;

    cin >> n >> m;

    for (int i = 0; i <= m; ++i)
    for (int j = 0; j <= n; ++j)
        f[i][j] = -1;
    f[0][n] = 0;

    for (int t = 0; t < m; ++t)
    for (int i = 1; i <= n; ++i) {
        if (f[t][i] == -1)
            continue;

        for (int j = 1; j <= min(i, (n / (t + 1))); ++j)
            f[t + 1][i - j] = max(f[t + 1][i - j], (i * f[t][i] + j) / i);
    }


    cout.precision(8); cout << fixed;
    cout << f[m][0];
}

• 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