Submission #1071030

#TimeUsernameProblemLanguageResultExecution timeMemory
107103012345678Arranging Tickets (JOI17_arranging_tickets)C++17
10 / 100
178 ms604 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=22;

int n, m, cnt[nx], l[nx], r[nx], a, b, c, res=INT_MAX;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=0; i<m; i++) cin>>a>>b>>c, l[i]=min(a, b), r[i]=max(a, b)-1;
    for (int msk=0; msk<(1<<m); msk++)
    {
        for (int i=1; i<=n; i++) cnt[i]=0;
        for (int i=0; i<m; i++)
        {
            if (msk&(1<<i))
            {
                for (int j=1; j<l[i]; j++) cnt[j]++;
                for (int j=r[i]+1; j<=n; j++) cnt[j]++;
            }
            else
            {
                for (int j=l[i]; j<=r[i]; j++) cnt[j]++;
            }
        }
        int mx=0;
        for (int i=1; i<=n; i++) mx=max(mx, cnt[i]);
        res=min(res, mx);
    }
    cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...