QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#341468 | #905. 三元环枚举 | cxm1024# | WA | 16ms | 9892kb | C++14 | 885b | 2024-02-29 19:14:19 | 2024-02-29 19:14:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
int n, m, w[100010], deg[100010], vis[100010];
pair<int, int> e[100010];
vector<int> a[100010];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> w[i];
for (int i = 1; i <= m; i++) {
cin >> e[i].first >> e[i].second, e[i].first++, e[i].second++;
deg[e[i].first]++, deg[e[i].second]++;
}
for (int i = 1; i <= m; i++) {
int u, v;
tie(u, v) = e[i];
if (make_pair(deg[u], u) < make_pair(deg[v], v))
a[u].push_back(v);
else a[v].push_back(u);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int v : a[i])
vis[v] = 1;
for (int v : a[i])
for (int t : a[v])
if (vis[t]) (ans += w[i] * w[v] % mod * w[t]) %= mod;
}
cout << ans << '\n';
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 8856kb
input:
4 5 1 2 3 4 0 3 2 0 2 1 2 3 1 3
output:
36
result:
ok "36"
Test #2:
score: -100
Wrong Answer
time: 16ms
memory: 9892kb
input:
17707 77101 528756313 434883274 318065816 264440383 659789617 608119380 648104885 725454492 696703871 543030428 663661240 890791532 108201616 428505484 322953840 119811886 691103780 306647414 549862302 176916719 909058872 455464665 307270851 584469329 722629343 875317523 629938577 244419357 78121457...
output:
822931711
result:
wrong answer 1st words differ - expected: '397965084', found: '822931711'