【Codeforces 568 C】New Language（2-sat / 贪心）

传送门

显然建出$2-sat$模型后
贪心枚举哪一位比$s$大，后面的可以随便选

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline ll readll(){
    char ch=gc();
    ll res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int N=406,M=30;
vector<int> e[N];
int n,m,l,mn[M][2],vis[N],bel[N],pre[2];
char s[N];
bool dfs(int u){
	if(vis[u>n?u-n:u+n])return false;
	vis[u]=1;
	for(int &v:e[u])if(!vis[v]){
		if(!dfs(v))return false;
	}return true;
}
inline bool check(int ps){
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=ps;i++)
	if(!dfs(i+bel[s[i]-'a'+1]*n))return false;
	for(int i=ps+1;i<=n;i++){
		if(vis[i])s[i]=pre[0]+'a'-1;
		else if(vis[i+n])s[i]=pre[1]+'a'-1;
		else{
			int v=min(pre[0],pre[1]);
			if(dfs(i+bel[v]*n))s[i]=v+'a'-1;
			else return false;
		}
	}return true;
}
int main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	l=readstring(s);
	mn[l+1][0]=mn[l+1][1]=pre[0]=pre[1]=l+1;
	for(int i=l;i;i--){
		bel[i]=(s[i]=='V'?0:1);
		pre[bel[i]]=i;
		mn[i][0]=pre[0],mn[i][1]=pre[1];
	}
	n=read(),m=read();
	for(int i=1;i<=m;i++){
		int x=read(),u1,u2,v1,v2;readstring(s);
		u1=x+(s[1]=='V'?0:n),u2=u1>n?u1-n:u1+n;
		x=read();readstring(s);
		v1=x+(s[1]=='V'?0:n),v2=v1>n?v1-n:v1+n;
		e[u1].pb(v1),e[v2].pb(u2);
	}
	memset(s,0,sizeof(s));
	readstring(s);
	if(check(n)){
		cout<<s+1<<'\n';return 0;
	}
	else if(pre[0]==l+1||pre[1]==l+1)return cout<<-1,0;
	for(int i=n;i;i--){
		int v=s[i]-'a'+2,v1=min(mn[v][0],mn[v][1]),v2=max(mn[v][0],mn[v][1]);
		if(v1!=l+1){
			s[i]=v1+'a'-1;
			if(check(i)){
				cout<<s+1<<'\n';return 0;
			}
		}
		if(v2!=l+1){
			s[i]=v2+'a'-1;
			if(check(i)){
				cout<<s+1<<'\n';return 0;
			}
		}
	}
	return cout<<-1,0;
}