QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #425079 | #6354. 4 | 321625 | WA | 3ms | 9280kb | C++14 | 1.0kb | 2024-05-29 21:56:21 | 2024-05-29 21:56:22 |
Judging History
answer
#include<cstdio>
#include<vector>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
const int N=1e5+7,M=2e5+7;
int id[N],U[M],V[M],dg[N],UU[M],VV[M],tem[507][7],ec,vc;
std::vector<int> dirg[N];int vis[N];ull msk[64];
inline bool nis(int x,int y){return dg[x]==dg[y]?x<y:dg[x]>dg[y];}
int main()
{
for(int k=0;k<64;++k)msk[k]=1ULL<<k;
int n,m;scanf("%d%d",&n,&m);
for(int i=1;i<=m;++i)scanf("%d%d",U+i,V+i),++dg[U[i]],++dg[V[i]];
for(int i=1;i<=m;++i)
{
if(!nis(U[i],V[i]))std::swap(U[i],V[i]);
dirg[U[i]].push_back(V[i]);
}
ll ans=0;
for(int uf=1;uf<=n;++uf)if(!dirg[uf].empty())
{
ec=vc=0;for(int v:dirg[uf])id[v]=++vc;
const int vn=(vc>>6);memset(tem+1,0,vc*sizeof*tem);
for(int v:dirg[uf])for(int w:dirg[v])if(id[v])UU[++ec]=id[v],VV[ec]=id[w];
for(int i=1;i<=ec;++i)
{
const int u=UU[i],v=VV[i];tem[u][v>>6]|=msk[v&63];tem[v][u>>6]|=msk[u&63];
for(int j=0;j<=vn;++j)ans+=__builtin_popcountll(tem[u][j]&tem[v][j]);
}
for(int v:dirg[uf])id[v]=0;
}
printf("%lld",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 8552kb
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: 8068kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 1ms
memory: 9280kb
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: 3ms
memory: 8592kb
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:
4450630
result:
wrong answer 1st numbers differ - expected: '3689634', found: '4450630'