#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[m], b[m];
for(int i=0,trash;i<m;i++) {
cin >> a[i] >> b[i] >> trash;
a[i]--;
b[i]--;
if(a[i] > b[i])
swap(a[i], b[i]);
}
int ans = 1e9;
for(int i=0;i<(1<<m);i++) {
int cnt[n+1];
memset(cnt,0,sizeof(cnt));
for(int j=0;j<m;j++) {
if(i&(1<<j))
cnt[0]++, cnt[a[j]]--, cnt[b[j]]++;
else
cnt[a[j]]++, cnt[b[j]]--;
}
partial_sum(cnt,cnt+n,cnt);
ans = min(ans, *max_element(cnt,cnt+n));
}
cout << ans;
}
# | 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... |