답안 #378421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378421	2021-03-16T18:01:01 Z	YJU	Vim (BOI13_vim)	C++14	컴파일 오류	0 ms	0 KB

vim

#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=7e4+5;
const ll SN=N/10+4;
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][11],dp[SN][N],e[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];
    dp[have][id]=INF;
	if(id>loc[have]){
		ll nhave=lwb(loc.begin(),loc.end(),id)-loc.begin();
		dp[have][id]=min(dp[have][id],f(nhave,e[loc[have]])+(id-loc[have]));
	}
	REP(j,10){
		if(j=='e'-'a'||nxt[id+1][j]==n)continue;
		dp[have][id]=min(dp[have][id],f(have,nxt[id+1][j])+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;
        e[i]=(s[i+1]=='e'?e[i+1]:i+1);
        if(s[i]=='e')loc.pb(i);
	}
	sort(loc.begin(),loc.end());
	m=loc.size();
	assert(m<SN);
	cout<<f(0,0)+m<<"\n";
	//REP(i,m)REP(j,n)cout<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
	return 0;
}

Compilation message

/usr/bin/ld: failed to convert GOTPCREL relocation; relink with --no-relax
collect2: error: ld returned 1 exit status