oj.uz

답안 #950245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950245 2024-03-20T07:15:58 Z GrindMachine Vim (BOI13_vim) C++17
16.6667 / 100
 489 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];

    vector<ll> pos;
    pos.pb(0);
    rep1(i,n){
        if(s[i] == 'e'){
            pos.pb(i);
        }
    }

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

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

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

                ll first_new = pos[j+1];
                ll cnt = 0;
                if(first_new <= k){
                    cnt = p[k]-p[first_new-1];
                }

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

                bool dbg = false;
                if(i == 4 and j == 2 and ch == 5){
                    // dbg = true;
                }

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

                    if(dbg){
                        debug(one_cnt);
                        debug(two_cnt);
                    }

                    // if(x == 10 and p[k] == 3){
                    //     if(dp[i][j]+2+2*two_cnt+one_cnt == 12){
                    //         debug(i);
                    //         debug(j);
                    //         debug(ch);
                    //         debug(dp[i][j]);
                    //     }
                    // }
                }
            }
        }
    }

    // debug(dp[10][3]);

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

    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Compilation message

vim.cpp: In function 'void solve(int)':
vim.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
vim.cpp:125:25: note: in expansion of macro 'debug'
  125 |                         debug(one_cnt);
      |                         ^~~~~
vim.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
vim.cpp:126:25: note: in expansion of macro 'debug'
  126 |                         debug(two_cnt);
      |                         ^~~~~

Subtask #1
16.6666666667 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1372 KB Output is correct
2 Incorrect 3 ms 1108 KB Output isn't correct
3 Incorrect 2 ms 1012 KB Output isn't correct
4 Incorrect 2 ms 860 KB Output isn't correct
5 Correct 2 ms 860 KB Output is correct
6 Incorrect 3 ms 1372 KB Output isn't correct
7 Incorrect 2 ms 1116 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 1368 KB Output is correct
14 Incorrect 2 ms 860 KB Output isn't correct
15 Incorrect 2 ms 860 KB Output isn't correct
16 Incorrect 3 ms 860 KB Output isn't correct
17 Incorrect 2 ms 856 KB Output isn't correct
18 Incorrect 2 ms 860 KB Output isn't correct
19 Incorrect 2 ms 860 KB Output isn't correct
20 Correct 3 ms 860 KB Output is correct
21 Incorrect 3 ms 860 KB Output isn't correct
22 Correct 2 ms 860 KB Output is correct
23 Incorrect 1 ms 860 KB Output isn't correct
24 Incorrect 1 ms 860 KB Output isn't correct
25 Incorrect 1 ms 860 KB Output isn't correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Incorrect 3 ms 1372 KB Output isn't correct
29 Incorrect 2 ms 1116 KB Output isn't correct
30 Incorrect 2 ms 860 KB Output isn't correct
31 Incorrect 3 ms 860 KB Output isn't correct
32 Incorrect 1 ms 860 KB Output isn't correct
33 Incorrect 2 ms 860 KB Output isn't correct
34 Correct 2 ms 1116 KB Output is correct
35 Incorrect 2 ms 1112 KB Output isn't correct
36 Incorrect 2 ms 1340 KB Output isn't correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 489 ms 120412 KB Output isn't correct
2 Incorrect 350 ms 93096 KB Output isn't correct
3 Incorrect 146 ms 32932 KB Output isn't correct
4 Incorrect 482 ms 120404 KB Output isn't correct
5 Incorrect 340 ms 85388 KB Output isn't correct
6 Incorrect 193 ms 54524 KB Output isn't correct
7 Incorrect 461 ms 104056 KB Output isn't correct
8 Incorrect 413 ms 99404 KB Output isn't correct
9 Incorrect 318 ms 93280 KB Output isn't correct
10 Incorrect 292 ms 87376 KB Output isn't correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 314 ms 524288 KB Execution killed with signal 9
2 Runtime error 264 ms 524288 KB Execution killed with signal 9
3 Runtime error 261 ms 524288 KB Execution killed with signal 9
4 Runtime error 256 ms 524288 KB Execution killed with signal 9
5 Runtime error 260 ms 524288 KB Execution killed with signal 9
6 Runtime error 258 ms 524288 KB Execution killed with signal 9
7 Runtime error 259 ms 524288 KB Execution killed with signal 9
8 Runtime error 255 ms 524288 KB Execution killed with signal 9
9 Runtime error 252 ms 524288 KB Execution killed with signal 9
10 Runtime error 260 ms 524288 KB Execution killed with signal 9
11 Runtime error 261 ms 524288 KB Execution killed with signal 9
12 Runtime error 264 ms 524288 KB Execution killed with signal 9
13 Runtime error 257 ms 524288 KB Execution killed with signal 9
14 Runtime error 250 ms 524288 KB Execution killed with signal 9
15 Runtime error 255 ms 524288 KB Execution killed with signal 9
16 Runtime error 248 ms 524288 KB Execution killed with signal 9
17 Runtime error 261 ms 524288 KB Execution killed with signal 9
18 Runtime error 252 ms 524288 KB Execution killed with signal 9
19 Runtime error 272 ms 524288 KB Execution killed with signal 9
20 Runtime error 254 ms 524288 KB Execution killed with signal 9