제출 #691185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691185		amunduzbaev	Arranging Tickets (JOI17_arranging_tickets)	C++17	10 / 100	161 ms	312 KiB

arranging_tickets

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define ar array
//~ #define int ll

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin >> m >> n;
	vector<int> l(n), r(n);
	for(int i=0;i<n;i++){
		int c; cin >> l[i] >> r[i] >> c;
		if(l[i] > r[i]) swap(l[i], r[i]);
		l[i]--, r[i]--;
	}
	
	int ans = m;
	for(int mask=0;mask < (1 << n);mask++){
		vector<int> pref(m);
		for(int i=0;i<n;i++){
			if(mask >> i & 1){
				pref[0]++, pref[l[i]]--;
				pref[r[i]]++;
			} else {
				pref[l[i]]++;
				pref[r[i]]--;
			}
		}
		
		int res = pref[0];
		for(int i=1;i<m;i++){
			pref[i] += pref[i-1];
			res = max(res, pref[i]);
		}
		ans = min(ans, res);
	}
	cout<<ans<<"\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 35
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 15