Submission #537805

#	Time	Username	Problem	Language	Result	Execution time	Memory
537805		Servus2022	새로운 문제 (COCI19_akvizna)	C++14	20 / 130	2 ms	776 KiB

Main

#include <bits/stdc++.h>

using namespace std;
const int NMAX = 105;
long double dp[NMAX][NMAX];
int From[NMAX][NMAX];

int N, K;
int main()
{
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>N>>K;
    for (int i = 1; i <= N; ++ i )
        for (int j = 1; j <= K; ++ j )
            dp[i][j] = 0;

    for (int i = 1; i <= N; ++ i ) {
        dp[i][1] = 1;
        From[i][1] = i;
    }

    for (int j = 2; j <= K; ++ j ) {
        for (int i = 1; i <= N; ++ i ) {
            int X_Best = 0;
            for (int x = 0; x <= i; ++ x ) {
                long double pos_ans = (long double)(1.0*x / (1.0*i)) + dp[i-x][j-1];

                if (pos_ans > dp[i][j]) {
                    dp[i][j] = pos_ans;
                    From[i][j] = x;
                }
            }
        }
    }
    cout<<fixed << setprecision(10)<<dp[N][K] << '\n';

    /*for (int i = K; i >= 1; -- i ) {
        cout << From[N][i] << " ";
        N -= From[N][i];
    }*/
    return 0;
}

Compilation message (stderr)

akvizna.cpp: In function 'int main()':
akvizna.cpp:27:17: warning: unused variable 'X_Best' [-Wunused-variable]
   27 |             int X_Best = 0;
      |                 ^~~~~~

• 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