oj.uz

답안 #584523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584523 2022-06-27T13:54:34 Z drdilyor Pinball (JOI14_pinball) C++17
51 / 100
 1000 ms 1108 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define sz(a) ((int) (a).size())
#define cut(s) {cout << s << '\n'; return 0;}

using namespace std;
using ll = long long;
using vi = vector<int>;
namespace pd = __gnu_pbds;
template<typename K> using ordered_set = pd::tree<K, pd::null_type, less<K>, pd::rb_tree_tag, pd::tree_order_statistics_node_update>;
template<typename... T> using hash_table = pd::gp_hash_table<T...>;

const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);
const int INF = 1e9;
const ll INFL = 1e18;
const int N = 1000;
const int M = 10;

struct device {
    int left, right, center, cost;
};
ostream& operator <<(ostream& os, device& a) {
    return os << "{" << a.left << "," << a.right << ", " << a.center << " $" << a.cost << "}";
}

int solve() {
    int n, m;
    cin >> m >> n;
    vector<device> dev(m);

    for (int i = 0; i < m; i++) {
        cin >> dev[i].left >> dev[i].right >> dev[i].center >> dev[i].cost;
        dev[i].left--; dev[i].right--; dev[i].center--;
    }

    vector<ll> memoLeft(m), memoRight(m);

    function<ll(int)> dpLeft = [&](int i) {
        if (dev[i].left == 0) return (ll)dev[i].cost;
        if (memoLeft[i]) return memoLeft[i];
        ll res = INFL;
        for (int j = 0; j < i; j++) {
            int a = dev[i].left, b = dev[j].center, c = dev[i].right;
            if (a <= b && b <= c) res = min(res, dpLeft(j));
        }
        res += dev[i].cost;
        return memoLeft[i] = res;
    };

    function<ll(int)> dpRight = [&](int i) {
        if (dev[i].right == n-1) return (ll)dev[i].cost;
        if (memoRight[i]) return memoRight[i];
        ll res = INFL;
        for (int j = 0; j < i; j++) {
            int a = dev[i].left, b = dev[j].center, c = dev[i].right;
            if (a <= b && b <= c) res = min(res, dpRight(j));
        }
        res += dev[i].cost;
        return memoRight[i] = res;
    };

    ll res = INFL;
    for (int i = 0; i < m; i++) {
        ll l = dpLeft(i), r = dpRight(i);
        if (l < INFL && r < INFL)
            res = min(res, l + r - dev[i].cost);
    }
    cout << (res >= INFL ? -1 : res);

    return 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    //cin >> t;
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 7 ms 340 KB Output is correct
20 Correct 8 ms 360 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 7 ms 340 KB Output is correct
20 Correct 8 ms 360 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 669 ms 596 KB Output is correct
26 Execution timed out 1095 ms 1108 KB Time limit exceeded
27 Halted 0 ms 0 KB -