oj.uz

Submission #755976

# Submission time Handle Problem Language Result Execution time Memory
755976 2023-06-10T18:59:10 Z MohamedFaresNebili Pinball (JOI14_pinball) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

        using namespace std;

        int M, N;
        array<int, 4> A[100005];

        int32_t main() {
            ios_base::sync_with_stdio(0);
            cin.tie(0); cout.tie(0);
            cin >> M >> N;
            for(int l = 0; l < M; l++) {
                cin >> A[l][0] >> A[l][1] >> A[l][2] >> A[l][3];
            }
            vector<int> L(M, 1e9 + 7);
            vector<int> R(M, 1e9 + 7);
            for(int l = 0; l < M; l++) {
                if(A[l][0] == 1)
                    L[l] = A[l][3];
                else {
                    for(int i = 0; i < l; i++) {
                        if(A[i][2] >= A[l][0] && A[i][2] <= A[l][1]) {
                            L[l] = min(L[l], L[i] + A[l][3]);
                        }
                    }
                }
                if(A[l][1] == N)
                    R[l] = A[l][3];
                else {
                    for(int i = 0; i < l; i++) {
                        if(A[i][2] >= A[l][0] && A[i][2] <= A[l][1]) {
                            R[l] = min(R[l], R[i] + A[l][3]);
                        }
                    }
                }
            }
            int res = 1e9 + 7;
            for(int l = 0; l < M; l++)
                res = min(res, L[l] + R[l] - A[l][3]);
            cout << (res == 1e9 + 7 ? -1 : res) << "\n";
        }

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -