結果

問題 No.1478 Simple Sugoroku
ユーザー hirono999hirono999
提出日時 2021-04-17 22:27:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,635 bytes
コンパイル時間 3,253 ms
コンパイル使用メモリ 219,780 KB
実行使用メモリ 5,544 KB
最終ジャッジ日時 2023-09-17 07:17:43
合計ジャッジ時間 6,565 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 52 ms
5,424 KB
testcase_14 AC 52 ms
5,364 KB
testcase_15 AC 52 ms
5,364 KB
testcase_16 AC 53 ms
5,476 KB
testcase_17 AC 53 ms
5,464 KB
testcase_18 AC 52 ms
5,364 KB
testcase_19 AC 52 ms
5,544 KB
testcase_20 AC 52 ms
5,464 KB
testcase_21 AC 53 ms
5,364 KB
testcase_22 AC 52 ms
5,360 KB
testcase_23 AC 52 ms
5,424 KB
testcase_24 AC 53 ms
5,356 KB
testcase_25 AC 53 ms
5,488 KB
testcase_26 AC 53 ms
5,464 KB
testcase_27 AC 53 ms
5,464 KB
testcase_28 AC 49 ms
5,484 KB
testcase_29 AC 50 ms
5,408 KB
testcase_30 AC 51 ms
5,484 KB
testcase_31 AC 51 ms
5,464 KB
testcase_32 AC 51 ms
5,356 KB
testcase_33 AC 51 ms
5,464 KB
testcase_34 AC 51 ms
5,364 KB
testcase_35 AC 50 ms
5,420 KB
testcase_36 AC 51 ms
5,484 KB
testcase_37 AC 51 ms
5,484 KB
testcase_38 AC 52 ms
5,352 KB
testcase_39 AC 51 ms
5,360 KB
testcase_40 AC 51 ms
5,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/template.hpp"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

constexpr long long INF = 1LL << 60;
constexpr long double PI = 3.141592653589;

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define debug(x) cout << #x << ": " << (x) << '\n'

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;

template <typename T = ll>
using vec = vector<T>;

template <typename T = ll>
using vec2 = vector<vector<T>>;

template <typename T = ll>
using vec3 = vector<vector<vector<T>>>;

template < typename T >
inline bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

template < typename T >
inline bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
#line 4 "/home/snow/competitive-programming/competitive-programming-library/snow/io/setup.hpp"

namespace snow{

struct IoSetup {
    IoSetup() {
        std::cin.tie(nullptr);
        std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(10);
    }
} iosetup;

}
#line 5 "/home/snow/competitive-programming/competitive-programming-library/snow/io/helper.hpp"

template< typename T1, typename T2 >
std::ostream &operator << (std::ostream &os, const std::pair< T1, T2 > &p) {
    os << p.first << " " << p.second;
    return os;
}

template< typename T1, typename T2 >
std::istream &operator >> (std::istream &is, std::pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}

template< typename T1, typename T2, typename T3 >
std::ostream &operator << (std::ostream &os, const std::tuple< T1, T2, T3 > &t) {
    auto &[a, b, c] = t;
    os << a << " " << b << " " << c;
    return os;
}

template< typename T1, typename T2, typename T3 >
std::istream &operator >> (std::istream &is, std::tuple< T1, T2, T3 > &t) {
    auto &[a, b, c] = t;
    is >> a >> b >> c;
    return is;
}

template< typename T >
std::ostream &operator << (std::ostream &os, const std::vector< T > &v){
    for (int i = 0; i < (int)v.size(); ++i) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}

template< typename T >
std::istream &operator >>  (std::istream &is, std::vector< T > &v){
    for(T &in : v) is >> in;
    return is;
}

template< typename T >
std::ostream &operator << (std::ostream &os, const std::set< T > &st){
    int ct = 0;
    for(auto& s : st) os << s << (++ct != st.size() ? " " : "");
    return os;
}

template<class... T>
void input(T&... a){
    (std::cin >> ... >> a);
}

void print() {
    std::cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    std::cout << a;
    (std::cout << ... << (std::cout << ' ', b));
    std::cout << '\n';
}

int drop() {
    std::cout << '\n';
    exit(0);
}
template<class T, class... Ts>
int drop(const T& a, const Ts&... b){
    std::cout << a;
    (std::cout << ... << (std::cout << ' ', b));
    std::cout << '\n';
    exit(0);
}
#line 4 "main.cpp"
using namespace snow;

#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/algorithm/binary-search.hpp"

namespace snow {

/**
 * @brief Binary Search
 * @param EPS Sepcify if using decimal floating point
 * @return right
 */
template< typename T, typename F >
T binary_search(T left, T right, F f, T EPS = 1) {
    while(abs(right - left) > EPS){
        T mid = (right + left) / 2;
        if(f(mid)) right = mid;
        else left = mid;
    }
    return right;
}

} // namespace snow
#line 7 "main.cpp"

// #include "atcoder/modint"
// using namespace atcoder;
// using mint = modint1000000007;



int main() {
    ll N, M;
    cin >> N >> M;
    vec<> B(M);
    cin >> B;

    ld rem = B[0] - 1 + N - B.back();


    auto calc = [&](ld X) -> bool {
        vec<ld> f(M);
        rrep(i, M) if(i < M - 1) f[i] = min(f[i + 1] + B[i + 1] - B[i], X + 1);
        ld e = 0;
        rep(i, M) e += f[i];
        e /= M;
        return e < X;
    };

    auto X = snow::binary_search<ld>(0, 1e8, calc, 1e-8);

    vec<ld> f(M);
    rrep(i, M) if(i < M - 1) f[i] = min(f[i + 1] + B[i + 1] - B[i], X + 1);

    print(f[0] + rem);

    return 0;
}
0