#include <bits/stdc++.h>
using namespace std;
const int N = 21;
int n, m, cnt[N];
int main(){
cin >> n >> m;
vector<pair<int, int>> vec;
for (int i = 0; i < m; i ++){
int a, b, c;
cin >> a >> b >> c;
a--; b--;
vec.push_back({a, b});
}
int ans = m;
for (int mask = 0; mask < (1 << m); mask ++){
memset(cnt, 0, sizeof cnt);
for (int i = 0; i < m; i ++){
int mn = min(vec[i].first, vec[i].second);
int mx = max(vec[i].first, vec[i].second);
if ((1 << i) & mask){
for (int j = mn; j < mx; j ++)
cnt[j]++;
}
else{
for (int j = mx; j != mn; j = (j + 1) % n)
cnt[j]++;
}
}
int mx = 0;
for (int i = 0; i < n; i ++){
// cout << cnt[i] << " -- ";
mx = max(mx, cnt[i]);
}
cout << endl;
ans = min(ans, mx);
}
cout << ans << endl;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |