oj.uz

Submission #95432

# Submission time Handle Problem Language Result Execution time Memory
95432 2019-02-01T07:08:02 Z forestryks Job Scheduling (CEOI12_jobs) C++14
100 / 100
 383 ms 19896 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
////////////////////////////////////////////////////////////////////////////////////////////////

const int MAXN = 1e5 + 5;
int n, d, m;
vector<int> a[MAXN];
int t[MAXN * 10];

bool check(int cnt, bool pr) {
    if (pr) cout << cnt << '\n';

    queue<int> q;
    for (int i = 0; i < n; ++i) {
        for (auto it : a[i]) {
            q.push(it);
        }

        for (int j = 0; j < cnt && !q.empty(); ++j) {
            int x = q.front();
            q.pop();
            if (i > t[x] + d) return false;
            if (pr) cout << x + 1 << ' ';
        }
        if (pr) cout << "0\n";
    }

    if (q.empty()) return true;
    return false;
}

int main() {
    FAST_IO;
    cin >> n >> d >> m;
    rep(i, m) {
        cin >> t[i];
        t[i]--;
        a[t[i]].push_back(i);
    }

    int l = 0, r = m;
    while (r - l > 1) {
        int m = l + (r - l) / 2;
        if (check(m, false)) {
            r = m;
        } else {
            l = m;
        }
    }

    check(r, true);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 4496 KB Output is correct
2 Correct 29 ms 4496 KB Output is correct
3 Correct 28 ms 4440 KB Output is correct
4 Correct 28 ms 4564 KB Output is correct
5 Correct 29 ms 4492 KB Output is correct
6 Correct 29 ms 4564 KB Output is correct
7 Correct 29 ms 4576 KB Output is correct
8 Correct 29 ms 4564 KB Output is correct
9 Correct 33 ms 4448 KB Output is correct
10 Correct 32 ms 4472 KB Output is correct
11 Correct 29 ms 4184 KB Output is correct
12 Correct 59 ms 6008 KB Output is correct
13 Correct 125 ms 8696 KB Output is correct
14 Correct 176 ms 11040 KB Output is correct
15 Correct 162 ms 12364 KB Output is correct
16 Correct 196 ms 15352 KB Output is correct
17 Correct 269 ms 18040 KB Output is correct
18 Correct 284 ms 18168 KB Output is correct
19 Correct 383 ms 19896 KB Output is correct
20 Correct 294 ms 17980 KB Output is correct