| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 905044 | 2024-01-12T13:23:09 Z | akliu | Job Scheduling (CEOI12_jobs) | C++11 | 870 ms | 20164 KB |
#include <bits/stdc++.h>
using namespace std;
void fastio() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void open(string filename) {
fastio();
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
typedef long long ll;
#define vll vector<ll>
#define vint vector<int>
#define vbool vector<bool>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define ins(x) insert(x)
#define sz() size()
#define lb() lower_bound()
#define ub() upper_bound()
#define rsz resize
#define se second
#define fi first
#define cont continue
// scary demonic thing
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
struct g {
int day, n;
bool operator<(const g &y) {
if (day != y.day) return day < y.day;
return n < y.n; // Not necessary, compiler gives annoying error otherwise though
}
};
int N, D, M;
vector<g> v;
bool check(int m) {
// Iterate to check if the minimum is valid
multiset<int> machines;
deque<int> q;
int d = 0;
auto it = v.begin();
g val = *it;
while (d != N + 1) {
if (q.sz()) {
if (d - *(q.begin()) > D) {
return false;
}
}
machines.clear();
val = *it;
while (machines.sz() != m) {
if (!q.sz()) break;
machines.ins(*(q.begin()));
q.pop_front();
}
while (val.day == d) {
if (machines.sz() != m) machines.ins(val.day);
else q.push_back(val.day);
++it;
if (it == v.end()) break;
val = *it;
}
++d;
}
return true;
}
void solve() {
// Input
cin >> N >> D >> M;
for (int i = 0; i < M; ++i) {
int a; cin >> a;
v.pb({a, i + 1});
}
sort(v.begin(), v.end());
// Binary search
int l = 1, r = 1e6, m;
while (l < r) {
m = (l + r) / 2;
if (check(m)) r = m;
else l = m + 1;
}
cout << l << "\n";
// Iterate once more with the correct minimum, very minor changes to the binary search algorithm to allow for storing the index of the value
vector<vint> ans(N + 1);
multiset<pii> machines;
deque<pii> q;
int d = 0;
auto it = v.begin();
g val = *it;
while (d != N + 1) {
machines.clear();
val = *it;
while (machines.sz() != l) {
if (!q.sz()) break;
pii valQ = *(q.begin());
machines.ins(mp(valQ.fi, valQ.se));
q.pop_front();
}
while (val.day == d) {
val = *it;
if (machines.sz() != l) {
machines.ins(mp(val.day, val.n));
}
else q.push_back(mp(val.day, val.n));
++it;
if (it == v.end()) break;
}
for (auto &x : machines) {
ans[d].pb(x.se);
}
++d;
}
// Output
for (int i = 1; i <= N; ++i) {
for (int j = 0; j < ans[i].sz(); ++j) {
cout << ans[i][j] << " ";
}
cout << "0\n";
}
}
int main() {
fastio();
int tc = 1;
// cin >> tc;
while (tc--) {
solve();
}
return 0;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 187 ms | 6356 KB | Output is correct |
| 2 | Correct | 192 ms | 6468 KB | Output is correct |
| 3 | Correct | 190 ms | 6464 KB | Output is correct |
| 4 | Correct | 198 ms | 6464 KB | Output is correct |
| 5 | Correct | 192 ms | 6436 KB | Output is correct |
| 6 | Correct | 191 ms | 6352 KB | Output is correct |
| 7 | Correct | 189 ms | 6472 KB | Output is correct |
| 8 | Correct | 188 ms | 6348 KB | Output is correct |
| 9 | Correct | 118 ms | 5064 KB | Output is correct |
| 10 | Correct | 136 ms | 5064 KB | Output is correct |
| 11 | Correct | 80 ms | 2264 KB | Output is correct |
| 12 | Correct | 180 ms | 4456 KB | Output is correct |
| 13 | Correct | 283 ms | 8628 KB | Output is correct |
| 14 | Correct | 371 ms | 10128 KB | Output is correct |
| 15 | Correct | 494 ms | 9672 KB | Output is correct |
| 16 | Correct | 459 ms | 13960 KB | Output is correct |
| 17 | Correct | 604 ms | 17332 KB | Output is correct |
| 18 | Correct | 803 ms | 18876 KB | Output is correct |
| 19 | Correct | 870 ms | 20164 KB | Output is correct |
| 20 | Correct | 605 ms | 17916 KB | Output is correct |