QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #102207 | #6354. 4 | zhouhuanyi | WA | 7ms | 9768kb | C++11 | 1.2kb | 2023-05-02 16:01:32 | 2023-05-02 16:01:36 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<bitset>
#include<vector>
#define N 100000
#define M 400
using namespace std;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9') c=getchar();
while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
return sum;
}
int n,m,cnt,X[N+1],Y[N+1],num[N+1],deg[N+1];
long long ans;
vector<int>E[N+1];
vector<int>p[N+1];
bitset<M+1>B[N+1];
void add(int x,int y)
{
E[x].push_back(y);
return;
}
int main()
{
n=read(),m=read();
for (int i=1;i<=m;++i) X[i]=read(),Y[i]=read(),deg[X[i]]++,deg[Y[i]]++;
for (int i=1;i<=m;++i)
{
if (deg[X[i]]<deg[Y[i]]) add(X[i],Y[i]);
else add(Y[i],X[i]);
}
for (int i=1;i<=n;++i)
{
cnt=0;
for (int j=0;j<E[i].size();++j) num[E[i][j]]=++cnt;
for (int j=0;j<E[i].size();++j)
for (int k=0;k<E[E[i][j]].size();++k)
if (i!=E[E[i][j]][k]&&num[E[E[i][j]][k]])
B[E[i][j]][num[E[E[i][j]][k]]]=1;
for (int j=0;j<E[i].size();++j)
for (int k=0;k<E[E[i][j]].size();++k)
ans+=(B[E[i][j]]&B[E[E[i][j]][k]]).count();
for (int j=0;j<E[i].size();++j) num[E[i][j]]=0;
}
printf("%lld\n",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 9632kb
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: 1ms
memory: 9648kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 0ms
memory: 9728kb
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: 7ms
memory: 9768kb
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:
11986099
result:
wrong answer 1st numbers differ - expected: '3689634', found: '11986099'