Submission #729678

#TimeUsernameProblemLanguageResultExecution timeMemory
729678PanosPaskJob Scheduling (CEOI12_jobs)C++14
100 / 100
153 ms17652 KiB
#include <bits/stdc++.h> using namespace std; int n ,d, m; vector<int> jobs; vector<vector<int>> job_ids; bool can_complete(int x) { int cur_day = 0; vector<int> jobs_at = jobs; for (int i = 0; i < n; i++) { if (i - cur_day > d) return false; int avail = x; while (avail > 0 && cur_day <= i) { int rm = min(avail, jobs_at[cur_day]); avail -= rm; jobs_at[cur_day] -= rm; while (cur_day <= i && jobs_at[cur_day] == 0) cur_day++; } } return true; } int main(void) { scanf("%d %d %d", &n, &d, &m); jobs.assign(n, 0); job_ids.resize(n); for (int i = 0; i < m; i++) { int day; scanf("%d", &day); day--; jobs[day]++; job_ids[day].push_back(i + 1); } int l = 0; int r = m; while (r > l + 1) { int mid = (l + r) / 2; if (can_complete(mid)) r = mid; else l = mid; } printf("%d\n", r); int cur_day = 0; for (int i = 0; i < n; i++) { int rem = r; while (cur_day <= i && rem != 0) { int proc = min(rem, (int)job_ids[cur_day].size()); for (int i = 0; i < proc; i++) { printf("%d ", job_ids[cur_day].back()); job_ids[cur_day].pop_back(); } rem -= proc; while (cur_day <= i && job_ids[cur_day].size() == 0) cur_day++; } printf("0\n"); } return 0; }

Compilation message (stderr)

jobs.cpp: In function 'int main()':
jobs.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf("%d %d %d", &n, &d, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d", &day);
      |         ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...