Submission #1243584

#TimeUsernameProblemLanguageResultExecution timeMemory
1243584inkvizytorJob Scheduling (CEOI12_jobs)C++17
55 / 100
80 ms14404 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, d, m; cin >> n >> d >> m; vector<int> v (n+1, 0), sp (n+1, 0); vector<vector<int>> c (n+1); for (int i = 1; i < m+1; i++) { int x; cin >> x; v[x]++; c[x].push_back(i); } for (int i = 1; i <= n; i++) { sp[i] = sp[i-1]+v[i]; } int k = 0; for (int i = 1; i <= n; i++) { k = max(k, (sp[i]+i+d-1)/(i+d)); } cout << k << '\n'; queue<int> q; for (int i = 1; i <= n; i++) { for (int j : c[i]) { q.push(j); } for (int j = 0; j < k; j++) { if (q.empty()) { break; } cout << q.front() << ' '; q.pop(); } cout << "0\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...