oj.uz

답안 #508737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
508737 2022-01-13T16:50:56 Z Jeff12345121 Pinball (JOI14_pinball) C++14
11 / 100
 222 ms 524292 KB 
#include <bits/stdc++.h>
#define in cin
#define out cout
#define ll long long
using namespace std;

//ifstream in("in.in");
//ofstream out("out.out");

struct device {
    int l, r, hole, cost;
};
vector<device> devices, sortDevices;
const int nmax = 605;
const ll inf = (1LL << 60);
int n, m;
ll dp[205][nmax][nmax];
void minSelf(ll &a, ll b) {
    if (b < a) {
        a = b;
    }
}
set<int> positions;
unordered_map<int, int> realToNorm, normToReal;
int32_t main() {
    in >> n >> m;
    if (m == 1) {
        out << "0\n";
        return 0;
    }
    devices.resize(n + 1);
    sortDevices.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        int l, r, hole, cost;
        in >> l >> r >> hole >> cost;
        devices[i] = {l, r, hole, cost};
        sortDevices[i] = {l, r, hole, cost};
        positions.insert(l);
        positions.insert(r);
        positions.insert(hole);
    }

    sort(sortDevices.begin() + 1, sortDevices.end(), [&](device x, device y) {
        return x.l < y.l;
    });
    int r = 1;
    for (int i = 1; i <= n; i++) {
        if (sortDevices[i].l > r) {
            out << "-1\n";
            return 0;
        }
        r = max(r, sortDevices[i].r);
    }
    if (r < m) {
        out << "-1\n";
        return 0;
    }

    int nr = 0;
    for (auto k : positions) {
        nr++;
        realToNorm[k] = nr;
        normToReal[nr] = k;
    }

    for (int i = 1; i <= n; i++) {
        devices[i].l = realToNorm[devices[i].l];
        devices[i].r = realToNorm[devices[i].r];
        devices[i].hole = realToNorm[devices[i].hole];
    }
    m = nr;

    /// dp[i][l][r] = using only devices i...n, we have extended the road for the interval
    /// l - r. sum will be in dp[1][1..m]
    for (int i = 0; i <= n + 1; i++) {
        for (int l = 0; l <= m; l++) {
            for (int r = 0; r <= m; r++) {
                dp[i][l][r] = inf;
            }
        }
    }
    for (int i = m; i >= 1; i--) {
        dp[n + 1][i][i] = 0;
    }
    for (int i = n; i >= 1; i--) {
        for (int l = 1; l <= m; l++) {
            for (int r = l; r <= m; r++) {
                minSelf(dp[i][l][r], dp[i + 1][l][r]);
                if (dp[i + 1][l][r] == inf) continue;

                if (l <= devices[i].hole && devices[i].hole <= r) {
                    int newL = min(l, devices[i].l);
                    int newR = max(r, devices[i].r);
                    minSelf(dp[i][newL][newR], dp[i + 1][l][r] + devices[i].cost);
                    minSelf(dp[i][l][r], dp[i + 1][l][r]);
                }
            }
        }
    }
    if (dp[1][1][m] == inf) {
        out << "-1\n";
    } else {
        out << dp[1][1][m] << "\n";
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 536 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1584 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 844 KB Output is correct

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 536 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1584 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 28 ms 75716 KB Output is correct
10 Correct 85 ms 192436 KB Output is correct
11 Correct 119 ms 256588 KB Output is correct
12 Runtime error 222 ms 524292 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 536 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1584 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 28 ms 75716 KB Output is correct
10 Correct 85 ms 192436 KB Output is correct
11 Correct 119 ms 256588 KB Output is correct
12 Runtime error 222 ms 524292 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 536 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1584 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 28 ms 75716 KB Output is correct
10 Correct 85 ms 192436 KB Output is correct
11 Correct 119 ms 256588 KB Output is correct
12 Runtime error 222 ms 524292 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -