Submission #1051860

#TimeUsernameProblemLanguageResultExecution timeMemory
1051860manhlinh1501Job Scheduling (CEOI12_jobs)C++17
65 / 100
133 ms38228 KiB
#include <bits/stdc++.h> using namespace std; using i64 = long long; using pii = pair<int, int>; const int MAXN = 1e6 + 5; int N, M, D; int a[MAXN]; vector<int> g[MAXN]; bool check(int K) { queue<int> Q; for(int i = 0; i <= N; i++) { for(int p : g[i]) Q.emplace(p); int cnt = 0; while(!Q.empty() and cnt < K) { int p = Q.front(); if(i - D > a[p]) return false; Q.pop(); cnt++; } } return Q.empty(); } signed main() { #define TASK "code" if (fopen(TASK ".inp", "r")) { freopen(TASK ".inp", "r", stdin); freopen(TASK ".out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> D >> M; for(int i = 1; i <= M; i++) { cin >> a[i]; } for(int i = 1; i <= M; i++) g[a[i]].emplace_back(i); int low = 1, high = M; int ans = -1; while(low <= high) { int mid = (low + high) / 2; if(check(mid)) { ans = mid; high = mid - 1; } else low = mid + 1; } cout << ans << "\n"; queue<int> Q; for(int i = 1; i <= N; i++) { for(int p : g[i]) Q.emplace(p); int cnt = 0; while(!Q.empty() and cnt < ans) { int p = Q.front(); cout << p << " "; Q.pop(); cnt++; } cout << "0\n"; } return (0 ^ 0); }

Compilation message (stderr)

jobs.cpp: In function 'int main()':
jobs.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...