QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #360128 | #6354. 4 | Glacia | WA | 3ms | 11460kb | C++14 | 1.1kb | 2024-03-21 13:10:37 | 2024-03-21 13:10:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n, m, u[100471], v[100471];
vector<int> V[100471], E[100471];
unsigned long long a[100471], ans3, ans4;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", &u[i], &v[i]);
u[i]--;
v[i]--;
V[u[i]].push_back(v[i]);
V[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; i += 64) {
for (int j = 0; j < 64; j++) {
for (auto k : V[i + j]) {
a[k] |= (1 << j);
}
}
for (int j = 0; j < m; j++) {
unsigned long long S = a[u[j]] & a[v[j]];
while (S) {
E[j].push_back(i + __lg(S & -S));
S &= S - 1;
}
}
for (int j = 0; j < 64; j++) {
for (auto k : V[i + j]) {
a[k] = 0;
}
}
}
for (int i = 0; i < m; i += 64) {
for (int j = 0; j < 64; j++) {
for (auto k : E[i + j]) {
a[k] |= (1 << j);
}
}
for (int j = 0; j < m; j++) {
unsigned long long S = a[u[j]] & a[v[j]];
ans4 += __builtin_popcount(S);
}
for (int j = 0; j < 64; j++) {
for (auto k : E[i + j]) {
a[k] = 0;
}
}
}
printf("%llu\n", ans4 / 6);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 8956kb
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: 2ms
memory: 8488kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 2ms
memory: 8504kb
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: 11460kb
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:
2009754
result:
wrong answer 1st numbers differ - expected: '3689634', found: '2009754'