제출 #222126

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

Main

#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;

typedef long double ld;


ld dp[5001][5001];

int main()
{

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k;

    cin >> n >> k;

    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= k; j++) dp[i][j] = 0;

    for (int i = n; i >= 0; i--)
        for (int j = 0; j < k; j++)
          for (int u = 0; u <= i; u++)
            {
                ld x = i;

                ld y = u;

                ld sm = 0;

                if (x != 0) sm = y / x;

                if (dp[i][j] + sm > dp[i - u][j + 1]) dp[i - u][j + 1] = dp[i][j] + sm;
            }
    cout << setprecision(10) << fixed;

    ld ans = 0;

    for (int i = 0; i <= n; i++) ans = max(ans, dp[i][k]);

    cout << ans << endl;
}

• 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