Submission #1261517

#TimeUsernameProblemLanguageResultExecution timeMemory
1261517mirbek01Job Scheduling (CEOI12_jobs)C++20
40 / 100
304 ms38640 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { ios::sync_with_stdio(0); int n, d, m; cin >> n >> d >> m; vector <int> vec[n + 1]; vector <int> a(m + 1); for (int i = 1; i <= m; i++) { cin >> a[i]; vec[a[i]].push_back(i); } int l = 0, r = m; while (r - l > 1) { int mid = (l + r) >> 1; deque <int> dq; vector <int> res(m + 1); for (int i = 1; i <= n; i++) { for (auto x : vec[i]) dq.push_back(x); for (int j = 0; j < mid; j++) { if (dq.empty()) break; res[dq.front()] = i; dq.pop_front(); } } int flag = 1; if (!dq.empty()) flag = 0; for (int i = 1; i <= m; i++) { if (res[i] - i >= m) flag = 0; } if (flag) r = mid; else l = mid; } cout << r << endl; deque <int> dq; for (int i = 1; i <= n; i++) { for (auto x : vec[i]) dq.push_back(x); for (int j = 0; j < r; j++) { if (dq.empty()) break; cout << dq.front() << " "; dq.pop_front(); } cout << 0 << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...