제출 #598446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598446		stevancv	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	277 ms	23628 KiB

jobs

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e5 + 2;
const int mod = 1e9 + 7;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, d, m;
    cin >> n >> d >> m;
    vector<pair<int, int>> a(m);
    for (int i = 0; i < m; i++) {
        cin >> a[i].first;
        a[i].first -= 1;
        a[i].second = i + 1;
    }
    vector<int> day(m);
    sort(a.begin(), a.end());
    auto Can = [&] (int mid) {
        for (int i = 0; i < m; i++) day[i] = -1;
        int j = -1;
        for (int i = 0; i < n; i++) {
            int r = j;
            while (r < min(m - 1, j + mid) && a[r + 1].first <= i) r++;
            for (int o = j + 1; o <= r; o++) {
                day[o] = i;
            }
            j = r;
        }
        for (int i = 0; i < m; i++) {
            if (!(a[i].first <= day[i] && day[i] <= a[i].first + d)) return false;
        }
        return true;
    };
    int l = 1; int r = n - 1; int ans = n;
    while (l <= r) {
        int mid = l + r >> 1;
        if (Can(mid)) {
            ans = mid;
            r = mid - 1;
        }
        else l = mid + 1;
    }
    Can(ans);
    cout << ans << en;
    vector<vector<int>> pos(n);
    for (int i = 0; i < m; i++) pos[day[i]].push_back(a[i].second);
    for (int i = 0; i < n; i++) {
        for (int u : pos[i]) cout << u + 1 << sp;
        cout << 0 << en;
    }
    return 0;
}

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

jobs.cpp: In function 'int main()':
jobs.cpp:43:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |         int mid = l + r >> 1;
      |                   ~~^~~

• Subtask 1: 0 / 100