# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863877 | TAhmed33 | From Hacks to Snitches (BOI21_watchmen) | C++98 | 3074 ms | 105720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e16;
int dist[100001][126];
int arr[126];
int n;
vector <int> adj[100001];
signed main () {
ios::sync_with_stdio(0);
cin.tie(0);
int m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int l; cin >> l >> l;
for (int i = 0; i < l; i++) cin >> arr[i];
for (int i = 0; i < 125; i++) {
for (int j = 1; j <= n; j++) {
dist[j][i] = inf;
}
}
dist[1][0] = 0;
priority_queue <vector <int>, vector <vector <int>>, greater <vector <int>>> pq;
pq.push({0, 0, 1});
while (!pq.empty()) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |