| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 955754 | vjudge1 | Pinball (JOI14_pinball) | C++14 | 1 ms | 348 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    cin>>m>>n;
    int a[m],b[m],c[m],d[m];
    set<int> s;
    for(int i=0; i<m; i++)
    {
        cin>>a[i]>>b[i]>>c[i]>>d[i];
        a[i]--;b[i]--;c[i]--;
        for(int k=a[i]; k<=b[i]; k++)s.insert(k);
    }
    if(s.size()!=n)
    {
        cout<<-1<<endl;
        return 0;
    }
    int res=INT_MAX;
    int last[n];
    for(int mask=0; mask<(1<<m); mask++)
    {
        int cena=0;
        memset(last,-1,sizeof(last));
        for(int i=0; i<m; i++)
        {
            if(mask&(1<<i))
            {
                for(int k=a[i]; k<=b[i]; k++)last[k]=0;
                last[c[i]]=-1;
                cena+=d[i];
            }
        }
        int cnt=0;
        for(int i=0; i<n; i++)
        {
            if(last[i]==-1)cnt++;
        }
        if(cnt==1)res=min(res,cena);
    }
    if(res==INT_MAX)res=-1;
    cout<<res<<endl;
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
