传送门
D
D
D看错题到比赛结束都没看出来。
A
传送门
思路:
考虑
r
e
v
e
r
s
e
reverse
reverse所有串然后低位贪心即可。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
#define gc getchar
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)>=mod?a-=mod:a;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,a=mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=2e6+5;
int n,m;
char s[N],t[N];
int a[N];
int main(){
for(ri tt=read();tt;--tt){
scanf("%s",s+1),n=strlen(s+1);
scanf("%s",t+1),m=strlen(t+1);
reverse(s+1,s+n+1),reverse(t+1,t+m+1);
int pos=0;
for(ri i=1;i<=m;++i)if(t[i]=='1'){pos=i;break;}
bool f=1;
if(!pos){cout<<"0\n";continue;}
for(ri i=pos;i<=n;++i){
if(s[i]=='1'){
cout<<i-pos<<'\n';
f=0;
break;
}
}
if(f)cout<<"0\n";
}
return 0;
}
B
传送门
O
(
1
0
4
)
d
p
O(10^4)dp
O(104)dp预处理一下就做完啦。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
#define gc getchar
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)>=mod?a-=mod:a;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,a=mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=2e6+5;
int n,m,trans[10][10][10][10];
char s[N];
int a[N];
int main(){
scanf("%s",s+1),n=strlen(s+1);
memset(trans,-1,sizeof(trans));
for(ri i=0;i<10;++i)for(ri j=0;j<10;++j)for(ri x=0;x<10;++x)for(ri y=0;y<10;++y)for(ri k=0;k<10;++k)for(ri l=0;l<10;++l){
if(k+l&&(i+x*k+y*l)%10==j)if(~trans[i][j][x][y])trans[i][j][x][y]=min(trans[i][j][x][y],k+l);else trans[i][j][x][y]=k+l;
}
for(ri x=0;x<10;++x,puts(""))for(ri y=0;y<10;++y){
bool f=1;
int ans=0;
for(ri i=2;i<=n;++i){
if(trans[s[i-1]-'0'][s[i]-'0'][x][y]==-1){
f=0;
break;
}
ans+=trans[s[i-1]-'0'][s[i]-'0'][x][y]-1;
}
cout<<(f?ans:-1)<<' ';
}
return 0;
}
C
传送门
维护
x
,
y
x,y
x,y后缀时间段的最值然后贪心判一判,感觉写起来头疼。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
#define gc getchar
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)>=mod?a-=mod:a;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,a=mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=2e6+5;
int n,c1,c2,c3,c4,m1,m2,m3,m4,x,y,t11,t22,t33,t44,suf1[N],suf2[N],suf3[N],suf4[N],X[N],Y[N];
vector<int>t1,t2,t3,t4;
char s[N];
ll ans=0;
inline ll calc(int a,int b,int c,int d){return (ll)(b-a+1)*(d-c+1);}
inline void update1(){
ans=min(ans,calc(min(min(m2,t11?X[t11-1]-1:0x3f3f3f3f),suf2[t11]-1),max(0,m1-1),m4,m3));
}
inline void update2(){
ans=min(ans,calc(min(m2+1,0),max(max(m1,t22?X[t22-1]+1:-0x3f3f3f3f),suf1[t22]+1),m4,m3));
}
inline void update3(){
ans=min(ans,calc(m2,m1,min(min(m4,t33?Y[t33-1]-1:0x3f3f3f3f),suf4[t33]-1),max(0,m3-1)));
}
inline void update4(){
ans=min(ans,calc(m2,m1,min(m4+1,0),max(max(m3,t44?Y[t44-1]+1:-0x3f3f3f3f),suf3[t44]+1)));
}
int main(){
for(ri tt=read();tt;--tt){
scanf("%s",s+1);
n=strlen(s+1);
m1=0,m2=0,m3=0,m4=0,x=0,y=0,c1=1,c2=1,c3=1,c4=1,t11=t22=t33=t44=0;
t1.clear(),t2.clear(),t3.clear(),t4.clear();
t1.push_back(0);
t2.push_back(0);
t3.push_back(0);
t4.push_back(0);
for(ri i=1;i<=n;++i){
if(s[i]=='W'){
++x;
if(m1==x)++c1,t1.push_back(i);
else if(m1<x)c1=1,m1=x,t1.clear(),t1.push_back(i),t11=i;
}
if(s[i]=='S'){
--x;
if(m2==x)++c2,t2.push_back(i);
else if(m2>x)c2=1,m2=x,t2.clear(),t2.push_back(i),t22=i;
}
if(s[i]=='D'){
++y;
if(m3==y)++c3,t3.push_back(i);
else if(m3<y)c3=1,m3=y,t3.clear(),t3.push_back(i),t33=i;
}
if(s[i]=='A'){
--y;
if(m4==y)++c2,t4.push_back(i);
else if(m4>y)c4=1,m4=y,t4.clear(),t4.push_back(i),t44=i;
}
X[i]=x,Y[i]=y;
}
suf1[n+1]=-1e9,suf2[n+1]=1e9,suf3[n+1]=-1e9,suf4[n+1]=1e9;
for(ri i=n;i;--i){
suf1[i]=max(suf1[i+1],X[i]);
suf2[i]=min(suf2[i+1],X[i]);
suf3[i]=max(suf3[i+1],Y[i]);
suf4[i]=min(suf4[i+1],Y[i]);
}
ans=calc(m2,m1,m4,m3);
update1();
update2();
update3();
update4();
cout<<ans<<'\n';
}
return 0;
}
D
传送门
看错题真六,这题貌似比
T
3
T3
T3简单233
考虑
i
i
i个
3
3
3的贡献是
i
∗
(
i
−
1
)
2
\frac{i*(i-1)}2
2i∗(i−1),然后递归找到所有的
i
i
i即可。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
static char buf[rlen],*ib,*ob;
(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
return ib==ob?-1:*ib++;
}
inline int read(){
int ans=0;
char ch=gc();
while(!isdigit(ch))ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return ans;
}
typedef long long ll;
typedef pair<int,int> pii;
vector<int>res;
inline void solve(int n){
if(!n)return;
int t;
for(ri i=sqrt(n*2)+1;i;--i){
if((ll)i*(i-1)/2<=n){
t=i;
break;
}
}
res.push_back(t);
solve(n-t*(t-1)/2);
}
int main(){
#ifdef ldxcaicai
freopen("lx.in","r",stdin);
#endif
for(ri tt=read();tt;--tt){
res.clear();
solve(read());
sort(res.begin(),res.end());
cout<<1;
for(ri i=0,pre=0,up=res.size();i<up;++i){
for(ri j=1;j<=res[i]-pre;++j)cout<<3;
cout<<7;
pre=res[i];
}
puts("");
}
return 0;
}
E
传送门
对对每个位置处理出有几个串在它那里结束/开始然后
f
o
r
for
for循环即可。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
static char buf[rlen],*ib,*ob;
(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
return ib==ob?-1:*ib++;
}
inline int read(){
#define gc getchar
int ans=0;
char ch=gc();
while(!isdigit(ch))ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return ans;
}
typedef long long ll;
const int N=2e5+5;
struct SAM{
int tim[N],add[N<<1],pos[N<<1],len[N<<1],lk[N<<1],son[N<<1][26],tot,last,cnt[N<<1],rk[N<<1];
SAM(){tot=last=1;}
inline void extend(int x,int id){
int np=++tot,p=last;
len[last=np]=len[p]+1,pos[np]=id;
while(p&&!son[p][x])son[p][x]=np,p=lk[p];
if(!p){lk[np]=1;return;}
int q=son[p][x],nq;
if(len[q]==len[p]+1){lk[np]=q;return;}
len[nq=++tot]=len[p]+1,memcpy(son[nq],son[q],sizeof(son[nq])),lk[nq]=lk[q],lk[q]=lk[np]=nq;
while(p&&son[p][x]==q)son[p][x]=nq,p=lk[p];
}
inline void build(char*s,int n){for(ri i=1;i<=n;++i)extend(s[i]-'a',i);}
inline void topsort(){
for(ri i=1;i<=tot;++i)++cnt[len[i]];
for(ri i=1;i<=tot;++i)cnt[i]+=cnt[i-1];
for(ri i=tot;i;--i)rk[cnt[len[i]]--]=i;
for(ri i=1;i<=tot;++i){
add[rk[i]]+=add[lk[rk[i]]];
tim[pos[rk[i]]]=add[rk[i]];
}
tim[0]=0;
}
inline void update(char*s,int n){
int p=1;
for(ri i=1;i<=n;++i){
p=son[p][s[i]-'a'];
if(!p)return;
}
++add[p];
}
}pre,suf;
int n,lim;
char s[N];
int main(){
#ifdef ldxcaicai
freopen("lx.in","r",stdin);
#endif
scanf("%s",s+1),lim=n=strlen(s+1);
pre.build(s,n);
reverse(s+1,s+n+1);
suf.build(s,n);
for(ri tt=read();tt;--tt){
scanf("%s",s+1),n=strlen(s+1);
pre.update(s,n);
reverse(s+1,s+n+1);
suf.update(s,n);
}
pre.topsort(),suf.topsort();
ll ans=0;
for(ri i=1;i<=lim;++i)ans+=(ll)pre.tim[i]*suf.tim[lim-i];
cout<<ans;
return 0;
}
F
传送门
考虑枚举循环节长度
p
p
p,可以得到关于段数的一些限制,复杂度
O
(
a
+
b
)
O(a+b)
O(a+b),发现段数
t
=
⌊
a
+
b
p
⌋
t=\lfloor\frac{a+b}p\rfloor
t=⌊pa+b⌋于是可以整除分块枚举
t
t
t求
p
p
p的范围
代码:
#include<bits/stdc++.h>
#define ri register int
using namespace std;
int a,b,sum,ans=0;
int main(){
#ifdef ldxcaicai
freopen("lx.in","r",stdin);
#endif
cin>>a>>b;
sum=a+b;
for(ri f=1,t,mnp,mxp,l=1,r;l<=sum;l=r+1,f=1){
t=sum/l,r=sum/t;
if((a+t)/(t+1)>a/t||(b+t)/(t+1)>b/t)continue;
mnp=(a+t)/(t+1)+(b+t)/(t+1),mxp=a/t+b/t;
mnp=max(mnp,l),mxp=min(mxp,r);
ans+=mxp-mnp+1;
}
cout<<ans;
return 0;
}