제출 #1011521

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

arranging_tickets

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m), c(m);
  for (int i = 0; i < m; i++) {
    cin >> a[i] >> b[i] >> c[i];
    --a[i]; --b[i];
  }
  int res = n;
  for (int mask = 0; mask < (1 << m); mask++) {
    vector<int> cnt(n);
    for (int i = 0; i < m; i++) {
      if (mask >> i & 1) {
        swap(a[i], b[i]);
      }
      int p = a[i];
      while (p != b[i]) {
        cnt[p] += 1;
        p = (p + 1) % n;
      }
      if (mask >> i & 1) {
        swap(a[i], b[i]);
      }
    }
    res = min(res, *max_element(cnt.begin(), cnt.end()));
  }
  cout << res << '\n';
  return 0;
}

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