oj.uz

Submission #340840

# Submission time Handle Problem Language Result Execution time Memory
340840 2020-12-28T12:30:36 Z ivan_tudor Evacuation plan (IZhO18_plan) C++14
100 / 100
 1377 ms 45044 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct edge{
  int x, c;
};
vector<edge> gr[N];
struct dst{
  int d, id;
};
int dist[N];
dst ord[N];
bool mark[N];
bool cmpdist(dst a, dst b){
  return a.d > b.d;
}

int par[N];
vector<int> arb[N];
int findt(int nod){
  if(nod == par[nod])
    return nod;
  par[nod] = findt(par[nod]);
  return par[nod];
}
void join(int son,int dad){
  son = findt(son);
  if(son != dad){
    par[son] = dad;
    arb[son].push_back(dad);
    arb[dad].push_back(son);
  }
}
int pr[20][N];
int in[N], out[N];
int cnt = 0;
void dfs_arb(int nod,int dad){
  pr[0][nod] = dad;
  in[nod] = ++cnt;
  for(auto x:arb[nod]){
    if(x!=dad){
      dfs_arb(x, nod);
    }
  }
  out[nod] = cnt;
}
bool isdad(int dad, int son){
  return in[dad] <= in[son] && out[son] <= out[dad];
}



int main()
{
  int n, m;
  cin>>n>>m;
  for(int i=1;i<=m;i++){
    int a, b, c;
    cin>>a>>b>>c;
    gr[a].push_back({b, c});
    gr[b].push_back({a, c});
  }
  for(int i=1;i<=n;i++){
    dist[i] = INT_MAX;
  }
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
  int k;
  cin>>k;
  for(int i=1;i<=k;i++){
    int o;
    cin>>o;

    dist[o] = 0;
    pq.push({0, o});
  }
  while(pq.size()){
    auto top = pq.top();
    pq.pop();
    int nod = top.second;
    int cost = top.first;
    if(cost == dist[nod]){
      for(auto e:gr[nod]){
        if(cost + e.c < dist[e.x]){
          dist[e.x] = cost + e.c;
          pq.push({dist[e.x], e.x});
        }
      }
    }
  }
  for(int i=1;i<=n;i++){
    ord[i] = {dist[i], i};
    par[i] = i;
  }
  sort(ord + 1, ord + n + 1, cmpdist);
  int root = 0;
  for(int i=1; i<=n;i++){
    int nod = ord[i].id;
    mark[nod] = true;
    root = nod;
    for(auto x:gr[nod]){
      int vec = x.x;
      if(mark[vec] == true){
        join(vec, nod); // il pun pe nod tata la vec;

      }
    }
  }
  dfs_arb(root, 0);
  for(int log =1; log < 17;log++){
    for(int nod = 1; nod<=n;nod++){
      pr[log][nod] = pr[log-1][pr[log-1][nod]];
    }
  }
  int q;
  cin>>q;
  for(int i =1 ; i<=q;i++){
    int a, b;
    cin>>a>>b;
    for(int p2 = 16;p2>=0;p2--){
      if(pr[p2][a] != 0 && isdad(pr[p2][a], b)== false){
        a = pr[p2][a];
      }
    }
    if(isdad(a, b) == false){
      a = pr[0][a];

    }
    cout<<dist[a]<<"\n";
  }
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 8 ms 5356 KB Output is correct
3 Correct 9 ms 5356 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 9 ms 5356 KB Output is correct
6 Correct 8 ms 5356 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 8 ms 5356 KB Output is correct
10 Correct 8 ms 5356 KB Output is correct
11 Correct 8 ms 5356 KB Output is correct
12 Correct 8 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 8 ms 5356 KB Output is correct
15 Correct 8 ms 5356 KB Output is correct
16 Correct 654 ms 22760 KB Output is correct
17 Correct 1377 ms 44680 KB Output is correct
18 Correct 90 ms 9196 KB Output is correct
19 Correct 522 ms 25696 KB Output is correct
20 Correct 1371 ms 44724 KB Output is correct
21 Correct 891 ms 31568 KB Output is correct
22 Correct 675 ms 28816 KB Output is correct
23 Correct 1371 ms 44676 KB Output is correct
24 Correct 1332 ms 44716 KB Output is correct
25 Correct 1367 ms 44512 KB Output is correct
26 Correct 534 ms 25696 KB Output is correct
27 Correct 516 ms 25640 KB Output is correct
28 Correct 543 ms 25568 KB Output is correct
29 Correct 518 ms 25836 KB Output is correct
30 Correct 505 ms 25648 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 29540 KB Output is correct
2 Correct 861 ms 42848 KB Output is correct
3 Correct 850 ms 42848 KB Output is correct
4 Correct 172 ms 24428 KB Output is correct
5 Correct 831 ms 43060 KB Output is correct
6 Correct 836 ms 42848 KB Output is correct
7 Correct 844 ms 42944 KB Output is correct
8 Correct 837 ms 42848 KB Output is correct
9 Correct 824 ms 42976 KB Output is correct
10 Correct 829 ms 42848 KB Output is correct
11 Correct 824 ms 42868 KB Output is correct
12 Correct 825 ms 42848 KB Output is correct
13 Correct 825 ms 42904 KB Output is correct
14 Correct 822 ms 42976 KB Output is correct
15 Correct 832 ms 43056 KB Output is correct
16 Correct 819 ms 42880 KB Output is correct
17 Correct 824 ms 42848 KB Output is correct
18 Correct 808 ms 42976 KB Output is correct
19 Correct 171 ms 26732 KB Output is correct
20 Correct 819 ms 42848 KB Output is correct
21 Correct 785 ms 43088 KB Output is correct
22 Correct 177 ms 24032 KB Output is correct
23 Correct 183 ms 23532 KB Output is correct
24 Correct 177 ms 24032 KB Output is correct
25 Correct 181 ms 24032 KB Output is correct
26 Correct 201 ms 22892 KB Output is correct
27 Correct 171 ms 24300 KB Output is correct
28 Correct 174 ms 24032 KB Output is correct
29 Correct 174 ms 24300 KB Output is correct
30 Correct 172 ms 24004 KB Output is correct
31 Correct 171 ms 24660 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 8 ms 5356 KB Output is correct
3 Correct 9 ms 5356 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 9 ms 5356 KB Output is correct
6 Correct 8 ms 5356 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 8 ms 5356 KB Output is correct
10 Correct 8 ms 5356 KB Output is correct
11 Correct 8 ms 5356 KB Output is correct
12 Correct 8 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 8 ms 5356 KB Output is correct
15 Correct 8 ms 5356 KB Output is correct
16 Correct 654 ms 22760 KB Output is correct
17 Correct 1377 ms 44680 KB Output is correct
18 Correct 90 ms 9196 KB Output is correct
19 Correct 522 ms 25696 KB Output is correct
20 Correct 1371 ms 44724 KB Output is correct
21 Correct 891 ms 31568 KB Output is correct
22 Correct 675 ms 28816 KB Output is correct
23 Correct 1371 ms 44676 KB Output is correct
24 Correct 1332 ms 44716 KB Output is correct
25 Correct 1367 ms 44512 KB Output is correct
26 Correct 534 ms 25696 KB Output is correct
27 Correct 516 ms 25640 KB Output is correct
28 Correct 543 ms 25568 KB Output is correct
29 Correct 518 ms 25836 KB Output is correct
30 Correct 505 ms 25648 KB Output is correct
31 Correct 4 ms 5100 KB Output is correct
32 Correct 5 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 4 ms 5100 KB Output is correct
35 Correct 4 ms 5100 KB Output is correct
36 Correct 4 ms 5100 KB Output is correct
37 Correct 4 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5100 KB Output is correct
40 Correct 4 ms 5100 KB Output is correct
41 Correct 397 ms 29540 KB Output is correct
42 Correct 861 ms 42848 KB Output is correct
43 Correct 850 ms 42848 KB Output is correct
44 Correct 172 ms 24428 KB Output is correct
45 Correct 831 ms 43060 KB Output is correct
46 Correct 836 ms 42848 KB Output is correct
47 Correct 844 ms 42944 KB Output is correct
48 Correct 837 ms 42848 KB Output is correct
49 Correct 824 ms 42976 KB Output is correct
50 Correct 829 ms 42848 KB Output is correct
51 Correct 824 ms 42868 KB Output is correct
52 Correct 825 ms 42848 KB Output is correct
53 Correct 825 ms 42904 KB Output is correct
54 Correct 822 ms 42976 KB Output is correct
55 Correct 832 ms 43056 KB Output is correct
56 Correct 819 ms 42880 KB Output is correct
57 Correct 824 ms 42848 KB Output is correct
58 Correct 808 ms 42976 KB Output is correct
59 Correct 171 ms 26732 KB Output is correct
60 Correct 819 ms 42848 KB Output is correct
61 Correct 785 ms 43088 KB Output is correct
62 Correct 177 ms 24032 KB Output is correct
63 Correct 183 ms 23532 KB Output is correct
64 Correct 177 ms 24032 KB Output is correct
65 Correct 181 ms 24032 KB Output is correct
66 Correct 201 ms 22892 KB Output is correct
67 Correct 171 ms 24300 KB Output is correct
68 Correct 174 ms 24032 KB Output is correct
69 Correct 174 ms 24300 KB Output is correct
70 Correct 172 ms 24004 KB Output is correct
71 Correct 171 ms 24660 KB Output is correct
72 Correct 870 ms 31204 KB Output is correct
73 Correct 1301 ms 44528 KB Output is correct
74 Correct 1297 ms 44640 KB Output is correct
75 Correct 1294 ms 44896 KB Output is correct
76 Correct 1298 ms 44640 KB Output is correct
77 Correct 1298 ms 44640 KB Output is correct
78 Correct 1290 ms 44512 KB Output is correct
79 Correct 1295 ms 44560 KB Output is correct
80 Correct 1301 ms 44540 KB Output is correct
81 Correct 1315 ms 44640 KB Output is correct
82 Correct 1298 ms 44640 KB Output is correct
83 Correct 1288 ms 44640 KB Output is correct
84 Correct 1285 ms 44632 KB Output is correct
85 Correct 1280 ms 44636 KB Output is correct
86 Correct 1326 ms 45044 KB Output is correct
87 Correct 1272 ms 44640 KB Output is correct
88 Correct 1300 ms 44768 KB Output is correct
89 Correct 686 ms 29292 KB Output is correct
90 Correct 1293 ms 44512 KB Output is correct
91 Correct 1256 ms 44668 KB Output is correct
92 Correct 520 ms 25588 KB Output is correct
93 Correct 602 ms 25580 KB Output is correct
94 Correct 556 ms 25440 KB Output is correct
95 Correct 519 ms 25700 KB Output is correct
96 Correct 555 ms 24300 KB Output is correct
97 Correct 615 ms 26220 KB Output is correct
98 Correct 557 ms 25696 KB Output is correct
99 Correct 616 ms 26240 KB Output is correct
100 Correct 531 ms 25576 KB Output is correct