QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#668660#905. 三元环枚举include_c#WA 7ms11440kbC++14833b2024-10-23 15:24:092024-10-23 15:24:16

Judging History

你现在查看的是最新测评结果

  • [2024-10-23 15:24:16]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:11440kb
  • [2024-10-23 15:24:09]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=2e5+5,M=2e5+5,P=998244353;
int n,m;
int v[N];vector<int>e[N];
int x[N],y[N],deg[N];bool exi[N];
int main(){
    scanf("%d%d",&n,&m);
    rep(i,1,n)scanf("%d",&v[i]);
    rep(i,1,m){
        scanf("%d%d",&x[i],&y[i]);x[i]++;y[i]++;
        deg[x[i]]++;deg[y[i]]++;
    }
    rep(i,1,m){
        if(deg[x[i]]<deg[y[i]])e[x[i]].push_back(y[i]);
        else e[y[i]].push_back(x[i]);
    }
    ll ans=0;
    rep(i,1,n){
        for(int j:e[i])exi[j]=1;
        for(int j:e[i]){
            for(int k:e[j])if(exi[k])ans+=(ll)x[i]*x[j]%P*x[k]%P,ans%=P;
        }
        for(int j:e[i])exi[j]=0;
    }
    printf("%lld",ans);
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 10068kb

input:

4 5
1 2 3 4
0 3
2 0
2 1
2 3
1 3

output:

36

result:

ok "36"

Test #2:

score: -100
Wrong Answer
time: 7ms
memory: 11440kb

input:

17707 77101
528756313 434883274 318065816 264440383 659789617 608119380 648104885 725454492 696703871 543030428 663661240 890791532 108201616 428505484 322953840 119811886 691103780 306647414 549862302 176916719 909058872 455464665 307270851 584469329 722629343 875317523 629938577 244419357 78121457...

output:

316988393

result:

wrong answer 1st words differ - expected: '397965084', found: '316988393'