oj.uz

Submission #492549

# Submission time Handle Problem Language Result Execution time Memory
492549 2021-12-07T20:57:10 Z Alex_tz307 Treatment Project (JOI20_treatment) C++17
100 / 100
 211 ms 14068 KB 
#include <bits/stdc++.h>

using namespace std;

const int kM = 1e5;
const int INF = 2e9 + 1;
const pair<int, int> pINF = {INF, INF};
const int64_t INFL = 1e18L;
int t[1 + kM], tt[1 + kM], l[1 + kM], r[1 + kM], c[1 + kM];
pair<int, int> a[1 + kM];
int64_t dp[1 + kM];

struct ST {
  int n;
  vector<pair<int, int>> t;

  ST(int N) : n(N) {
    int dim = 1;
    while (dim < n) {
      dim <<= 1;
    }
    t.resize(dim << 1, pINF);
  }

  void update(int x, int lx, int rx, int pos, pair<int, int> v) {
    if (lx == rx) {
      t[x] = v;
      return;
    }
    int mid = (lx + rx) >> 1;
    if (pos <= mid) {
      update(x << 1, lx, mid, pos, v);
    } else {
      update(x << 1 | 1, mid + 1, rx, pos, v);
    }
    t[x] = min(t[x << 1], t[x << 1 | 1]);
  }

  void update(int pos, pair<int, int> v) {
    update(1, 1, n, pos, v);
  }

  pair<int, int> query(int x, int lx, int rx, int st, int dr) {
    if (st <= lx && rx <= dr) {
      return t[x];
    }
    int mid = (lx + rx) >> 1;
    pair<int, int> ans1 = pINF, ans2 = pINF;
    if (st <= mid) {
      ans1 = query(x << 1, lx, mid, st, dr);
    }
    if (mid + 1 <= dr) {
      ans2 = query(x << 1 | 1, mid + 1, rx, st, dr);
    }
    return min(ans1, ans2);
  }

  pair<int, int> query(int st, int dr) {
    return query(1, 1, n, st, dr);
  }
};

void testCase() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    cin >> t[i] >> l[i] >> r[i] >> c[i];
    ++r[i];
    a[i] = make_pair(t[i], i);
  }
  sort(a + 1, a + m + 1);
  for (int i = 1; i <= m; ++i) {
    tt[a[i].second] = i;
  }
  priority_queue<pair<int64_t, int>, vector<pair<int64_t, int>>, greater<pair<int64_t, int>>> pq;
  ST t1(m), t2(m);
  for (int i = 1; i <= m; ++i) {
    dp[i] = INFL;
    if (l[i] == 1) {
      dp[i] = c[i];
      pq.emplace(dp[i], i);
    } else {
      t1.update(tt[i], {l[i] - t[i], i});
      t2.update(tt[i], {l[i] + t[i], i});
    }
  }
  while (!pq.empty()) {
    int u = pq.top().second;
    pq.pop();
    int v = t1.query(1, tt[u]).second;
    while (v != INF && l[v] - t[v] <= r[u] - t[u]) {
      t1.update(tt[v], pINF);
      t2.update(tt[v], pINF);
      pq.emplace(dp[v] = dp[u] + c[v], v);
      v = t1.query(1, tt[u]).second;
    }
    v = t2.query(tt[u], m).second;
    while (v != INF && l[v] + t[v] <= r[u] + t[u]) {
      t1.update(tt[v], pINF);
      t2.update(tt[v], pINF);
      pq.emplace(dp[v] = dp[u] + c[v], v);
      v = t2.query(tt[u], m).second;
    }
  }
  int64_t ans = INFL;
  for (int i = 1; i <= m; ++i) {
    if (r[i] == n + 1) {
      ans = min(ans, dp[i]);
    }
  }
  if (ans == INFL) {
    cout << "-1\n";
  } else {
    cout << ans << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 7900 KB Output is correct
2 Correct 111 ms 11148 KB Output is correct
3 Correct 155 ms 11384 KB Output is correct
4 Correct 148 ms 10656 KB Output is correct
5 Correct 150 ms 13200 KB Output is correct
6 Correct 159 ms 11284 KB Output is correct
7 Correct 123 ms 10996 KB Output is correct
8 Correct 54 ms 10948 KB Output is correct
9 Correct 56 ms 10944 KB Output is correct
10 Correct 53 ms 10948 KB Output is correct
11 Correct 200 ms 13240 KB Output is correct
12 Correct 188 ms 13240 KB Output is correct
13 Correct 211 ms 13140 KB Output is correct
14 Correct 190 ms 13128 KB Output is correct
15 Correct 178 ms 11100 KB Output is correct
16 Correct 197 ms 10976 KB Output is correct
17 Correct 185 ms 10292 KB Output is correct
18 Correct 153 ms 12476 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 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 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 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 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 6 ms 968 KB Output is correct
21 Correct 6 ms 972 KB Output is correct
22 Correct 7 ms 972 KB Output is correct
23 Correct 9 ms 848 KB Output is correct
24 Correct 8 ms 1100 KB Output is correct
25 Correct 8 ms 972 KB Output is correct
26 Correct 8 ms 972 KB Output is correct
27 Correct 7 ms 940 KB Output is correct
28 Correct 7 ms 1100 KB Output is correct
29 Correct 6 ms 972 KB Output is correct
30 Correct 4 ms 972 KB Output is correct
31 Correct 4 ms 972 KB Output is correct
32 Correct 9 ms 1100 KB Output is correct
33 Correct 7 ms 1100 KB Output is correct
34 Correct 8 ms 972 KB Output is correct
35 Correct 7 ms 1100 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 8 ms 844 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 7900 KB Output is correct
2 Correct 111 ms 11148 KB Output is correct
3 Correct 155 ms 11384 KB Output is correct
4 Correct 148 ms 10656 KB Output is correct
5 Correct 150 ms 13200 KB Output is correct
6 Correct 159 ms 11284 KB Output is correct
7 Correct 123 ms 10996 KB Output is correct
8 Correct 54 ms 10948 KB Output is correct
9 Correct 56 ms 10944 KB Output is correct
10 Correct 53 ms 10948 KB Output is correct
11 Correct 200 ms 13240 KB Output is correct
12 Correct 188 ms 13240 KB Output is correct
13 Correct 211 ms 13140 KB Output is correct
14 Correct 190 ms 13128 KB Output is correct
15 Correct 178 ms 11100 KB Output is correct
16 Correct 197 ms 10976 KB Output is correct
17 Correct 185 ms 10292 KB Output is correct
18 Correct 153 ms 12476 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 6 ms 968 KB Output is correct
39 Correct 6 ms 972 KB Output is correct
40 Correct 7 ms 972 KB Output is correct
41 Correct 9 ms 848 KB Output is correct
42 Correct 8 ms 1100 KB Output is correct
43 Correct 8 ms 972 KB Output is correct
44 Correct 8 ms 972 KB Output is correct
45 Correct 7 ms 940 KB Output is correct
46 Correct 7 ms 1100 KB Output is correct
47 Correct 6 ms 972 KB Output is correct
48 Correct 4 ms 972 KB Output is correct
49 Correct 4 ms 972 KB Output is correct
50 Correct 9 ms 1100 KB Output is correct
51 Correct 7 ms 1100 KB Output is correct
52 Correct 8 ms 972 KB Output is correct
53 Correct 7 ms 1100 KB Output is correct
54 Correct 8 ms 1228 KB Output is correct
55 Correct 8 ms 844 KB Output is correct
56 Correct 152 ms 11492 KB Output is correct
57 Correct 159 ms 12012 KB Output is correct
58 Correct 152 ms 10268 KB Output is correct
59 Correct 174 ms 10604 KB Output is correct
60 Correct 166 ms 11440 KB Output is correct
61 Correct 147 ms 10256 KB Output is correct
62 Correct 154 ms 11608 KB Output is correct
63 Correct 133 ms 11240 KB Output is correct
64 Correct 131 ms 11036 KB Output is correct
65 Correct 187 ms 11300 KB Output is correct
66 Correct 144 ms 11344 KB Output is correct
67 Correct 171 ms 11972 KB Output is correct
68 Correct 164 ms 11824 KB Output is correct
69 Correct 161 ms 11824 KB Output is correct
70 Correct 189 ms 12032 KB Output is correct
71 Correct 167 ms 11752 KB Output is correct
72 Correct 159 ms 11716 KB Output is correct
73 Correct 182 ms 11948 KB Output is correct
74 Correct 72 ms 11732 KB Output is correct
75 Correct 72 ms 11836 KB Output is correct
76 Correct 205 ms 13672 KB Output is correct
77 Correct 180 ms 13988 KB Output is correct
78 Correct 207 ms 13624 KB Output is correct
79 Correct 182 ms 11764 KB Output is correct
80 Correct 184 ms 11424 KB Output is correct
81 Correct 90 ms 11776 KB Output is correct
82 Correct 204 ms 10948 KB Output is correct
83 Correct 209 ms 11068 KB Output is correct
84 Correct 200 ms 11084 KB Output is correct
85 Correct 149 ms 11716 KB Output is correct
86 Correct 150 ms 11820 KB Output is correct
87 Correct 161 ms 11768 KB Output is correct
88 Correct 176 ms 11876 KB Output is correct
89 Correct 161 ms 11788 KB Output is correct
90 Correct 180 ms 13964 KB Output is correct
91 Correct 176 ms 12896 KB Output is correct
92 Correct 158 ms 11840 KB Output is correct
93 Correct 188 ms 11836 KB Output is correct
94 Correct 199 ms 12040 KB Output is correct
95 Correct 185 ms 11792 KB Output is correct
96 Correct 197 ms 14068 KB Output is correct
97 Correct 193 ms 13948 KB Output is correct
98 Correct 184 ms 13960 KB Output is correct
99 Correct 185 ms 13928 KB Output is correct
100 Correct 181 ms 13952 KB Output is correct
101 Correct 197 ms 13972 KB Output is correct
102 Correct 176 ms 13932 KB Output is correct
103 Correct 144 ms 12196 KB Output is correct