2022牛客(10)题解

H Wheel of Fortune

题目链接:https://ac.nowcoder.com/acm/contest/33195/H

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int INF=0x3f3f3f3f;
const int mod=998244353;
const int N=1e7+10,M=1e6+5;
 
int n,m,k,p;
int fac[N],inv[N];
 
ll qsm(ll a,ll b) {
    ll ans=1;
    while(b) {
        if(b&1) ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}
 
void init(int n) {
    fac[0]=1;
    for(int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
    inv[n]=qsm(fac[n],mod-2);
    for(int i=n-1;i>=0;i--) inv[i]=1ll*(i+1)*inv[i+1]%mod;
}
 
int C(int a,int b) {
    return 1ll*fac[a]*inv[b]%mod*inv[a-b]%mod;
}
 
void solve() {
    int a,b,x;
    cin>>a;
    for(int i=2;i<=8;i++) cin>>x;
    cin>>b;
    for(int i=2;i<=8;i++) cin>>x;
    a=(a+10-1)/10; b=(b+10-1)/10;
    init(a+b);
    ll ans=0;
    for(int i=b;i<=b+a-1;i++) {
        ans=(ans+1ll*C(i-1,b-1)*qsm(qsm(2,i),mod-2)%mod)%mod;
    }
    cout<<ans<<endl;
}
 
int main(){
    //freopen("data.in","r",stdin);
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1; //cin>>T;
    while(T--) {
        //cout<<"Case#"<<T<<":\n";
        solve();
    }
    return 0;
}

I Yet Another FFT Problem?

题目大意:给定两个长度为n和m的数组a和b，请找出一组解使得a[l1] - a[r1] = b[l2] - b[r2]。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int INF=0x3f3f3f3f;
const int mod=998244353;
const int N=1e6+10,M=1e7+5;
 
int n,m,k,p;
int a[N],b[N];
int fa[M],fb[M];
 
void solve() {
    cin>>n>>m;
    vector<int> pa,pb;
    int ans[2][2]={{0,0},{0,0}};
    for(int i=1;i<=n;i++) {
        cin>>a[i];
        if(fa[a[i]]==0) {
            pa.push_back(i); fa[a[i]]=i;
        } else {
            ans[0][0]=fa[a[i]]; ans[0][1]=i;
        }
    }
    for(int i=1;i<=m;i++) {
        cin>>b[i];
        if(fb[b[i]]==0) {
            pb.push_back(i); fb[b[i]]=i;
        } else {
            ans[1][0]=fb[b[i]]; ans[1][1]=i;
        }
    }
    if(ans[0][0]&&ans[1][0]) {
        printf("%d %d %d %d\n",ans[0][0],ans[0][1],ans[1][0],ans[1][1]);
        return;
    }
    vector<array<int, 2>> f(2 * M, {0,0});
    for(int i:pa) {
        for(int j:pb) {
            int t=a[i]+b[j];
            if(f[t][0]==0) {
                f[t]={i,j};
            } else {
                printf("%d %d %d %d\n",f[t][0],i,j,f[t][1]);
                return;
            }
        }
    }
    printf("-1\n");
}
 
int main(){
    //freopen("data.in","r",stdin);
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1; //cin>>T;
    while(T--) {
        //cout<<"Case#"<<T<<":\n";
        solve();
    }
    return 0;
}