oj.uz

Submission #258689

# Submission time Handle Problem Language Result Execution time Memory
258689 2020-08-06T11:26:34 Z fedoseevtimofey Pinball (JOI14_pinball) C++14
51 / 100
 1000 ms 2048 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> a(n), b(n), c(n), d(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i] >> b[i] >> c[i] >> d[i];
  }
  vector <ll> dpL(n, Inf), dpR(n, Inf);
  for (int i = 0; i < n; ++i) {
    if (a[i] == 1) {
      dpL[i] = d[i];
    }
    for (int j = i - 1; j >= 0; --j) {
      if (a[i] <= c[j] && c[j] <= b[i]) {
        dpL[i] = min(dpL[i], dpL[j] + d[i]);
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    if (b[i] == m) {
      dpR[i] = d[i];
    }
    for (int j = i - 1; j >= 0; --j) {
      if (a[i] <= c[j] && c[j] <= b[i]) {
        dpR[i] = min(dpR[i], dpR[j] + d[i]);
      }
    }
  }
  
  ll ans = Inf;
  for (int i = 0; i < n; ++i) {
    ll costL = Inf, costR = Inf;
    for (int j = i - 1; j >= 0; --j) {
      if (a[i] <= c[j] && c[j] <= b[i]) {
        costL = min(costL, dpL[j]);
        costR = min(costR, dpR[j]);
      }
    }
    if (a[i] == 1) costL = 0;
    if (b[i] == m) costR = 0;
    ans = min(ans, costL + costR + d[i]);
  }   
  if (ans != Inf) cout << ans << '\n';
  else cout << "-1\n";
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 9 ms 384 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Correct 9 ms 384 KB Output is correct
20 Correct 9 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 802 ms 1000 KB Output is correct
26 Execution timed out 1066 ms 2048 KB Time limit exceeded
27 Halted 0 ms 0 KB -