Submission #1204080

#TimeUsernameProblemLanguageResultExecution timeMemory
1204080MuhammadSaramArranging Tickets (JOI17_arranging_tickets)C++20
10 / 100
150 ms412 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n,m;
	cin>>n>>m;
	vector<pair<int,int>> v;
	for (int i=0;i<m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		if (a>b) swap(a,b);
		a--,b--;
		v.push_back({a,b});
	}
	int ans=m;
	for (int i=0;i<(1<<m);i++)
	{
		int a[2*n]={};
		for (int p=0;p<m;p++)
			if ((i>>p)%2)
				a[v[p].second]++,a[v[p].first+n]--;
			else
				a[v[p].first]++,a[v[p].second]--;
		for (int i=1;i<2*n;i++)
			a[i]+=a[i-1];
		int mx=0;
		for (int i=0;i<n;i++)
			mx=max(mx,a[i]+a[i+n]);
		ans=min(ans,mx);
	}
	cout<<ans<<endl;
	
	return 0;
}
#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...