제출 #499647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499647		Shreyan_Paliwal	Job Scheduling (CEOI12_jobs)	C++17	55 / 100	534 ms	13672 KiB

jobs

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

vector<pair<int, int>> jobs;
int                    n, d, m;

bool works(int mid) {
  int counter = 0;
  int day     = 1;
  for (int i = 0; i < m; i++) {
    if (day <= jobs[i].first + d) {
      counter = (counter + 1) % mid;
      if (counter == 0) day++;
    } else {
      return false;
    }
  }

  return (counter == 0 ? day - 1 : day) <= n;
}

int main() {
  // freopen("jobscheduling.in", "r", stdin);

  cin >> n >> d >> m;

  jobs = vector<pair<int, int>>(m);
  for (int i = 0; i < m; i++) {
    cin >> jobs[i].first;
    jobs[i].second = i + 1;
  }

  sort(jobs.begin(), jobs.end());

  int lo = 1;
  int hi = 1000000;
  while (lo != hi) {
    int mid = (lo + hi) / 2;
    if (works(mid)) {
      hi = mid;
    } else {
      lo = mid + 1;
    }
  }

  cout << lo << endl;

  int counter = 0;
  for (int i = 0; i < n; i++) {
    if (counter < m)
      for (int j = 0; j < lo; j++) {
        if (counter < m)  // cout << 0 * (counter++) << " ";
          cout << jobs[counter++].second << " ";
        else
          break;
      }
    cout << 0 << endl;
  }

  return 0;
}

• Subtask 1: 55 / 100