QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #641312 | #905. 三元环枚举 | DengDuck | WA | 2ms | 13180kb | C++14 | 645b | 2024-10-14 19:49:06 | 2024-10-14 19:49:07 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
#define LF long double
#define pLL pair<LL,LL>
#define pb push_back
using namespace std;
const LL N=2e5+5;
LL n,m,Ans,D[N],A[N],B[N];
vector<LL>G[N];
int main()
{
scanf("%lld%lld",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%lld%lld",&A[i],&B[i]);
D[A[i]]++,D[B[i]]++;
}
for(int i=1;i<=m;i++)
{
LL u=A[i],v=B[i];
if(D[u]>D[v])swap(u,v);
if(D[u]==D[v]&&u>v)swap(u,v);
G[u].pb(v);
}
for(int i=1;i<=n;i++)
{
unordered_map<LL,LL>Ma;
for(LL j:G[i])Ma[j]=1;
for(LL j:G[i])
for(LL k:G[j])if(Ma[k])++Ans;
}
printf("%lld\n",Ans);
return 0;
}
//RP++
详细
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 13180kb
input:
4 5 1 2 3 4 0 3 2 0 2 1 2 3 1 3
output:
0
result:
wrong answer 1st words differ - expected: '36', found: '0'