QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #302471 | #6354. 4 | TernaryTree | WA | 9ms | 6076kb | C++14 | 1.3kb | 2024-01-10 21:45:26 | 2024-01-10 21:45:27 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define fs first
#define sc second
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e5 + 10;
const int maxd = 1e3 + 10;
int n, m, ans;
vector<int> g[maxn];
bitset<maxd> f[maxd];
pii e[maxn];
int deg[maxn];
int tag[maxn];
int id[maxn], cnt, tot;
pii p[maxn];
signed main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> e[i].fs >> e[i].sc;
++deg[e[i].fs], ++deg[e[i].sc];
}
for (int i = 1; i <= m; i++) {
if (deg[e[i].fs] < deg[e[i].sc] || deg[e[i].fs] == deg[e[i].sc] && e[i].fs < e[i].sc) g[e[i].fs].push_back(e[i].sc);
else g[e[i].sc].push_back(e[i].fs);
}
for (int u = 1; u <= n; u++) {
for (int v : g[u]) tag[v]++;
cnt = tot = 0;
for (int v : g[u]) {
for (int w : g[v]) {
if (tag[w]) {
if (!id[v]) id[v] = ++tot;
if (!id[w]) id[w] = ++tot;
f[id[v]][id[w]] = 1;
f[id[w]][id[v]] = 1;
p[++cnt] = {id[v], id[w]};
}
}
}
for (int i = 1; i <= cnt; i++) ans += (f[p[i].fs] & f[p[i].sc]).count();
for (int v : g[u]) {
for (int w : g[v]) {
if (tag[w]) {
if (id[v]) id[v] = 0;
if (id[w]) id[w] = 0;
f[id[v]][id[w]] = 0;
f[id[w]][id[v]] = 0;
}
}
}
for (int v : g[u]) tag[v]--;
}
assert(ans%3==0);
cout << ans / 3 << endl;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5852kb
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: 5708kb
input:
4 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 0ms
memory: 5788kb
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: 9ms
memory: 6076kb
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:
4827956
result:
wrong answer 1st numbers differ - expected: '3689634', found: '4827956'