QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#372586#8038. Hammer to Fallucup-team1001#WA 129ms18428kbC++231.3kb2024-03-31 15:58:212024-03-31 15:58:22

Judging History

你现在查看的是最新测评结果

  • [2024-03-31 15:58:22]
  • 评测
  • 测评结果:WA
  • 用时:129ms
  • 内存:18428kb
  • [2024-03-31 15:58:21]
  • 提交

answer

//
// Created by DELLPC on 24-3-31.
//
#include <bits/stdc++.h>

using namespace std;
#define int long  long
//3 2 2
// 1 1 1
// 2 3 10
// 1 2 1
// 3 2
const int mod = 998244353;

signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> num(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> num[i];
    }
    vector<priority_queue<tuple<int, int, int, int>,
            vector<tuple<int, int, int, int>>, greater<>>> mp(n + 1);
    vector<int> dis(n + 1);
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        mp[u].emplace(w, 0, w, v);
        mp[v].emplace(w, 0, w, u);
    }
    vector<int> ans(k + 1);
    for (int i = 1; i <= k; i++) {
        cin >> ans[i];
    }
    for (int i = k; i; i--) {
        do {
            auto [_, ta, w, v] = mp[ans[i]].top();
            if (ta != dis[v]) {
                mp[ans[i]].pop();
                mp[ans[i]].emplace((dis[v] + w) % mod, dis[v], w, v);
            } else break;
        } while (true);

        auto [w, _, __, ___] = mp[ans[i]].top();
        dis[ans[i]] = w;
    }
    int sums = 0;
    for (int i = 1; i <= n; i++) {
        sums += (num[i] * dis[i]) % mod;
        sums %= mod;
    }
    cout << sums << endl;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3804kb

input:

3 2 2
1 1 1
2 3 10
1 2 1
3 2

output:

12

result:

ok single line: '12'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

2 1 10
5000 5000
1 2 10000
1 2 2 1 2 2 1 1 1 2

output:

550000000

result:

ok single line: '550000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3504kb

input:

10 10 10
5 14 99 14 18 4 58 39 48 60
2 4 4
6 9 56
10 8 34
7 5 96
1 3 26
3 7 92
6 8 4
5 1 72
7 6 39
7 2 93
8 8 9 10 2 2 5 9 2 3

output:

8810

result:

ok single line: '8810'

Test #4:

score: 0
Accepted
time: 2ms
memory: 3960kb

input:

100 500 10000
89 61 65 85 89 2 32 97 13 70 29 86 68 74 84 64 54 39 26 84 56 95 73 11 70 26 60 40 84 58 68 33 65 71 55 2 11 71 49 85 14 59 38 11 60 8 81 78 27 32 52 49 35 94 62 72 64 50 12 45 77 74 92 67 92 38 81 39 12 29 60 70 53 33 25 60 7 83 4 85 47 32 13 58 85 86 44 68 44 1 81 62 97 7 66 62 5 16 ...

output:

609241

result:

ok single line: '609241'

Test #5:

score: -100
Wrong Answer
time: 129ms
memory: 18428kb

input:

100000 100000 100000
134299012 740620432 241626312 533601686 901212368 274154852 46613593 72208460 685661661 930069933 934386896 140544225 900179749 8735320 54649110 922673925 450551589 517879800 773426781 410723403 783459037 344315202 75310230 122339501 113898579 646500753 18238713 119326471 969272...

output:

342263537

result:

wrong answer 1st lines differ - expected: '641103242', found: '342263537'