QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #782889 | #6354. 4 | yzy4090 | WA | 6ms | 7824kb | C++14 | 746b | 2024-11-25 22:01:33 | 2024-11-25 22:01:34 |
Judging History
answer
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,m,u[N],v[N],deg[N];
vector<int>e[N];
int idd,id[N];
bitset<400>b[N];
ll ans=0;
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>u[i]>>v[i];
deg[u[i]]++,deg[v[i]]++;
}
for(int i=1;i<=m;i++){
if(deg[u[i]]>deg[v[i]]||(deg[u[i]]==deg[v[i]]&&u[i]>v[i]))
swap(u[i],v[i]);
e[u[i]].push_back(v[i]);
}
for(int u=1;u<=n;u++){
idd=0;
for(int v:e[u])id[v]=++idd,b[v].reset();
for(int v:e[u])for(int w:e[v])if(id[w])b[id[v]][id[w]]=true;
for(int v:e[u])for(int w:e[v])if(id[w])ans+=(b[id[v]]&b[id[w]]).count();
for(int v:e[u])id[v]=0;
}
cout<<ans<<"\n";
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7656kb
input:
5 9 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 6264kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 1ms
memory: 7824kb
input:
50 50 28 35 12 24 31 50 10 24 21 44 5 31 23 36 31 45 6 39 4 8 13 37 42 48 17 45 19 33 12 21 19 32 16 43 12 47 25 31 40 48 8 49 43 48 6 42 27 34 13 39 17 40 13 35 3 49 20 24 5 12 43 44 15 37 24 27 8 43 4 22 17 38 28 47 29 46 3 15 9 49 1 41 43 45 3 6 37 48 13 30 11 43 8 25 33 38 16 32 32 41
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: -100
Wrong Answer
time: 6ms
memory: 7752kb
input:
100 4900 64 78 3 13 93 96 48 64 34 64 5 76 66 74 44 78 17 20 30 73 5 34 24 100 23 65 4 70 22 95 47 70 6 89 15 70 70 82 88 90 29 80 27 64 16 59 28 99 67 68 85 99 37 85 8 46 71 78 40 95 6 21 27 66 16 89 11 83 17 57 19 36 21 70 27 86 27 45 5 56 10 64 23 33 87 91 37 40 21 55 75 79 54 96 3 77 70 78 36 93...
output:
5134508
result:
wrong answer 1st numbers differ - expected: '3689634', found: '5134508'