Submission #447672

#	Time	Username	Problem	Language	Result	Execution time	Memory
447672		MilosMilutinovic	팀들 (IOI15_teams)	C++14	21 / 100	37 ms	15064 KiB

teams

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long unsigned long ull;
typedef double long ld;

int n, a[105], b[105];

void init(int N, int A[], int B[]) {
  n = N;
  for (int i = 0; i < n; i++) {
    a[i] = A[i];
    b[i] = B[i];
  }
}

int can(int M, int K[]) {
  sort(K, K + M);
  vector<bool> was(n, false);
  for (int i = 0; i < M; i++) {
    for (int rep = 0; rep < K[i]; rep++) {
      int id = -1;
      for (int j = 0; j < n; j++) {
        if (!was[j] && a[j] <= K[i] && K[i] <= b[j] && (id == -1 || b[j] < b[id])) {
          id = j;
        }
      }
      if (id == -1) return 0;
      was[id] = true;
    }
  }
  return 1;
}

• Subtask 1: 21 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23