Submission #4039771


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

vector<pair<int, int>> rle(string& s) {
    vector<pair<int, int>> work;
    char last = -1;
    int count = 0;
    for (char c : s) {
        if (c == last) {
            ++count;
        } else {
            if (count > 0) {
                work.push_back(make_pair(last, count));
            }
            last = c; count = 1;
        }
    }
    if (count > 0) {
        work.push_back(make_pair(last, count));
    }
    return work;
}

double f(int n){
    long double x = 0;
    rep(i,n) {
        x += (long double)1.0 / (2+i);
    }
    return (double)x;
}

double g(vii& p) {
    double x = 0;
    for (ii q: p) {
        if (q.first == '-') x += q.second;
        else x += f(q.second);
    }
    return x;
}

double solve(int N, string& s) {
    vii p = rle(s);
    int L = p.size();
    if (L == 1) {
        return (double)(s.size()-1) + 0.5;
    }
    double score = g(p);

    p.insert(p.begin(), ii('>', 0));
    p.insert(p.end(), ii('>', 0));
    L += 2;

    priority_queue<pair<double,int>> pq;

    for(int i=1; i<L-1; ++i) {
        if (p[i].first=='-'){
            double diff = 0;
            int a = p[i-1].second, b = p[i+1].second;
            if (p[i].second == 1) {
                diff = f(a+b+1) - f(a) - f(b) - 1;
                pq.emplace( -diff, i );
            } else {
                diff = 1.0/(2+b) - 1.0;
                pq.emplace( -diff, i );

                diff = 1.0/(2+a) - 1.0;
                pq.emplace( -diff, i );
            }
        }
    }

    score -= pq.top().first;
    return score;
}

int main() {
    int N; cin >> N;
    string s; cin >> s;
    printf("%.14f\n", solve(N,s) );
    return 0;
}

Submission Info

Submission Time
Task A - レース (Race)
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 3637 Byte
Status
Exec Time 6 ms
Memory 1340 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 300 / 300 in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
in01.txt 1 ms 256 KB
in02.txt 1 ms 256 KB
in03.txt 4 ms 512 KB
in04.txt 5 ms 512 KB
in05.txt 5 ms 512 KB
in06.txt 5 ms 512 KB
in07.txt 5 ms 512 KB
in08.txt 5 ms 512 KB
in09.txt 5 ms 512 KB
in10.txt 5 ms 512 KB
in11.txt 5 ms 640 KB
in12.txt 5 ms 896 KB
in13.txt 6 ms 1340 KB
in14.txt 6 ms 1340 KB
in15.txt 4 ms 512 KB
in16.txt 4 ms 512 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB