제출 #942341

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
942341	2024-03-10 13:15:16	esomer	Voting Cities (NOI22_votingcity)	C++17	100 / 100	72 ms	10444 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>
 
using namespace std;
 
#define int long long
 
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
 
  int N, E, K; cin >> N >> E >> K;
  vector<int> T(K);
  for(auto &i : T) cin >> i;
  vector<vector<pair<int, int>>> adj(N);
  for(int i = 0; i < E; i++){
    int u, v, c; cin >> u >> v >> c;
    adj[v].push_back({u, c});
  }
  vector<vector<long long>> dist(32, vector<long long>(N, 1e18));
  vector<vector<bool>> vis(32, vector<bool>(N, false));
  priority_queue<tuple<long long, int, int>> q;
  for(int i = 0; i < K; i++){
    dist[0][T[i]] = 0;
    q.push({0, 0, T[i]});
  }
  while(!q.empty()){
    int mask = get<1>(q.top()); int x = get<2>(q.top()); q.pop();
    if(vis[mask][x]) continue;
    vis[mask][x] = true;
    for(pair<int, int> p : adj[x]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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