0pts 全部WA求调,样例全过,玄关
查看原帖
0pts 全部WA求调,样例全过,玄关
1690315
DPOI楼主2025/6/22 10:55

rt。

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[100005],b[100005],cnt[100005][2],cnt2[1000005][2];
const int mod=10007;
signed main(){
    int n,m;cin>>n>>m;
    for (int i=1;i<=n;++i){
        cin>>a[i];
    }
    for (int i=1;i<=n;++i){
        cin>>b[i];
        cnt[b[i]][i%2]++;
        cnt2[b[i]][i%2]=(a[i]+cnt2[b[i]][i%2])%mod;
    }
    int ans=0;
    for (int i=1;i<=n;++i){
        ans+=i*(cnt2[b[i]][i%2]+a[i]*(cnt[b[i]][i%2]-2))%mod;
    }
    cout<<ans;
}
2025/6/22 10:55
加载中...