oj.uz

Submission #52527

# Submission time Handle Problem Language Result Execution time Memory
52527 2018-06-26T06:40:39 Z 노영훈(#1364) Pinball (JOI14_pinball) C++11
11 / 100
 3 ms 576 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=100010, inf=2e9;

int n, m;

struct slide {
    int s, e, o, c;
} S[MX];
ll ans=2e17;
void solve(int idx=m, int l=inf, int r=-inf, ll sum=0){
    if(idx==0){
        if(l==1 && r==n)
            ans=min(ans, sum);
        return;
    }
    solve(idx-1, l, r, sum);
    int s=S[idx].s, e=S[idx].e;
    if(l==inf || (l<=S[idx].o && S[idx].o<=r))
        solve(idx-1, min(s,l), max(e,r), sum+S[idx].c);
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>m>>n;
    for(int i=1; i<=m; i++){
        int s, e, o, c;
        cin>>s>>e>>o>>c;
        S[i]={s,e,o,c};
    }
    if(m>10) return 0;

    solve();
    if(ans==2e17) ans=-1;
    cout<<ans;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 3 ms 576 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Incorrect 2 ms 576 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Incorrect 2 ms 576 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Incorrect 2 ms 576 KB Output isn't correct
10 Halted 0 ms 0 KB -