제출 #146252

#제출 시각아이디문제언어결과실행 시간메모리
146252dolphingarlicJob Scheduling (CEOI12_jobs)C++14
30 / 100
274 ms13880 KiB
#include <bits/stdc++.h> #pragma GCC Optimize("O3") #define FOR(i, x, y) for (int i = x; i < y; i++) #define MOD 1000000007 typedef long long ll; using namespace std; pair<int, int> a[1000001]; bool check(int machines, int jobs, int delay) { for (int i = 0, days = 1; i < jobs; i += machines, days++) { if (days - a[min(i + machines, jobs) - 1].first >= delay) return false; } return true; } int main() { iostream::sync_with_stdio(false); cin.tie(0); int n, d, m; cin >> n >> d >> m; FOR(i, 0, m) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + m); int l = 1, r = m; while (l != r) { int 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; }

컴파일 시 표준 에러 (stderr) 메시지

jobs.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")
#Verdict Execution timeMemoryGrader output
Fetching results...