#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-1,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);
| ^~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
43 ms |
1372 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
860 KB |
Output isn't correct |
| 3 |
Incorrect |
9 ms |
860 KB |
Output isn't correct |
| 4 |
Correct |
12 ms |
1052 KB |
Output is correct |
| 5 |
Correct |
17 ms |
860 KB |
Output is correct |
| 6 |
Correct |
19 ms |
1436 KB |
Output is correct |
| 7 |
Correct |
15 ms |
1368 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
600 KB |
Output is correct |
| 10 |
Correct |
0 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 |
42 ms |
1372 KB |
Output is correct |
| 14 |
Incorrect |
11 ms |
856 KB |
Output isn't correct |
| 15 |
Incorrect |
9 ms |
1112 KB |
Output isn't correct |
| 16 |
Incorrect |
10 ms |
860 KB |
Output isn't correct |
| 17 |
Correct |
14 ms |
860 KB |
Output is correct |
| 18 |
Correct |
10 ms |
860 KB |
Output is correct |
| 19 |
Incorrect |
10 ms |
860 KB |
Output isn't correct |
| 20 |
Correct |
11 ms |
856 KB |
Output is correct |
| 21 |
Correct |
13 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
16 ms |
860 KB |
Output is correct |
| 23 |
Correct |
13 ms |
856 KB |
Output is correct |
| 24 |
Correct |
11 ms |
864 KB |
Output is correct |
| 25 |
Correct |
6 ms |
896 KB |
Output is correct |
| 26 |
Correct |
6 ms |
984 KB |
Output is correct |
| 27 |
Correct |
11 ms |
1236 KB |
Output is correct |
| 28 |
Correct |
16 ms |
1372 KB |
Output is correct |
| 29 |
Incorrect |
16 ms |
1112 KB |
Output isn't correct |
| 30 |
Incorrect |
16 ms |
860 KB |
Output isn't correct |
| 31 |
Correct |
10 ms |
860 KB |
Output is correct |
| 32 |
Incorrect |
7 ms |
860 KB |
Output isn't correct |
| 33 |
Correct |
7 ms |
1028 KB |
Output is correct |
| 34 |
Correct |
10 ms |
1144 KB |
Output is correct |
| 35 |
Correct |
13 ms |
1112 KB |
Output is correct |
| 36 |
Correct |
15 ms |
1116 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
2027 ms |
120144 KB |
Time limit exceeded |
| 2 |
Correct |
1594 ms |
93284 KB |
Output is correct |
| 3 |
Incorrect |
930 ms |
32936 KB |
Output isn't correct |
| 4 |
Execution timed out |
2028 ms |
120400 KB |
Time limit exceeded |
| 5 |
Execution timed out |
2021 ms |
85332 KB |
Time limit exceeded |
| 6 |
Execution timed out |
2061 ms |
54364 KB |
Time limit exceeded |
| 7 |
Execution timed out |
2064 ms |
103944 KB |
Time limit exceeded |
| 8 |
Execution timed out |
2037 ms |
99152 KB |
Time limit exceeded |
| 9 |
Correct |
1654 ms |
93268 KB |
Output is correct |
| 10 |
Incorrect |
1815 ms |
87528 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
278 ms |
524288 KB |
Execution killed with signal 9 |
| 2 |
Runtime error |
243 ms |
524288 KB |
Execution killed with signal 9 |
| 3 |
Runtime error |
247 ms |
524288 KB |
Execution killed with signal 9 |
| 4 |
Runtime error |
252 ms |
524288 KB |
Execution killed with signal 9 |
| 5 |
Runtime error |
283 ms |
524288 KB |
Execution killed with signal 9 |
| 6 |
Runtime error |
270 ms |
524288 KB |
Execution killed with signal 9 |
| 7 |
Runtime error |
240 ms |
524288 KB |
Execution killed with signal 9 |
| 8 |
Runtime error |
276 ms |
524288 KB |
Execution killed with signal 9 |
| 9 |
Runtime error |
241 ms |
524288 KB |
Execution killed with signal 9 |
| 10 |
Runtime error |
249 ms |
524288 KB |
Execution killed with signal 9 |
| 11 |
Runtime error |
258 ms |
524288 KB |
Execution killed with signal 9 |
| 12 |
Runtime error |
281 ms |
524288 KB |
Execution killed with signal 9 |
| 13 |
Runtime error |
254 ms |
524288 KB |
Execution killed with signal 9 |
| 14 |
Runtime error |
245 ms |
524288 KB |
Execution killed with signal 9 |
| 15 |
Runtime error |
248 ms |
524288 KB |
Execution killed with signal 9 |
| 16 |
Runtime error |
243 ms |
524288 KB |
Execution killed with signal 9 |
| 17 |
Runtime error |
251 ms |
524288 KB |
Execution killed with signal 9 |
| 18 |
Runtime error |
259 ms |
524288 KB |
Execution killed with signal 9 |
| 19 |
Runtime error |
243 ms |
524288 KB |
Execution killed with signal 9 |
| 20 |
Runtime error |
246 ms |
524288 KB |
Execution killed with signal 9 |
