제출 #255143

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

arranging_tickets

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  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];
    if (a[i] > b[i]) swap(a[i], b[i]);
  }
  int ans = m;
  for (int mask = 0; mask < (1 << m); ++mask) {
    vector <int> cnt(n);
    for (int i = 0; i < m; ++i) {
      if (mask & (1 << i)) {
        for (int j = a[i]; j < b[i]; ++j) {
          ++cnt[j];
        }
      } else {
        for (int j = 0; j < n; ++j) ++cnt[j];
        for (int j = a[i]; j < b[i]; ++j) {
          --cnt[j];
        }
      }
    }
    int mx = 0;
    for (int i = 0; i < n; ++i) {
      mx = max(mx, cnt[i]);
    }
    ans = min(ans, mx);
  }
  cout << ans << '\n';
}

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