oj.uz

답안 #422800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422800 2021-06-10T12:35:45 Z SSRS Sky Walking (IOI19_walk) C++14
39 / 100
 4000 ms 490828 KB 
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
struct segment_tree{
  int N;
  vector<long long> ST;
  segment_tree(int N2){
    N = 1;
    while (N < N2){
      N *= 2;
    }
    ST = vector<long long>(N * 2 - 1, INF);
  }
  void update(int i, long long x){
    i += N - 1;
    ST[i] = x;
    while (i > 0){
      i = (i - 1) / 2;
      ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
  }
  long long range_min(int L, int R, int i, int l, int r){
    if (r <= L || R <= l){
      return INF;
    } else if (L <= l && r <= R){
      return ST[i];
    } else {
      int m = (l + r) / 2;
      return min(range_min(L, R, i * 2 + 1, l, m), range_min(L, R, i * 2 + 2, m, r));
    }
  }
  long long range_min(int L, int R){
    return range_min(L, R, 0, 0, N);
  }
};
long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g){
  int n = x.size();
  int m = y.size();
  bool subtask4 = true;
  if (s != 0){
    subtask4 = false;
  }
  if (g != n - 1){
    subtask4 = false;
  }
  for (int i = 0; i < n; i++){
    if (h[i] != h[0]){
      subtask4 = false;
    }
  }
  if (!subtask4){
    vector<tuple<int, int, int>> T;
    for (int i = 0; i < n; i++){
      T.push_back(make_tuple(h[i], 1, i));
    }
    for (int i = 0; i < m; i++){
      T.push_back(make_tuple(y[i], 0, i));
    }
    sort(T.begin(), T.end(), greater<tuple<int, int, int>>());
    vector<vector<int>> id(m);
    set<int> st;
    for (int i = 0; i < n + m; i++){
      int t = get<1>(T[i]);
      int p = get<2>(T[i]);
      if (t == 0){
        auto itr = st.lower_bound(l[p]);
        while (true){
          id[p].push_back(*itr);
          if (*itr == r[p]){
            break;
          }
          itr++;
        }
      }
      if (t == 1){
        st.insert(p);
      }
    }
    vector<vector<int>> h2(n);
    for (int i = 0; i < n; i++){
      h2[i].push_back(0);
    }
    for (int i = 0; i < m; i++){
      for (int j : id[i]){
        h2[j].push_back(y[i]);
      }
    }
    for (int i = 0; i < n; i++){
      sort(h2[i].begin(), h2[i].end());
      h2[i].erase(unique(h2[i].begin(), h2[i].end()), h2[i].end());
    }
    int V = 0;
    vector<vector<int>> id2(n);
    for (int i = 0; i < n; i++){
      int cnt = h2[i].size();
      id2[i] = vector<int>(cnt);
      for (int j = 0; j < cnt; j++){
        id2[i][j] = V;
        V++;
      }
    }
    vector<vector<pair<int, int>>> E(V);
    for (int i = 0; i < n; i++){
      int cnt = h2[i].size();
      for (int j = 0; j < cnt - 1; j++){
        int v = id2[i][j];
        int w = id2[i][j + 1];
        int d = h2[i][j + 1] - h2[i][j];
        E[v].push_back(make_pair(d, w));
        E[w].push_back(make_pair(d, v));
      }
    }
    for (int i = 0; i < m; i++){
      int cnt = id[i].size();
      vector<int> t(cnt);
      for (int j = 0; j < cnt; j++){
        int p = lower_bound(h2[id[i][j]].begin(), h2[id[i][j]].end(), y[i]) - h2[id[i][j]].begin();
        t[j] = id2[id[i][j]][p];
      }
      for (int j = 0; j < cnt - 1; j++){
        int v = t[j];
        int w = t[j + 1];
        int d = x[id[i][j + 1]] - x[id[i][j]];
        E[v].push_back(make_pair(d, w));
        E[w].push_back(make_pair(d, v));
      }
    }
    int s2 = id2[s][0];
    int g2 = id2[g][0];
    vector<long long> d(V, -1);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    pq.push(make_pair(0, s2));
    while (!pq.empty()){
      long long dd = pq.top().first;
      int v = pq.top().second;
      pq.pop();
      if (d[v] == -1){
        d[v] = dd;
        for (auto P : E[v]){
          int w = P.second;
          if (d[w] == -1){
            pq.push(make_pair(dd + P.first, w));
          }
        }
      }
    }
    return d[g2];
  } else {
    vector<pair<int, int>> P(m);
    for (int i = 0; i < m; i++){
      P[i] = make_pair(y[i], i);
    }
    sort(P.begin(), P.end());
    vector<int> pos(m);
    for (int i = 0; i < m; i++){
      pos[i] = lower_bound(P.begin(), P.end(), make_pair(y[i], i)) - P.begin();
    }
    vector<vector<int>> add(n), sub(n);
    for (int i = 0; i < m; i++){
      add[l[i]].push_back(i);
      sub[r[i]].push_back(i);
    }
    segment_tree ST1(m), ST2(m);
    for (int i : add[0]){
      ST1.update(pos[i], y[i] * 2);
      ST2.update(pos[i], 0);
    }
    for (int i = 1; i < n - 1; i++){
      for (int j : add[i]){
        long long mn1 = ST1.range_min(pos[j], m);
        long long mn2 = ST2.range_min(0, pos[j]);
        long long dp = min(mn1 - y[j], mn2 + y[j]);
        ST1.update(pos[j], dp + y[j]);
        ST2.update(pos[j], dp - y[j]);
      }
      for (int j : sub[i]){
        ST1.update(pos[j], INF);
        ST2.update(pos[j], INF);
      }
    }
    long long ans = ST1.range_min(0, m);
    ans += x[n - 1] - x[0];
    if (ans > INF / 2){
      return -1;
    } else {
      return ans;
    }
  }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1025 ms 81800 KB Output is correct
4 Correct 1058 ms 101300 KB Output is correct
5 Correct 662 ms 89272 KB Output is correct
6 Correct 608 ms 81336 KB Output is correct
7 Correct 683 ms 89272 KB Output is correct
8 Correct 1335 ms 102596 KB Output is correct
9 Correct 796 ms 86696 KB Output is correct
10 Correct 1481 ms 132960 KB Output is correct
11 Correct 556 ms 52040 KB Output is correct
12 Correct 463 ms 50488 KB Output is correct
13 Correct 1308 ms 119220 KB Output is correct
14 Correct 393 ms 48004 KB Output is correct
15 Correct 396 ms 51208 KB Output is correct
16 Correct 409 ms 49460 KB Output is correct
17 Correct 367 ms 47908 KB Output is correct
18 Correct 403 ms 53700 KB Output is correct
19 Correct 9 ms 2576 KB Output is correct
20 Correct 99 ms 23512 KB Output is correct
21 Correct 323 ms 43912 KB Output is correct
22 Correct 370 ms 51128 KB Output is correct
23 Correct 484 ms 59176 KB Output is correct
24 Correct 379 ms 49464 KB Output is correct
25 Correct 345 ms 47156 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 5676 KB Output is correct
2 Correct 172 ms 9164 KB Output is correct
3 Correct 175 ms 10196 KB Output is correct
4 Correct 272 ms 18132 KB Output is correct
5 Correct 219 ms 16692 KB Output is correct
6 Correct 217 ms 17860 KB Output is correct
7 Correct 123 ms 13184 KB Output is correct
8 Correct 233 ms 20548 KB Output is correct
9 Correct 214 ms 18980 KB Output is correct
10 Correct 168 ms 17732 KB Output is correct
11 Correct 14 ms 3384 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 5676 KB Output is correct
2 Correct 172 ms 9164 KB Output is correct
3 Correct 175 ms 10196 KB Output is correct
4 Correct 272 ms 18132 KB Output is correct
5 Correct 219 ms 16692 KB Output is correct
6 Correct 217 ms 17860 KB Output is correct
7 Correct 123 ms 13184 KB Output is correct
8 Correct 233 ms 20548 KB Output is correct
9 Correct 214 ms 18980 KB Output is correct
10 Correct 168 ms 17732 KB Output is correct
11 Correct 14 ms 3384 KB Output is correct
12 Execution timed out 4091 ms 490828 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1025 ms 81800 KB Output is correct
21 Correct 1058 ms 101300 KB Output is correct
22 Correct 662 ms 89272 KB Output is correct
23 Correct 608 ms 81336 KB Output is correct
24 Correct 683 ms 89272 KB Output is correct
25 Correct 1335 ms 102596 KB Output is correct
26 Correct 796 ms 86696 KB Output is correct
27 Correct 1481 ms 132960 KB Output is correct
28 Correct 556 ms 52040 KB Output is correct
29 Correct 463 ms 50488 KB Output is correct
30 Correct 1308 ms 119220 KB Output is correct
31 Correct 393 ms 48004 KB Output is correct
32 Correct 396 ms 51208 KB Output is correct
33 Correct 409 ms 49460 KB Output is correct
34 Correct 367 ms 47908 KB Output is correct
35 Correct 403 ms 53700 KB Output is correct
36 Correct 9 ms 2576 KB Output is correct
37 Correct 99 ms 23512 KB Output is correct
38 Correct 323 ms 43912 KB Output is correct
39 Correct 370 ms 51128 KB Output is correct
40 Correct 484 ms 59176 KB Output is correct
41 Correct 379 ms 49464 KB Output is correct
42 Correct 345 ms 47156 KB Output is correct
43 Correct 69 ms 5676 KB Output is correct
44 Correct 172 ms 9164 KB Output is correct
45 Correct 175 ms 10196 KB Output is correct
46 Correct 272 ms 18132 KB Output is correct
47 Correct 219 ms 16692 KB Output is correct
48 Correct 217 ms 17860 KB Output is correct
49 Correct 123 ms 13184 KB Output is correct
50 Correct 233 ms 20548 KB Output is correct
51 Correct 214 ms 18980 KB Output is correct
52 Correct 168 ms 17732 KB Output is correct
53 Correct 14 ms 3384 KB Output is correct
54 Execution timed out 4091 ms 490828 KB Time limit exceeded
55 Halted 0 ms 0 KB -