답안 #222217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222217	2020-04-12T11:28:44 Z	VEGAnn	Akvizna (COCI19_akvizna)	C++14	65 / 130	1500 ms	9956 KB

akvizna

#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 = 100100;
const ll OO = 1e18;
const ld E = 1e-9;
const ld CNST = 1;
vector<int> vc;
pair<ld, int> f[N];
int n, k;

struct line{
    ld k, b;
    int bl;

    line(): k(0.0), b(0.0), bl(0) {}
    line(ld _k, ld _b, int i): k(_k), b(_b), bl(i) {}
};

vector<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[sz(hull) - 2]);
        ld pt2 = get_cross_point(hull[sz(hull) - 2], hull.back());

        if (pt2 > pt1) break;

        hull.pop_back();
    }

    hull.PB(nw);
}

bool check(ld extra){
  	hull.clear();

    f[n] = MP(0.0, 0);

    insert({-1.0 / ld(n), f[n].ft, 0});

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

        if (sz(hull)) {

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

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

//                assert(md > 0);

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

            f[j] = MP(hull[l].b + 1.0 + hull[l].k * ld(j) + extra, hull[l].bl + 1);
        }

        insert({-1.0 / ld(j), f[j].ft, f[j].sd});
    }

    return (f[0].sd <= k);
}

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

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

    cin >> n >> k;

    ld l = 0, r = ld(1e9);

    for (int it = 0; it < 100; it++){
        ld md = (l + r) / 2.0;

        if (check(-md))
            r = md;
        else l = md;

        if (f[0].sd == k){
            l = md;
            break;
        }
    }

    check(-l);

    assert(f[0].sd == k);

    cout << fixed << setprecision(10) << (f[0].ft + l * ld(k) * CNST) / CNST;

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	768 KB	Output is correct
2	Correct	26 ms	752 KB	Output is correct
3	Correct	27 ms	768 KB	Output is correct

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1329 ms	9696 KB	Output is correct
2	Execution timed out	1596 ms	9700 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #15
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1436 ms	9572 KB	Output is correct
2	Execution timed out	1590 ms	9696 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #16
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1321 ms	9572 KB	Output is correct
2	Execution timed out	1589 ms	9700 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #17
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1564 ms	9568 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #18
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1361 ms	9700 KB	Output is correct
2	Execution timed out	1580 ms	9700 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #19
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1540 ms	9696 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #20
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1433 ms	9704 KB	Output is correct
2	Execution timed out	1595 ms	9444 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #21
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1435 ms	9572 KB	Output is correct
2	Execution timed out	1598 ms	9828 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #22
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1413 ms	9700 KB	Output is correct
2	Execution timed out	1592 ms	9700 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #23
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1372 ms	9952 KB	Output is correct
2	Execution timed out	1596 ms	9636 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #24
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1444 ms	9700 KB	Output is correct
2	Execution timed out	1596 ms	9828 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #25
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1493 ms	9696 KB	Output is correct
2	Execution timed out	1593 ms	9956 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #26
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1574 ms	9696 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

답안 #222217

Compilation message