제출 #222128

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222128		VEGAnn	새로운 문제 (COCI19_akvizna)	C++14	0 / 130	8 ms	460 KiB

Main

#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define ft first
#define sd second
#define MP make_pair
#define all(x) x.begin(),x.end()
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 3010;
const ll OO = 1e18;
const ld E = 1e-9;
vector<int> vc;
ld f[N][N];
int n, k;
pii pr[N][N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    freopen("in.txt","r",stdin);

    cin >> n >> k;

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

    f[0][n] = 0.0;

    for (int i = 0; i < k; i++)
    for (int j = 1; j <= n; j++){
        if (f[i][j] < -E) continue;

//        for (int nw = j; nw > 0; nw--) {
        for (int nw = 1; nw <= j; nw++) {
            ld ad = f[i][j] + ld(nw) / ld(j);

            if (f[i + 1][j - nw] + E < ad) {
                f[i + 1][j - nw] = ad;
                pr[i + 1][j - nw] = MP(i, j);
            }
        }
    }

    int i = k, j = 0;

    while (j < n){
        vc.PB(j);
        pii nt = pr[i][j];
        i = nt.ft;
        j = nt.sd;
    }
    vc.PB(n);
    reverse(all(vc));

    for (int it = 1; it < sz(vc); it++)
        cout << vc[it - 1] - vc[it] << " " << it << '\n';

    cout << fixed << setprecision(10) << f[k][0];

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

akvizna.cpp: In function 'int main()':
akvizna.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("in.txt","r",stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~

• 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