oj.uz

Submission #338518

# Submission time Handle Problem Language Result Execution time Memory
338518 2020-12-23T10:09:14 Z boykut Evacuation plan (IZhO18_plan) C++14
35 / 100
 635 ms 33512 KB 
#include <bits/stdc++.h>

using namespace std;

// SNM
vector <int> par, siz, ans;
vector <set<int>> st;
void make_set(int n) {
   par = siz = vector<int> (1+n);
   for (int i = 0; i <= n; i++)
      par[i] = i, siz[i] = 1;
}
int find_set(int v) {
   if (v == par[v]) return v;
   return par[v] = find_set(par[v]);
}
void uni(int a, int b) {
   a = find_set(a);
   b = find_set(b);
   if (a != b) {
      if (siz[a] < siz[b])
         swap(a, b);
      siz[a] += siz[b];
      par[b] = a;
   }
}

signed main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
   int n, m;
   cin >> n >> m;
   vector <pair<int,int>> g[1+n];
   vector <int> G[1+n];
   vector <int> d(1+n, INT_MAX), used(1+n, 0);
   st = vector <set<int>> (1+n);
   for (int i = 0; i < m; i++) {
      int u, v, cost;
      cin >> u >> v >> cost;
      g[u].push_back({v, cost}); G[u].push_back(v);
      g[v].push_back({u, cost}); G[v].push_back(u);
   }
   int k;
   cin >> k;
   vector <int> r(k);
   for (int i = 0; i < k; i++) {
      cin >> r[i];
   }
   priority_queue <pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> qw;
   for (int i = 0; i < k; i++) {
      qw.push({0, r[i]});
      d[r[i]] = 0;
   }
   while (!qw.empty()) {
      int v = qw.top().second;
      qw.pop();
      if (used[v]) continue;
      used[v] = 1;
      for (pair<int,int> i : g[v]) {
         int to = i.first, len = i.second;
         if (d[v] + len < d[to]) {
            d[to] = d[v] + len;
            qw.push({d[to], to});
         }
      }
   }/*
   int q;
   cin >> q;
   ans = vector <int> (q);
   for (int i = 0; i < q; i++) {
      int s, t;
      cin >> s >> t;
      st[s].insert(i);
      st[t].insert(i);
   }
   make_set(n);
   vector <int> pos;
   for (int i = 1; i <= n; i++) {
      pos.push_back(i);
   }
   sort(pos.begin(), pos.end(), [&](int a, int b) {
      return d[a] > d[b];
   });
   used = vector <int> (1+n, 0);
   for (int v: pos) {
      used[v] = 1;
      for (int to: G[v]) {
         if (used[to]) {
            uni(v, to);
         }
      }
   }
   for (int i = 0; i < q; i++) {
      cout << ans[i] << '\n';
   }*/
   int q;
   cin >> q;
   if ((q <= 200 && n <= 15 && m <= 200)) {
      for (int i = 0; i < q; i++) {
         int s, t;
         cin >> s >> t;
         vector <int> d2(1+n, 0); d2[s] = d[s];
         priority_queue <pair<int,int>> qw;
         qw.push({d2[s], s});
         while (!qw.empty()) {
            int v = qw.top().second;
            qw.pop();
            for (int to : G[v]){
               if (d2[to] < d2[v]){
                  d2[to] = min(d[to], d2[v]);
                  qw.push({d2[to], to});
               }
            }
         }
         cout << d2[t] << '\n';
      }
   } else {
      for (int i = 0; i < q; i++) {
         int s, t;
         cin >> s >> t;
         cout << min(d[s], d[t]) << '\n';
      }
   }
   return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 138 ms 15336 KB Output is correct
17 Correct 635 ms 33384 KB Output is correct
18 Correct 36 ms 3852 KB Output is correct
19 Correct 148 ms 19572 KB Output is correct
20 Correct 613 ms 33504 KB Output is correct
21 Correct 273 ms 22756 KB Output is correct
22 Correct 125 ms 17644 KB Output is correct
23 Correct 612 ms 33512 KB Output is correct
24 Correct 609 ms 33504 KB Output is correct
25 Correct 611 ms 33376 KB Output is correct
26 Correct 147 ms 19556 KB Output is correct
27 Correct 148 ms 19552 KB Output is correct
28 Correct 147 ms 19552 KB Output is correct
29 Correct 149 ms 19552 KB Output is correct
30 Correct 142 ms 19552 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 27 ms 620 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 30 ms 492 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 21880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 138 ms 15336 KB Output is correct
17 Correct 635 ms 33384 KB Output is correct
18 Correct 36 ms 3852 KB Output is correct
19 Correct 148 ms 19572 KB Output is correct
20 Correct 613 ms 33504 KB Output is correct
21 Correct 273 ms 22756 KB Output is correct
22 Correct 125 ms 17644 KB Output is correct
23 Correct 612 ms 33512 KB Output is correct
24 Correct 609 ms 33504 KB Output is correct
25 Correct 611 ms 33376 KB Output is correct
26 Correct 147 ms 19556 KB Output is correct
27 Correct 148 ms 19552 KB Output is correct
28 Correct 147 ms 19552 KB Output is correct
29 Correct 149 ms 19552 KB Output is correct
30 Correct 142 ms 19552 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 6 ms 364 KB Output is correct
36 Correct 27 ms 620 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 30 ms 492 KB Output is correct
41 Incorrect 238 ms 21880 KB Output isn't correct
42 Halted 0 ms 0 KB -