Submission #1147817

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1147817	2025-02-09 09:42:33	mocha	Voting Cities (NOI22_votingcity)	C++20	100 / 100	113 ms	35256 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mx = 5e3+5;
const int inf = 1e18;
int n, m, k;
int t[mx];
vector<pair<int, int>> g[mx<<5];
long long dis[mx<<5];
signed main() {
    cin >> n >> m >> k;
    for (int i=0;i<k;i++) cin >> t[i];
    for (int i=0;i<m;i++) {
        int u, v, c;
        cin >> u >> v >> c;
        for (int j=0;j<1<<5;j++) {
            g[v<<5|j].push_back({u<<5|j, c});
            for (int k=1;k<1<<5;k<<=1) {
                if (j&k) continue;
                g[v<<5|j].push_back({u<<5|j|k, c});
            }
        }
    }
    fill(dis, dis+((n+1)<<5), inf);
    priority_queue<pair<int, int>> pq;
    for (int i=0;i<k;i++) {
        for (int j=0;j<1<<5;j++) {
            dis[t[i]<<5|j] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 10 / 10
• Subtask 7: 15 / 15
• Subtask 8: 50 / 50