제출 #1077318

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

arranging_tickets

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()

int main() {
  ll n, m; cin >> n >> m;
  vector<ll> a(m), b(m), c(m); 
  for(ll i=0; i<m; i++){
    cin >> a[i] >> b[i] >> c[i];
    a[i]--;
    b[i]--;
    if(a[i]>b[i]) swap(a[i], b[i]);
  }
  ll ans;
  for(ll i=0; i<(1<<m); i++){
    vector<ll> s(n, 0);
    ll cnt=0;
    for(ll j=0; j<m; j++){
      if(i&(1<<j)){
        s[a[j]]++;
        s[b[j]]--;
      } else {
        s[0]++;
        s[a[j]]--;
        s[b[j]]++;
      }
    }
    ll curr=0;
    for(ll j=0; j<n; j++){
      curr+=s[j];
      cnt=max(curr, cnt);
    }
    if(i==0) ans=cnt;
    else ans=min(ans, cnt);
  }
  cout << ans << endl;
}

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