oj.uz

답안 #220262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
220262 2020-04-07T13:02:33 Z fedoseevtimofey 치료 계획 (JOI20_treatment) C++14
35 / 100
 2182 ms 524292 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
 
using namespace std;
 
typedef long long ll;
 
const ll Inf = 1e18;
 
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n, m;
  cin >> n >> m;
  vector <int> t(m + 1), l(m + 1), r(m + 1), c(m + 2);
  for (int i = 1; i <= m; ++i) {
    cin >> t[i] >> l[i] >> r[i] >> c[i];
    --l[i];
  }
  vector <vector <int>> g(m + 2);
  for (int i = 1; i <= m; ++i) {
    if (l[i] == 0) {
      g[0].push_back(i);
    }
    if (r[i] == n) {
      g[i].push_back(m + 1);
    }
  }
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (i == j) continue;
      int tm = abs(t[i] - t[j]);
      if (r[i] - tm >= l[j]) {
        g[i].push_back(j);
      }
    }
  } 
  vector <ll> d(m + 2, Inf);
  d[0] = 0;
  vector <int> used(m + 2);
  while (true) {
    int id = -1;
    for (int u = 0; u < m + 2; ++u) {
      if (!used[u] && (id == -1 || d[u] < d[id])) {
        id = u;
      }
    }
    if (id == -1) break;
    used[id] = 1;
    if (d[id] != Inf) {
      d[id] += c[id];
      for (auto v : g[id]) {
        if (d[v] > d[id]) {
          d[v] = d[id];
        }
      }
    }
  }
  if (d[m + 1] == Inf) {
    cout << "-1\n";
  } else {
    cout << d[m + 1] << '\n';
  }
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2182 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 307 ms 68472 KB Output is correct
21 Correct 303 ms 68216 KB Output is correct
22 Correct 154 ms 1912 KB Output is correct
23 Correct 151 ms 1912 KB Output is correct
24 Correct 228 ms 50452 KB Output is correct
25 Correct 193 ms 35384 KB Output is correct
26 Correct 179 ms 33784 KB Output is correct
27 Correct 191 ms 40696 KB Output is correct
28 Correct 232 ms 50296 KB Output is correct
29 Correct 187 ms 34936 KB Output is correct
30 Correct 181 ms 38516 KB Output is correct
31 Correct 181 ms 41416 KB Output is correct
32 Correct 318 ms 64532 KB Output is correct
33 Correct 306 ms 102264 KB Output is correct
34 Correct 291 ms 64120 KB Output is correct
35 Correct 323 ms 65144 KB Output is correct
36 Correct 301 ms 101624 KB Output is correct
37 Correct 293 ms 64120 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2182 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -