oj.uz

Submission #950174

# Submission time Handle Problem Language Result Execution time Memory
950174 2024-03-20T06:27:18 Z GrindMachine Vim (BOI13_vim) C++17
1.38889 / 100
 880 ms 524288 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    string s; cin >> s;
    s = "$" + s;

    ll nxt[n+5][10];
    memset(nxt,0x3f,sizeof nxt);
    array<ll,10> closest;
    closest.fill(inf2);

    rev(i,n,1){
        rep(j,10){
            nxt[i][j] = closest[j];
        }
        closest[s[i]-'a'] = i;
    }

    vector<ll> p(n+5);
    rep1(i,n) p[i] = p[i-1]+(s[i] == 'e');
    ll m = p[n];

    ll dp[n+5][m+5];
    memset(dp,0x3f,sizeof dp);
    dp[1][0] = 0;

    rep1(i,n){
        rep(j,m+1){
            rep(ch,10){
                if(ch == 4) conts;
                // if(dp[i][j]) conts;

                ll k = nxt[i][ch];
                if(k > n) conts;
                ll cnt = p[k]-p[i];

                for(int x = i; x <= min(nxt[i][4],k); ++x){
                    amin(dp[x][p[k]],dp[i][j]+1+cnt*2+k-x);
                }

                if(nxt[i][4]+1 <= k){
                    ll x = nxt[i][4]+1;
                    ll two_cnt = cnt-1;
                    ll one_cnt = k-(x-1)+1-two_cnt;
                    amin(dp[x][p[k]],dp[i][j]+1+cnt*two_cnt+one_cnt);
                }
            }
        }
    }

    ll ans = inf2;
    rep1(i,n){
        amin(ans,dp[i][m]);
    }

    ans += m-1;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
1.38888888889 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1372 KB Output isn't correct
2 Incorrect 3 ms 860 KB Output isn't correct
3 Incorrect 3 ms 860 KB Output isn't correct
4 Incorrect 4 ms 860 KB Output isn't correct
5 Incorrect 5 ms 860 KB Output isn't correct
6 Incorrect 8 ms 1372 KB Output isn't correct
7 Incorrect 6 ms 1116 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 8 ms 1372 KB Output isn't correct
14 Incorrect 3 ms 860 KB Output isn't correct
15 Incorrect 3 ms 860 KB Output isn't correct
16 Incorrect 3 ms 860 KB Output isn't correct
17 Incorrect 6 ms 860 KB Output isn't correct
18 Incorrect 4 ms 860 KB Output isn't correct
19 Incorrect 3 ms 856 KB Output isn't correct
20 Incorrect 4 ms 860 KB Output isn't correct
21 Incorrect 4 ms 1056 KB Output isn't correct
22 Incorrect 5 ms 860 KB Output isn't correct
23 Incorrect 3 ms 860 KB Output isn't correct
24 Incorrect 4 ms 856 KB Output isn't correct
25 Incorrect 5 ms 860 KB Output isn't correct
26 Incorrect 5 ms 1116 KB Output isn't correct
27 Incorrect 6 ms 1232 KB Output isn't correct
28 Incorrect 7 ms 1372 KB Output isn't correct
29 Incorrect 6 ms 1116 KB Output isn't correct
30 Incorrect 4 ms 860 KB Output isn't correct
31 Incorrect 4 ms 860 KB Output isn't correct
32 Incorrect 4 ms 980 KB Output isn't correct
33 Incorrect 4 ms 856 KB Output isn't correct
34 Incorrect 6 ms 1116 KB Output isn't correct
35 Incorrect 6 ms 1116 KB Output isn't correct
36 Incorrect 6 ms 1116 KB Output isn't correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 846 ms 120212 KB Output isn't correct
2 Incorrect 672 ms 93300 KB Output isn't correct
3 Incorrect 239 ms 32912 KB Output isn't correct
4 Incorrect 880 ms 120400 KB Output isn't correct
5 Incorrect 624 ms 85340 KB Output isn't correct
6 Incorrect 501 ms 54504 KB Output isn't correct
7 Incorrect 710 ms 104008 KB Output isn't correct
8 Incorrect 713 ms 99352 KB Output isn't correct
9 Incorrect 678 ms 93240 KB Output isn't correct
10 Incorrect 594 ms 87480 KB Output isn't correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 327 ms 524288 KB Execution killed with signal 9
2 Runtime error 263 ms 524288 KB Execution killed with signal 9
3 Runtime error 244 ms 524288 KB Execution killed with signal 9
4 Runtime error 240 ms 524288 KB Execution killed with signal 9
5 Runtime error 245 ms 524288 KB Execution killed with signal 9
6 Runtime error 250 ms 524288 KB Execution killed with signal 9
7 Runtime error 248 ms 524288 KB Execution killed with signal 9
8 Runtime error 270 ms 524288 KB Execution killed with signal 9
9 Runtime error 253 ms 524288 KB Execution killed with signal 9
10 Runtime error 247 ms 524288 KB Execution killed with signal 9
11 Runtime error 248 ms 524288 KB Execution killed with signal 9
12 Runtime error 244 ms 524288 KB Execution killed with signal 9
13 Runtime error 243 ms 524288 KB Execution killed with signal 9
14 Runtime error 251 ms 524288 KB Execution killed with signal 9
15 Runtime error 243 ms 524288 KB Execution killed with signal 9
16 Runtime error 250 ms 524288 KB Execution killed with signal 9
17 Runtime error 240 ms 524288 KB Execution killed with signal 9
18 Runtime error 247 ms 524288 KB Execution killed with signal 9
19 Runtime error 277 ms 524288 KB Execution killed with signal 9
20 Runtime error 245 ms 524288 KB Execution killed with signal 9