oj.uz

Submission #955878

# Submission time Handle Problem Language Result Execution time Memory
955878 2024-03-31T15:56:34 Z VMaksimoski008 Pinball (JOI14_pinball) C++14
51 / 100
 17 ms 2908 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

ll dpL[1005], dpR[1005];

int32_t main() {
    int n, m;
    cin >> n >> m;

    vector<array<int, 4> > v(n+2);
    set<int> s; s.insert(1); s.insert(m);

    for(int i=1; i<=n; i++) {
        cin >> v[i][0] >> v[i][1] >> v[i][2] >> v[i][3];
        s.insert(v[i][0]);
        s.insert(v[i][1]);
        s.insert(v[i][2]);
    }

    vector<int> comp(all(s));

    for(int i=1; i<=n; i++) {
        v[i][0] = lower_bound(all(comp), v[i][0]) - comp.begin();
        v[i][1] = lower_bound(all(comp), v[i][1]) - comp.begin();
        v[i][2] = lower_bound(all(comp), v[i][2]) - comp.begin();
    }

    ll ans = 1e18;

    for(int i=1; i<=n; i++) dpL[i] = dpR[i] = 1e18;

    auto check = [&](int i, int j) {
        return v[i][0] <= v[j][2] && v[j][2] <= v[i][1];
    };

    for(int i=1; i<=n; i++) {
        if(v[i][0] == 0) dpL[i] = v[i][3];
        if(v[i][1] == comp.size()-1) dpR[i] = v[i][3];

        for(int j=1; j<i; j++)
            if(dpL[j] != 1e18 && check(i, j)) dpL[i] = min(dpL[i], dpL[j] + v[i][3]);
        for(int j=1; j<i; j++)
            if(dpR[j] != 1e18 && check(i, j)) dpR[i] = min(dpR[i], dpR[j] + v[i][3]);

        ans = min(ans, dpL[i] + dpR[i] - v[i][3]);
    }

    cout << (ans == 1e18 ? -1 : ans) << '\n';
    return 0;
}

Compilation message

pinball.cpp: In function 'int32_t main()':
pinball.cpp:55:20: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         if(v[i][1] == comp.size()-1) dpR[i] = v[i][3];

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 5 ms 604 KB Output is correct
20 Correct 7 ms 604 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 4 ms 628 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 4 ms 604 KB Output is correct
25 Runtime error 17 ms 2908 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -