oj.uz

Submission #891687

# Submission time Handle Problem Language Result Execution time Memory
891687 2023-12-23T16:13:14 Z ind1v Dreaming (IOI13_dreaming) C++11
47 / 100
 59 ms 11680 KB 
#include <bits/stdc++.h>
#include "dreaming.h"

using namespace std;

const int N = 1e5 + 5;

struct info {
  int d, da, db;
  
  info() {}
  
  info(int _d, int _da, int _db) : d(_d), da(_da), db(_db) {}
};

info optimize(info u, info v) {
  return max(u.da, u.db) < max(v.da, v.db) ? u : v;
}

info merge(info u, info v, int w) {
  int dd[6] = {u.d, v.d, u.da + w + v.da, u.da + w + v.db, u.db + w + v.da, u.db + w + v.db};
  int mx = *max_element(dd, dd + 6);
  info res(mx, 2e9, 2e9);
  for (int i = 0; i < 6; i++) {
    if (dd[i] == mx) {
      if (i == 0) {
        res = optimize(res, info(mx, u.da, u.db));
      } else if (i == 1) {
        res = optimize(res, info(mx, v.da, v.db));
      } else if (i == 2) {
        res = optimize(res, info(mx, u.da, w + v.da));
        res = optimize(res, info(mx, w + u.da, v.da));
      } else if (i == 3) {
        res = optimize(res, info(mx, u.da, w + v.db));
        res = optimize(res, info(mx, w + u.da, v.db));
      } else if (i == 4) {
        res = optimize(res, info(mx, u.db, w + v.da));
        res = optimize(res, info(mx, w + u.db, v.da));
      } else if (i == 5) {
        res = optimize(res, info(mx, u.db, w + v.db));
        res = optimize(res, info(mx, w + u.db, v.db));
      }
    }
  }
  return res;
}

struct dsu {
  int lab[N];
  info fi[N];
  
  dsu() {
    memset(lab, -1, sizeof(lab));
    for (int i = 0; i < N; i++) {
      fi[i] = info(0, 0, 0);
    }
  }
  
  int find(int u) {
    return lab[u] < 0 ? u : lab[u] = find(lab[u]);
  }
  
  bool unite(int u, int v, int w) {
    if ((u = find(u)) == (v = find(v))) {
      return false;
    }
    if (lab[u] > lab[v]) {
      swap(u, v);
    }
    fi[u] = merge(fi[u], fi[v], w);
    lab[u] += lab[v];
    lab[v] = u;
    return true;
  }
};

vector<pair<int, int>> g[N];
dsu ds;
int d[N];
int da[N], db[N];

void process(int id) {
  queue<int> q;
  d[id] = 0;
  q.push(id);
  int mx = 0;
  int j = id;
  vector<int> nd;
  nd.emplace_back(id);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (pair<int, int> e : g[u]) {
      int v = e.first;
      int w = e.second;
      if (d[v] > d[u] + w) {
        nd.emplace_back(v);
        d[v] = d[u] + w;
        q.push(v);
        if (d[v] > mx) {
          mx = d[v];
          j = v;
        }
      }
    }
  }
  int a = j;
  for (int x : nd) {
    d[x] = 0x3f3f3f3f;
  }
  d[j] = 0;
  q.push(j);
  mx = 0;
  int k = j;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (pair<int, int> e : g[u]) {
      int v = e.first;
      int w = e.second;
      if (d[v] > d[u] + w) {
        d[v] = d[u] + w;
        q.push(v);
        if (d[v] > mx) {
          mx = d[v];
          k = v;
        }
      }
    }
  }
  int b = k;
  q.push(a);
  da[a] = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (pair<int, int> e : g[u]) {
      int v = e.first;
      int w = e.second;
      if (da[v] > da[u] + w) {
        da[v] = da[u] + w;
        q.push(v);
      }
    }
  }
  q.push(b);
  db[b] = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (pair<int, int> e : g[u]) {
      int v = e.first;
      int w = e.second;
      if (db[v] > db[u] + w) {
        db[v] = db[u] + w;
        q.push(v);
      }
    }
  }
  pair<int, int> opt = {2e9, 2e9};
  for (int i = 0; i < (int) nd.size(); i++) {
    if (max(da[nd[i]], db[nd[i]]) < max(opt.first, opt.second)) {
      opt = {da[nd[i]], db[nd[i]]};
    }
  }
  for (int i = 0; i < (int) nd.size() - 1; i++) {
    ds.unite(nd[i], nd[i + 1], 0);
  }
  int root = ds.find(nd.front());
  ds.fi[root] = info(mx, opt.first, opt.second);
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
  memset(d, 0x3f, sizeof(d));
  memset(da, 0x3f, sizeof(da));
  memset(db, 0x3f, sizeof(db));
  for (int i = 0; i < m; i++) {
    g[a[i]].emplace_back(b[i], t[i]);
    g[b[i]].emplace_back(a[i], t[i]);
  }
  for (int i = 0; i < n; i++) {
    if (d[i] == 0x3f3f3f3f) {
      process(i);
    }
  }
  priority_queue<pair<int, int>> pq;
  vector<int> c;
  for (int i = 0; i < n; i++) {
    c.emplace_back(ds.find(i));
  }
  sort(c.begin(), c.end());
  c.erase(unique(c.begin(), c.end()), c.end());
  for (int i = 0; i < (int) c.size(); i++) {
    pq.push({-max(ds.fi[c[i]].da, ds.fi[c[i]].db), c[i]});
  }
  while (pq.size() > 1) {
    int u = pq.top().second;
    pq.pop();
    int v = pq.top().second;
    pq.pop();
    ds.unite(u, v, l);
    int nc = ds.find(u);
    pq.push({-max(ds.fi[nc].da, ds.fi[nc].db), nc});
  }
  return ds.fi[ds.find(1)].d;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 10344 KB Output is correct
2 Correct 35 ms 10352 KB Output is correct
3 Correct 25 ms 8936 KB Output is correct
4 Correct 7 ms 7012 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 10 ms 7436 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 19 ms 8336 KB Output is correct
9 Correct 24 ms 8540 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 34 ms 9604 KB Output is correct
12 Correct 38 ms 9924 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6388 KB Output is correct
5 Correct 2 ms 6332 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6488 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6528 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 10344 KB Output is correct
2 Correct 35 ms 10352 KB Output is correct
3 Correct 25 ms 8936 KB Output is correct
4 Correct 7 ms 7012 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 10 ms 7436 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 19 ms 8336 KB Output is correct
9 Correct 24 ms 8540 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 34 ms 9604 KB Output is correct
12 Correct 38 ms 9924 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6388 KB Output is correct
18 Correct 2 ms 6332 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6528 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 38 ms 10396 KB Output is correct
40 Correct 37 ms 10348 KB Output is correct
41 Correct 26 ms 8932 KB Output is correct
42 Correct 8 ms 7256 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6492 KB Output is correct
45 Correct 2 ms 6492 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 2 ms 6492 KB Output is correct
48 Correct 2 ms 6492 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 46 ms 11568 KB Output is correct
58 Correct 45 ms 11468 KB Output is correct
59 Correct 47 ms 11384 KB Output is correct
60 Correct 49 ms 11132 KB Output is correct
61 Correct 47 ms 11416 KB Output is correct
62 Correct 54 ms 11216 KB Output is correct
63 Correct 42 ms 11304 KB Output is correct
64 Correct 46 ms 11268 KB Output is correct
65 Correct 44 ms 11072 KB Output is correct
66 Correct 46 ms 11124 KB Output is correct
67 Correct 47 ms 11236 KB Output is correct
68 Correct 46 ms 11380 KB Output is correct
69 Correct 49 ms 11204 KB Output is correct
70 Correct 47 ms 11148 KB Output is correct
71 Correct 2 ms 6488 KB Output is correct
72 Correct 3 ms 6492 KB Output is correct
73 Correct 3 ms 6492 KB Output is correct
74 Correct 3 ms 6492 KB Output is correct
75 Correct 3 ms 6492 KB Output is correct
76 Correct 3 ms 6492 KB Output is correct
77 Correct 3 ms 6612 KB Output is correct
78 Correct 3 ms 6492 KB Output is correct
79 Correct 3 ms 6488 KB Output is correct
80 Correct 57 ms 11336 KB Output is correct
81 Correct 59 ms 11680 KB Output is correct
82 Correct 47 ms 11164 KB Output is correct
83 Correct 47 ms 11340 KB Output is correct
84 Correct 2 ms 6492 KB Output is correct
85 Correct 2 ms 6492 KB Output is correct
86 Correct 2 ms 6492 KB Output is correct
87 Correct 3 ms 6492 KB Output is correct
88 Correct 3 ms 6492 KB Output is correct
89 Correct 2 ms 6664 KB Output is correct
90 Correct 3 ms 6488 KB Output is correct
91 Correct 3 ms 6492 KB Output is correct
92 Correct 3 ms 6492 KB Output is correct
93 Correct 2 ms 6492 KB Output is correct
94 Correct 2 ms 6492 KB Output is correct
95 Correct 2 ms 6492 KB Output is correct
96 Correct 2 ms 6492 KB Output is correct
97 Correct 2 ms 6492 KB Output is correct
98 Correct 2 ms 6492 KB Output is correct
99 Correct 2 ms 6492 KB Output is correct
100 Correct 2 ms 6492 KB Output is correct
101 Correct 2 ms 6492 KB Output is correct
102 Correct 2 ms 6492 KB Output is correct
103 Correct 2 ms 6492 KB Output is correct
104 Correct 5 ms 6748 KB Output is correct
105 Correct 11 ms 7296 KB Output is correct
106 Correct 2 ms 6488 KB Output is correct
107 Correct 20 ms 8188 KB Output is correct
108 Correct 25 ms 8540 KB Output is correct
109 Correct 2 ms 6492 KB Output is correct
110 Correct 34 ms 9680 KB Output is correct
111 Correct 38 ms 9920 KB Output is correct
112 Correct 2 ms 6488 KB Output is correct
113 Correct 50 ms 10516 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 9680 KB Output is correct
2 Incorrect 40 ms 9676 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6388 KB Output is correct
5 Correct 2 ms 6332 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6488 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6528 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Incorrect 2 ms 6492 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 10344 KB Output is correct
2 Correct 35 ms 10352 KB Output is correct
3 Correct 25 ms 8936 KB Output is correct
4 Correct 7 ms 7012 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 10 ms 7436 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 19 ms 8336 KB Output is correct
9 Correct 24 ms 8540 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 34 ms 9604 KB Output is correct
12 Correct 38 ms 9924 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6388 KB Output is correct
18 Correct 2 ms 6332 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6528 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 38 ms 10396 KB Output is correct
40 Correct 37 ms 10348 KB Output is correct
41 Correct 26 ms 8932 KB Output is correct
42 Correct 8 ms 7256 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6492 KB Output is correct
45 Correct 2 ms 6492 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 2 ms 6492 KB Output is correct
48 Correct 2 ms 6492 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 46 ms 11568 KB Output is correct
58 Correct 45 ms 11468 KB Output is correct
59 Correct 47 ms 11384 KB Output is correct
60 Correct 49 ms 11132 KB Output is correct
61 Correct 47 ms 11416 KB Output is correct
62 Correct 54 ms 11216 KB Output is correct
63 Correct 42 ms 11304 KB Output is correct
64 Correct 46 ms 11268 KB Output is correct
65 Correct 44 ms 11072 KB Output is correct
66 Correct 46 ms 11124 KB Output is correct
67 Correct 47 ms 11236 KB Output is correct
68 Correct 46 ms 11380 KB Output is correct
69 Correct 49 ms 11204 KB Output is correct
70 Correct 47 ms 11148 KB Output is correct
71 Correct 2 ms 6488 KB Output is correct
72 Correct 3 ms 6492 KB Output is correct
73 Correct 3 ms 6492 KB Output is correct
74 Correct 3 ms 6492 KB Output is correct
75 Correct 3 ms 6492 KB Output is correct
76 Correct 3 ms 6492 KB Output is correct
77 Correct 3 ms 6612 KB Output is correct
78 Correct 3 ms 6492 KB Output is correct
79 Correct 3 ms 6488 KB Output is correct
80 Correct 57 ms 11336 KB Output is correct
81 Correct 59 ms 11680 KB Output is correct
82 Correct 47 ms 11164 KB Output is correct
83 Correct 47 ms 11340 KB Output is correct
84 Correct 2 ms 6492 KB Output is correct
85 Correct 2 ms 6492 KB Output is correct
86 Correct 2 ms 6492 KB Output is correct
87 Correct 3 ms 6492 KB Output is correct
88 Correct 3 ms 6492 KB Output is correct
89 Correct 2 ms 6664 KB Output is correct
90 Correct 3 ms 6488 KB Output is correct
91 Correct 3 ms 6492 KB Output is correct
92 Correct 3 ms 6492 KB Output is correct
93 Correct 2 ms 6492 KB Output is correct
94 Correct 2 ms 6492 KB Output is correct
95 Correct 2 ms 6492 KB Output is correct
96 Correct 2 ms 6492 KB Output is correct
97 Correct 2 ms 6492 KB Output is correct
98 Correct 2 ms 6492 KB Output is correct
99 Correct 2 ms 6492 KB Output is correct
100 Correct 2 ms 6492 KB Output is correct
101 Correct 2 ms 6492 KB Output is correct
102 Correct 2 ms 6492 KB Output is correct
103 Correct 2 ms 6492 KB Output is correct
104 Correct 5 ms 6748 KB Output is correct
105 Correct 11 ms 7296 KB Output is correct
106 Correct 2 ms 6488 KB Output is correct
107 Correct 20 ms 8188 KB Output is correct
108 Correct 25 ms 8540 KB Output is correct
109 Correct 2 ms 6492 KB Output is correct
110 Correct 34 ms 9680 KB Output is correct
111 Correct 38 ms 9920 KB Output is correct
112 Correct 2 ms 6488 KB Output is correct
113 Correct 50 ms 10516 KB Output is correct
114 Correct 37 ms 9680 KB Output is correct
115 Incorrect 40 ms 9676 KB Output isn't correct
116 Halted 0 ms 0 KB -