oj.uz

답안 #254201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254201 2020-07-29T14:09:24 Z NONAME Akvizna (COCI19_akvizna) C++14
130 / 130
 70 ms 3584 KB 
#include <bits/stdc++.h>
#define m first
#define b second
#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;
typedef pair <double, double> line;

const int N = int(2e5) + 500;
const int base = int(1e9) + 7;

double dp[N];
int n, k;
int cnt[N], which[N];
line lines[N];

double intersect(line f, line s) { return (f.m == s.m) ? 1e18 : (f.b - s.b) / (s.m - f.m); }
double val(line a, double x) { return (a.m * x + a.b); }

void solve(double cost) {
    int l = 0, r = 0;
    dp[0] = cnt[0] = 0;
    for (int i = 1; i <= n; ++i) {
        line nline = {dp[i - 1], -i};
        while (r - l > 1 && intersect(nline, lines[r - 1]) < intersect(lines[r - 1], lines[r - 2]))
            --r;
        which[r] = i - 1;
        lines[r++] = nline;
        while (r - l > 1 && val(lines[l], i) <= val(lines[l + 1], i))
            ++l;
        dp[i] = (val(lines[l], i) + i + 1) / i - cost;
        cnt[i] = cnt[which[l]] + 1;
    }
}

int main() {
    fast_io;

    cin >> n >> k;
    double low = 0, high = 20;

    while (high - low >= 1e-12) {
        double md = (low + high) / 2;
        solve(md);

        if (cnt[n] <= k) high = md;
            else low = md;
    }

    solve(high);
    cout.precision(20); cout << fixed;
    cout << dp[n] + cnt[n] * high << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #12
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #13
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #14
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 3200 KB Output is correct
2 Correct 55 ms 3448 KB Output is correct
3 Correct 57 ms 3200 KB Output is correct

Subtask #15
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 3448 KB Output is correct
2 Correct 62 ms 3456 KB Output is correct
3 Correct 58 ms 3328 KB Output is correct

Subtask #16
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 3200 KB Output is correct
2 Correct 60 ms 3456 KB Output is correct
3 Correct 60 ms 3456 KB Output is correct

Subtask #17
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 3328 KB Output is correct
2 Correct 61 ms 3456 KB Output is correct
3 Correct 55 ms 3248 KB Output is correct

Subtask #18
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 3200 KB Output is correct
2 Correct 57 ms 3456 KB Output is correct
3 Correct 58 ms 3344 KB Output is correct

Subtask #19
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 3456 KB Output is correct
2 Correct 53 ms 3384 KB Output is correct
3 Correct 57 ms 3352 KB Output is correct

Subtask #20
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 3440 KB Output is correct
2 Correct 55 ms 3200 KB Output is correct
3 Correct 55 ms 3200 KB Output is correct

Subtask #21
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 3328 KB Output is correct
2 Correct 60 ms 3456 KB Output is correct
3 Correct 55 ms 3200 KB Output is correct

Subtask #22
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 3456 KB Output is correct
2 Correct 59 ms 3328 KB Output is correct
3 Correct 59 ms 3456 KB Output is correct

Subtask #23
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 3456 KB Output is correct
2 Correct 58 ms 3380 KB Output is correct
3 Correct 57 ms 3456 KB Output is correct

Subtask #24
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 3456 KB Output is correct
2 Correct 70 ms 3576 KB Output is correct
3 Correct 63 ms 3576 KB Output is correct

Subtask #25
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 3584 KB Output is correct
2 Correct 57 ms 3456 KB Output is correct
3 Correct 63 ms 3456 KB Output is correct

Subtask #26
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 3456 KB Output is correct
2 Correct 66 ms 3528 KB Output is correct
3 Correct 59 ms 3456 KB Output is correct