oj.uz

Submission #222159

# Submission time Handle Problem Language Result Execution time Memory
222159 2020-04-12T09:12:34 Z VEGAnn Akvizna (COCI19_akvizna) C++14
0 / 130
 1500 ms 262144 KB 
#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;

struct line{
    ld k, b;

    line(): k(0.0), b(0.0) {}
    line(ld _k, ld _b): k(_k), b(_b) {}
};

deque<line> hull;

ld get_cross_point(line fi, line se){
    return (fi.b - se.b) / (se.k - fi.k);
}

void insert(line nw){
    if (sz(hull) == 0){
        hull.PB(nw);
        return;
    }

    while (sz(hull) > 1){
        ld pt1 = get_cross_point(nw, hull[1]);
        ld pt2 = get_cross_point(hull.back(), hull[0]);

        if (pt2 > pt1) break;

        hull.pop_front();
    }

    hull.push_front(nw);
}

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 = 1; i <= k; i++) {

        hull.clear();

        if (f[i - 1][n] >= -E)
            insert({-1.0 / ld(n), f[i - 1][n] + 1.0});

        for (int j = n - 1; j >= 0; j--){

            // may be this should be after update f[i][j]
            if (f[i - 1][j] >= -E)
                insert({-1.0 / ld(j), f[i - 1][j] + 1.0});

            if (sz(hull)) {

                int l = 0, r = sz(hull) - 1;

                while (l < r) {
                    int md = (l + r + 1) >> 1;

                    assert(md > 0);

                    if (get_cross_point(hull[md], hull[md - 1]) + E <= j)
                        l = md;
                    else r = md - 1;
                }

                f[i][j] = hull[l].b + hull[l].k * ld(j);
            }
        }
    }

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

    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 6 ms 640 KB Expected double, but "-nan" found
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 322 ms 19712 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 450 ms 25984 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 364 ms 21192 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 27008 KB Output is correct
2 Correct 1077 ms 59768 KB Output is correct
3 Execution timed out 1606 ms 114296 KB Time limit exceeded

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 18176 KB Output is correct
2 Correct 1029 ms 58872 KB Output is correct
3 Execution timed out 1551 ms 97376 KB Time limit exceeded

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 294 ms 18048 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 293 ms 16640 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 277 ms 16896 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 423 ms 24192 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 791 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 792 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 779 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 798 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 805 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 858 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 821 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 792 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #22
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 841 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 827 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #24
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 835 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #25
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 839 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #26
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 848 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -