QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #102180 | #6354. 4 | zhouhuanyi | TL | 9ms | 12848kb | C++11 | 1.5kb | 2023-05-02 15:12:53 | 2023-05-02 15:12:57 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<bitset>
#include<vector>
#define N 100000
#define M 8192
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;
}
struct reads
{
int num,data;
};
int n,m,X[N+1],Y[N+1],num[N+1],deg[N+1];
long long ans;
vector<reads>E[N+1];
vector<int>p[N+1];
bitset<M+1>B[N+1];
void add(int x,int y,int z)
{
E[x].push_back((reads){y,z});
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],i);
else add(Y[i],X[i],i);
}
for (int i=1;i<=n;++i)
{
for (int j=0;j<E[i].size();++j) num[E[i][j].num]=E[i][j].data;
for (int j=0;j<E[i].size();++j)
for (int k=0;k<E[E[i][j].num].size();++k)
if (i!=E[E[i][j].num][k].num&&num[E[E[i][j].num][k].num])
{
p[E[i][j].data].push_back(E[E[i][j].num][k].num);
p[E[E[i][j].num][k].data].push_back(i);
p[num[E[E[i][j].num][k].num]].push_back(E[i][j].num);
}
for (int j=0;j<E[i].size();++j) num[E[i][j].num]=0;
}
for (int i=1;i<=m;i+=M)
{
for (int j=1;j<=n;++j) B[j].reset();
for (int j=i;j<=min(i+M-1,m);++j)
for (int k=0;k<p[j].size();++k)
B[p[j][k]][j-i]=1;
for (int j=1;j<=m;++j) ans+=(B[X[j]]&B[Y[j]]).count();
}
printf("%lld\n",ans/6);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 9684kb
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: 4ms
memory: 9700kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 3ms
memory: 9660kb
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: 0
Accepted
time: 9ms
memory: 12848kb
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:
3689634
result:
ok 1 number(s): "3689634"
Test #5:
score: 0
Accepted
time: 5ms
memory: 11440kb
input:
100 4000 73 78 38 98 9 65 43 72 20 47 6 37 49 60 48 87 48 77 23 100 57 59 42 99 40 88 20 96 19 44 35 80 12 93 34 44 63 75 3 49 32 99 47 61 3 13 54 81 55 96 16 74 28 77 43 45 25 92 5 82 3 83 9 55 64 78 39 89 19 64 58 75 1 18 22 76 16 55 18 60 14 55 29 96 37 97 26 97 11 53 24 79 7 35 53 54 31 74 31 32...
output:
1094294
result:
ok 1 number(s): "1094294"
Test #6:
score: -100
Time Limit Exceeded
input:
447 99681 346 391 18 307 271 438 50 436 84 215 64 104 291 325 278 355 152 228 7 117 174 410 61 386 7 204 264 327 366 409 291 405 42 131 89 203 1 175 229 292 225 320 1 310 89 185 161 340 401 406 265 377 119 313 253 403 190 383 305 367 334 424 88 327 77 357 25 334 56 62 68 245 1 13 290 336 94 354 10 3...