# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955758 | vjudge1 | Pinball (JOI14_pinball) | C++14 | 0 ms | 0 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()
{
long long n,m;
cin>>m>>n;
long long a[m],b[m],c[m],d[m];
set<long long> s;
for(long long i=0; i<m; i++)
{
cin>>a[i]>>b[i]>>c[i]>>d[i];
a[i]--;b[i]--;c[i]--;
for(long long k=a[i]; k<=b[i]; k++)s.insert(k);
}
if(s.size()!=n)
{
cout<<-1<<endl;
return 0;
}
long long res=long long_MAX;
long long last[n];
for(long long mask=0; mask<(1<<m); mask++)
{
long long cena=0;
memset(last,-1,sizeof(last));
for(long long i=0; i<m; i++)
{
if(mask&(1<<i))
{
for(long long k=a[i]; k<=b[i]; k++)last[k]=0;
last[c[i]]=-1;
cena+=d[i];
}
}
long long cnt=0;
for(long long i=0; i<n; i++)
{
if(last[i]==-1)cnt++;
}
if(cnt==1)res=min(res,cena);
}
if(res==long long_MAX)res=-1;
cout<<res<<endl;
return 0;
}