oj.uz

답안 #201023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201023 2020-02-09T06:21:45 Z quocnguyen1012 Evacuation plan (IZhO18_plan) C++14
100 / 100
 1375 ms 49924 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;
typedef long long ll;

const int maxn = 1e5 + 5, maxm = 5e5 + 5;

class DSU
{
  vector<int> lab;
public:
  void init(int n)
  {
    lab.assign(n + 5, -1);
  }
  int finds(int u)
  {
    if (lab[u] < 0) return u;
    return lab[u] = finds(lab[u]);
  }
  bool same(int u, int v)
  {
    return finds(u) == finds(v);
  }
  bool merges(int u, int v)
  {
    u = finds(u); v = finds(v);
    if (u == v) return false;
    if (lab[v] < lab[u]) swap(u, v);
    lab[u] += lab[v];
    lab[v] = u;
    return true;
  }
}dsu;

class edge_list
{
public:
  int u, v, w;
  bool operator < (const edge_list & other) const
  {
    return w > other.w;
  }
}edge[maxm];
int N, M, K, Q;
int dist[maxn];
vector<pair<int, int>> Tree[maxn];
vector<int> adj[maxn];
int par[maxn][20], rmq[maxn][20], depth[maxn];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

void dfs(int u, int p = -1)
{
  for (int i = 1; (1 << i) <= N; ++i){
    par[u][i] = par[par[u][i - 1]][i - 1];
    rmq[u][i] = min(rmq[u][i - 1], rmq[par[u][i - 1]][i - 1]);
  }
  for (auto v : Tree[u]){
    if (v.fi == p) continue;
    depth[v.fi] = depth[u] + 1;
    par[v.fi][0] = u;
    rmq[v.fi][0] = v.se;
    dfs(v.fi, u);
  }
}

int LCA(int x, int y)
{
  if (depth[x] < depth[y]) swap(x, y);
  for (int k = 19; k >= 0; --k){
    if (depth[par[x][k]] >= depth[y]){
      x = par[x][k];
    }
  }
  if (x == y) return x;
  for (int k = 19; k >= 0; --k){
    if (par[x][k] != par[y][k]){
      x = par[x][k];
      y = par[y][k];
    }
  }
  return par[x][0];
}

int up(int x, int p)
{
  int res = 1e9;
  for (int k = 19; k >= 0; --k){
    if (depth[par[x][k]] >= depth[p]){
      res = min(res, rmq[x][k]);
      x = par[x][k];
    }
  }
  return res;
}

signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  if (fopen("A.INP", "r")){
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  }
  cin >> N >> M;
  for (int i = 1; i <= M; ++i){
    cin >> edge[i].u >> edge[i].v >> edge[i].w;
    adj[edge[i].u].pb(i); adj[edge[i].v].pb(i);
  }
  fill_n(&dist[0], maxn, 1e9 + 5);
  cin >> K;
  for (int i = 1; i <= K; ++i){
    int x; cin >> x;
    dist[x] = 0;
    pq.push(mp(0, x));
  }
  while (pq.size()){
    auto now = pq.top(); pq.pop();
    if (now.fi != dist[now.se]) continue;
    for (int i : adj[now.se]){
      int v = edge[i].u + edge[i].v - now.se;
      if (dist[v] > now.fi + edge[i].w){
        dist[v] = now.fi + edge[i].w;
        pq.push(mp(dist[v], v));
      }
    }
  }
  for (int i = 1; i <= M; ++i){
    edge[i].w = min(dist[edge[i].u], dist[edge[i].v]);
  }
  sort(edge + 1, edge + 1 + M);
  dsu.init(N);
  for (int i = 1; i <= M; ++i){
    if (dsu.merges(edge[i].u, edge[i].v)){
      Tree[edge[i].u].pb(mp(edge[i].v, edge[i].w));
      Tree[edge[i].v].pb(mp(edge[i].u, edge[i].w));
      ///cerr << edge[i].u << ' ' << edge[i].v << ' ' << edge[i].w << '\n';
    }
  }
  for (int i = 1; i <= N; ++i){
    if (depth[i] == 0){
      depth[i] = 1;
      dfs(i);
    }
  }
  cin >> Q;
  while (Q--){
    int u, v; cin >> u >> v;
    assert(dsu.same(u, v));
    int lc = LCA(u, v);
    cout << min(up(u, lc), up(v, lc)) << '\n';
  }
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:106:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("A.INP", "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
plan.cpp:107:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("A.OUT", "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Correct 9 ms 5880 KB Output is correct
3 Correct 9 ms 5752 KB Output is correct
4 Correct 8 ms 5496 KB Output is correct
5 Correct 9 ms 5752 KB Output is correct
6 Correct 9 ms 5752 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 8 ms 5496 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5752 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 9 ms 5752 KB Output is correct
14 Correct 10 ms 5752 KB Output is correct
15 Correct 9 ms 5752 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Correct 9 ms 5880 KB Output is correct
3 Correct 9 ms 5752 KB Output is correct
4 Correct 8 ms 5496 KB Output is correct
5 Correct 9 ms 5752 KB Output is correct
6 Correct 9 ms 5752 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 8 ms 5496 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5752 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 9 ms 5752 KB Output is correct
14 Correct 10 ms 5752 KB Output is correct
15 Correct 9 ms 5752 KB Output is correct
16 Correct 275 ms 28532 KB Output is correct
17 Correct 739 ms 49652 KB Output is correct
18 Correct 46 ms 9976 KB Output is correct
19 Correct 253 ms 34540 KB Output is correct
20 Correct 770 ms 49904 KB Output is correct
21 Correct 439 ms 37356 KB Output is correct
22 Correct 268 ms 37752 KB Output is correct
23 Correct 749 ms 49772 KB Output is correct
24 Correct 804 ms 49528 KB Output is correct
25 Correct 792 ms 49768 KB Output is correct
26 Correct 272 ms 34412 KB Output is correct
27 Correct 290 ms 34548 KB Output is correct
28 Correct 289 ms 34412 KB Output is correct
29 Correct 295 ms 34668 KB Output is correct
30 Correct 299 ms 34536 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 5496 KB Output is correct
2 Correct 8 ms 5500 KB Output is correct
3 Correct 9 ms 5496 KB Output is correct
4 Correct 9 ms 5496 KB Output is correct
5 Correct 9 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 9 ms 5496 KB Output is correct
9 Correct 8 ms 5496 KB Output is correct
10 Correct 8 ms 5496 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 35440 KB Output is correct
2 Correct 703 ms 48112 KB Output is correct
3 Correct 681 ms 47848 KB Output is correct
4 Correct 212 ms 33912 KB Output is correct
5 Correct 736 ms 47980 KB Output is correct
6 Correct 769 ms 47856 KB Output is correct
7 Correct 823 ms 47876 KB Output is correct
8 Correct 820 ms 48004 KB Output is correct
9 Correct 807 ms 47964 KB Output is correct
10 Correct 656 ms 47852 KB Output is correct
11 Correct 938 ms 47848 KB Output is correct
12 Correct 923 ms 47916 KB Output is correct
13 Correct 1171 ms 47980 KB Output is correct
14 Correct 963 ms 47980 KB Output is correct
15 Correct 1375 ms 47972 KB Output is correct
16 Correct 898 ms 47960 KB Output is correct
17 Correct 897 ms 47852 KB Output is correct
18 Correct 809 ms 47912 KB Output is correct
19 Correct 182 ms 35448 KB Output is correct
20 Correct 1158 ms 48020 KB Output is correct
21 Correct 692 ms 48232 KB Output is correct
22 Correct 280 ms 32876 KB Output is correct
23 Correct 164 ms 31992 KB Output is correct
24 Correct 382 ms 33072 KB Output is correct
25 Correct 171 ms 32876 KB Output is correct
26 Correct 187 ms 32372 KB Output is correct
27 Correct 223 ms 35192 KB Output is correct
28 Correct 154 ms 32868 KB Output is correct
29 Correct 420 ms 34552 KB Output is correct
30 Correct 372 ms 32876 KB Output is correct
31 Correct 189 ms 34556 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Correct 9 ms 5880 KB Output is correct
3 Correct 9 ms 5752 KB Output is correct
4 Correct 8 ms 5496 KB Output is correct
5 Correct 9 ms 5752 KB Output is correct
6 Correct 9 ms 5752 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 8 ms 5496 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5752 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 9 ms 5752 KB Output is correct
14 Correct 10 ms 5752 KB Output is correct
15 Correct 9 ms 5752 KB Output is correct
16 Correct 275 ms 28532 KB Output is correct
17 Correct 739 ms 49652 KB Output is correct
18 Correct 46 ms 9976 KB Output is correct
19 Correct 253 ms 34540 KB Output is correct
20 Correct 770 ms 49904 KB Output is correct
21 Correct 439 ms 37356 KB Output is correct
22 Correct 268 ms 37752 KB Output is correct
23 Correct 749 ms 49772 KB Output is correct
24 Correct 804 ms 49528 KB Output is correct
25 Correct 792 ms 49768 KB Output is correct
26 Correct 272 ms 34412 KB Output is correct
27 Correct 290 ms 34548 KB Output is correct
28 Correct 289 ms 34412 KB Output is correct
29 Correct 295 ms 34668 KB Output is correct
30 Correct 299 ms 34536 KB Output is correct
31 Correct 10 ms 5496 KB Output is correct
32 Correct 8 ms 5500 KB Output is correct
33 Correct 9 ms 5496 KB Output is correct
34 Correct 9 ms 5496 KB Output is correct
35 Correct 9 ms 5496 KB Output is correct
36 Correct 8 ms 5496 KB Output is correct
37 Correct 9 ms 5496 KB Output is correct
38 Correct 9 ms 5496 KB Output is correct
39 Correct 8 ms 5496 KB Output is correct
40 Correct 8 ms 5496 KB Output is correct
41 Correct 371 ms 35440 KB Output is correct
42 Correct 703 ms 48112 KB Output is correct
43 Correct 681 ms 47848 KB Output is correct
44 Correct 212 ms 33912 KB Output is correct
45 Correct 736 ms 47980 KB Output is correct
46 Correct 769 ms 47856 KB Output is correct
47 Correct 823 ms 47876 KB Output is correct
48 Correct 820 ms 48004 KB Output is correct
49 Correct 807 ms 47964 KB Output is correct
50 Correct 656 ms 47852 KB Output is correct
51 Correct 938 ms 47848 KB Output is correct
52 Correct 923 ms 47916 KB Output is correct
53 Correct 1171 ms 47980 KB Output is correct
54 Correct 963 ms 47980 KB Output is correct
55 Correct 1375 ms 47972 KB Output is correct
56 Correct 898 ms 47960 KB Output is correct
57 Correct 897 ms 47852 KB Output is correct
58 Correct 809 ms 47912 KB Output is correct
59 Correct 182 ms 35448 KB Output is correct
60 Correct 1158 ms 48020 KB Output is correct
61 Correct 692 ms 48232 KB Output is correct
62 Correct 280 ms 32876 KB Output is correct
63 Correct 164 ms 31992 KB Output is correct
64 Correct 382 ms 33072 KB Output is correct
65 Correct 171 ms 32876 KB Output is correct
66 Correct 187 ms 32372 KB Output is correct
67 Correct 223 ms 35192 KB Output is correct
68 Correct 154 ms 32868 KB Output is correct
69 Correct 420 ms 34552 KB Output is correct
70 Correct 372 ms 32876 KB Output is correct
71 Correct 189 ms 34556 KB Output is correct
72 Correct 463 ms 37212 KB Output is correct
73 Correct 853 ms 49768 KB Output is correct
74 Correct 922 ms 49644 KB Output is correct
75 Correct 1059 ms 49644 KB Output is correct
76 Correct 936 ms 49516 KB Output is correct
77 Correct 1211 ms 49512 KB Output is correct
78 Correct 764 ms 49476 KB Output is correct
79 Correct 725 ms 49524 KB Output is correct
80 Correct 783 ms 49644 KB Output is correct
81 Correct 922 ms 49516 KB Output is correct
82 Correct 695 ms 49640 KB Output is correct
83 Correct 988 ms 49512 KB Output is correct
84 Correct 984 ms 49636 KB Output is correct
85 Correct 847 ms 49700 KB Output is correct
86 Correct 708 ms 49812 KB Output is correct
87 Correct 713 ms 49644 KB Output is correct
88 Correct 963 ms 49644 KB Output is correct
89 Correct 379 ms 36728 KB Output is correct
90 Correct 1055 ms 49924 KB Output is correct
91 Correct 893 ms 49548 KB Output is correct
92 Correct 356 ms 34412 KB Output is correct
93 Correct 369 ms 34296 KB Output is correct
94 Correct 239 ms 34408 KB Output is correct
95 Correct 238 ms 34604 KB Output is correct
96 Correct 370 ms 34040 KB Output is correct
97 Correct 410 ms 35920 KB Output is correct
98 Correct 301 ms 34408 KB Output is correct
99 Correct 370 ms 36984 KB Output is correct
100 Correct 485 ms 34672 KB Output is correct