제출 #222211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222211		Vimmer	새로운 문제 (COCI19_akvizna)	C++14	0 / 130	541 ms	504 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;


int n, k;

ld calc(int ost, int v, int j)
{
    ld ans = 0;

    while (n - ost >= v && j + 1 < k)
    {
        ost += v;

        ans += ld(v) / ld(ost);

        j++;
    }

    if (n - ost != 0) ans += ld(n - ost) / ld(n);

    return ans;
}

int main()
{

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

    cin >> n >> k;

    ld ans = 0;

    int sm = 0, v = 1, j = 0;

    while (sm < n && j < k)
    {
        ld sum = calc(sm, v, j);

        ld nsum = calc(sm, v + 1, j);

        if (sum >= nsum) {sm += v; if (j + 1 != k) ans += ld(v) / ld(sm); j++; if (j == k) ans += sum; continue;}

        v++;
    }

    cout << setprecision(9) << fixed;

    cout << ans << endl;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 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