oj.uz

Submission #955777

# Submission time Handle Problem Language Result Execution time Memory
955777 2024-03-31T12:10:54 Z vjudge1 Pinball (JOI14_pinball) C++17
11 / 100
 13 ms 25180 KB 
#include <bits/stdc++.h>

using namespace std;
vector<tuple<long long,long long,long long,long long> > v;
long long n,m;
bool visited[205][605][605];
long long dp[205][605][605];
bool gotovo=false;

long long f(long long poz,long long l,long long r)
{
    //cout<< "poz = "<<poz<<" l="<<l<<" r="<<r<<endl;
    if (poz==-1)
    {
        if (l==1 && r==n)
        {
            gotovo=true;
            return 0;
        }
        return 1000000000000000;
    }
    if (visited[poz][l][r]) return dp[poz][l][r];

    long long op1=f(poz-1,l,r);
    long long op2=1000000000000000;

    long long a=get<0>(v[poz]),b=get<1>(v[poz]),c=get<2>(v[poz]);
    if (c>=l && c<=r) op2=f(poz-1,min(a,l),max(b,r))+get<3>(v[poz]);

    long long odg=min(op1,op2);
    visited[poz][l][r]=true;
    dp[poz][l][r]=odg;
    return odg;
}

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

    for (long long i=0;i<m;i++)
    {
        long long a,b,c,d;
        cin>>a>>b>>c>>d;
        v.push_back({a,b,c,d});
    }

    long long odg=1000000000000000;
    for (long long i=m-1;i>=0;i--)
        odg = min(odg,get<3>(v[i])+f(i-1,get<0>(v[i]),get<1>(v[i])));

    if (gotovo==false) odg=-1;
    cout<<odg<<endl;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 12760 KB Output is correct
3 Correct 4 ms 20988 KB Output is correct
4 Correct 3 ms 25176 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 3 ms 20828 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 12760 KB Output is correct
3 Correct 4 ms 20988 KB Output is correct
4 Correct 3 ms 25176 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 3 ms 20828 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Runtime error 13 ms 344 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 12760 KB Output is correct
3 Correct 4 ms 20988 KB Output is correct
4 Correct 3 ms 25176 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 3 ms 20828 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Runtime error 13 ms 344 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 12760 KB Output is correct
3 Correct 4 ms 20988 KB Output is correct
4 Correct 3 ms 25176 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 3 ms 20828 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Runtime error 13 ms 344 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -