#include <bits/stdc++.h> #pragma GCC Optimize("O3") #define FOR(i, x, y) for (ll i = x; i < y; i++) #define MOD 1000000007 typedef long long ll; using namespace std; pair<ll, ll> a[1000001]; bool check(ll machines, ll jobs, ll delay) { FOR(i, 0, jobs) { if (i / machines + 1 - a[i].first > delay) return false; } return true; } int main() { iostream::sync_with_stdio(false); cin.tie(0); ll n, d, m; cin >> n >> d >> m; FOR(i, 0, m) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + m); ll l = 0, r = m; while (l != r) { ll mid = (l + r) / 2; if (check(mid, m, d)) r = mid; else l = mid + 1; } cout << l << '\n'; FOR(i, 0, n) { FOR(j, i * l, min(i * l + l, m)) cout << a[j].second << ' '; cout << "0\n"; } return 0; }

jobs.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")