# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
378393 |
2021-03-16T16:51:32 Z |
YJU |
Vim (BOI13_vim) |
C++14 |
|
418 ms |
398316 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N=5e3+5;
const ll INF=(1LL<<60);
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define lwb lower_bound
ll nxt[N][20],suffix_sum[N],dp[N][N];
string s;
vector<ll> loc;
ll n,m;
ll f(ll have,ll id){
if(have==m)return 0;
if(dp[have][id]!=-1)return dp[have][id];
//cout<<have<<" "<<id<<"\n";
dp[have][id]=INF;
REP(j,20){
if(j=='e'-'a'||nxt[id+1][j]==n)continue;
ll to=nxt[id+1][j];
if(to>loc[have]){
ll nhave=lwb(loc.begin(),loc.end(),to)-loc.begin();
dp[have][id]=min(dp[have][id],2+(to-loc[have])+f(nhave,loc[have]+1));
}else{
dp[have][id]=min(dp[have][id],f(have,to)+2);
}
}
return dp[have][id];
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
memset(dp,-1,sizeof(dp));
cin>>n>>s;
REP(j,10)nxt[n][j]=n;
for(int i=n-1;i>=0;i--){
REP(j,10)nxt[i][j]=nxt[i+1][j];
nxt[i][s[i]-'a']=i;
if(s[i]=='e')loc.pb(i);
}
sort(loc.begin(),loc.end());
m=loc.size();
cout<<f(0,0)+m<<"\n";
//REP(i,m)REP(j,n)cout<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
108 ms |
196460 KB |
Output is correct |
2 |
Incorrect |
108 ms |
196460 KB |
Output isn't correct |
3 |
Incorrect |
105 ms |
196460 KB |
Output isn't correct |
4 |
Correct |
108 ms |
196460 KB |
Output is correct |
5 |
Correct |
107 ms |
196460 KB |
Output is correct |
6 |
Correct |
109 ms |
196460 KB |
Output is correct |
7 |
Correct |
111 ms |
196460 KB |
Output is correct |
8 |
Correct |
109 ms |
196460 KB |
Output is correct |
9 |
Correct |
105 ms |
196460 KB |
Output is correct |
10 |
Correct |
104 ms |
196460 KB |
Output is correct |
11 |
Correct |
106 ms |
196460 KB |
Output is correct |
12 |
Correct |
106 ms |
196460 KB |
Output is correct |
13 |
Correct |
107 ms |
196480 KB |
Output is correct |
14 |
Incorrect |
106 ms |
196460 KB |
Output isn't correct |
15 |
Incorrect |
109 ms |
196460 KB |
Output isn't correct |
16 |
Incorrect |
107 ms |
196460 KB |
Output isn't correct |
17 |
Correct |
113 ms |
196588 KB |
Output is correct |
18 |
Correct |
108 ms |
196460 KB |
Output is correct |
19 |
Incorrect |
107 ms |
196460 KB |
Output isn't correct |
20 |
Correct |
106 ms |
196588 KB |
Output is correct |
21 |
Correct |
108 ms |
196460 KB |
Output is correct |
22 |
Correct |
108 ms |
196460 KB |
Output is correct |
23 |
Incorrect |
107 ms |
196588 KB |
Output isn't correct |
24 |
Correct |
108 ms |
196588 KB |
Output is correct |
25 |
Correct |
106 ms |
196460 KB |
Output is correct |
26 |
Correct |
106 ms |
196460 KB |
Output is correct |
27 |
Correct |
108 ms |
196460 KB |
Output is correct |
28 |
Correct |
110 ms |
196460 KB |
Output is correct |
29 |
Incorrect |
109 ms |
196460 KB |
Output isn't correct |
30 |
Incorrect |
107 ms |
196460 KB |
Output isn't correct |
31 |
Correct |
105 ms |
196460 KB |
Output is correct |
32 |
Incorrect |
107 ms |
196460 KB |
Output isn't correct |
33 |
Correct |
108 ms |
196588 KB |
Output is correct |
34 |
Correct |
126 ms |
196460 KB |
Output is correct |
35 |
Correct |
109 ms |
196588 KB |
Output is correct |
36 |
Correct |
107 ms |
196460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
239 ms |
197356 KB |
Output isn't correct |
2 |
Correct |
394 ms |
197400 KB |
Output is correct |
3 |
Incorrect |
165 ms |
196980 KB |
Output isn't correct |
4 |
Incorrect |
238 ms |
197612 KB |
Output isn't correct |
5 |
Incorrect |
395 ms |
197484 KB |
Output isn't correct |
6 |
Incorrect |
411 ms |
197484 KB |
Output isn't correct |
7 |
Incorrect |
284 ms |
197512 KB |
Output isn't correct |
8 |
Incorrect |
299 ms |
197228 KB |
Output isn't correct |
9 |
Correct |
397 ms |
197484 KB |
Output is correct |
10 |
Incorrect |
399 ms |
197484 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
377 ms |
398100 KB |
Execution killed with signal 11 |
2 |
Runtime error |
398 ms |
397932 KB |
Execution killed with signal 11 |
3 |
Runtime error |
398 ms |
398060 KB |
Execution killed with signal 11 |
4 |
Runtime error |
385 ms |
398060 KB |
Execution killed with signal 11 |
5 |
Runtime error |
381 ms |
398316 KB |
Execution killed with signal 11 |
6 |
Runtime error |
395 ms |
398044 KB |
Execution killed with signal 11 |
7 |
Runtime error |
365 ms |
397932 KB |
Execution killed with signal 11 |
8 |
Runtime error |
372 ms |
398060 KB |
Execution killed with signal 11 |
9 |
Runtime error |
369 ms |
397932 KB |
Execution killed with signal 11 |
10 |
Runtime error |
388 ms |
397932 KB |
Execution killed with signal 11 |
11 |
Runtime error |
378 ms |
398316 KB |
Execution killed with signal 11 |
12 |
Runtime error |
367 ms |
398260 KB |
Execution killed with signal 11 |
13 |
Runtime error |
369 ms |
398060 KB |
Execution killed with signal 11 |
14 |
Runtime error |
380 ms |
398188 KB |
Execution killed with signal 11 |
15 |
Runtime error |
381 ms |
398204 KB |
Execution killed with signal 11 |
16 |
Runtime error |
371 ms |
398060 KB |
Execution killed with signal 11 |
17 |
Runtime error |
379 ms |
397932 KB |
Execution killed with signal 11 |
18 |
Runtime error |
418 ms |
397932 KB |
Execution killed with signal 11 |
19 |
Runtime error |
372 ms |
398060 KB |
Execution killed with signal 11 |
20 |
Runtime error |
377 ms |
398028 KB |
Execution killed with signal 11 |