제출 #642975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
642975		thinhcute	Job Scheduling (CEOI12_jobs)	C++17	15 / 100	142 ms	1976 KiB

jobs

//  ___  ___  ___  _______   ___  ___          ________  ___  ___  _________  _______           ___  ___  ________  ________   ________         
// |\  \|\  \|\  \|\  ___ \ |\  \|\  \        |\   ____\|\  \|\  \|\___   ___\\  ___ \         |\  \|\  \|\   __  \|\   ___  \|\   ____\        
// \ \  \\\  \ \  \ \   __/|\ \  \\\  \       \ \  \___|\ \  \\\  \|___ \  \_\ \ \  \ \        \ \  \\\  \ \  \|\  \ \  \\ \  \ \  \___|        
//  \ \   __  \ \  \ \  \_|/_\ \  \\\  \       \ \  \    \ \  \\\  \   \ \  \ \ \  \ \ \   |/__       \ \   __  \ \  \\\  \ \  \\ \  \ \  \  ___      
//   \ \  \ \  \ \  \ \  \_|\ \ \  \\\  \       \ \  \____\ \  \\\  \   \ \  \ \ \  \ \ \       \ \  \ \  \ \  \\\  \ \  \\ \  \ \  \|\  \     
//    \ \__\ \__\ \__\ \_______\ \_______\       \ \_______\ \_______\   \ \__\ \ \_______\       \ \__\ \__\ \_______\ \__\\ \__\ \_______\    
//     \|__|\|__|\|__|\|_______|\|_______|        \|_______|\|_______|    \|__|  \|_______|        \|__|\|__|\|_______|\|__| \|__|\|_______|

#include <bits/stdc++.h>
#include <queue>
using namespace std;

#define fi first
#define se second

#define MAX 100100

int n, d, m;
pair<int, int> a[MAX];

bool f(int mid)
{
    int j = 1;
    for (int i = 1; i <= n; i++) {
        int cnt = 0;
        // cout << i << " " << j << " " << a[j].fi << endl;
		while (cnt < mid && j <= m && a[j].first <= i && a[j].first + d >= i) {
            cnt++;
            // cout << a[j].se << " ";
            j++;
        }
        if (j <= m && a[j].fi + d < i) return false;
    }
    return true;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> n >> d >> m;
    for (int i = 1; i <= m; i++) {
        cin >> a[i].fi;
        a[i].se = i;
    }

    sort(a + 1, a + m + 1);

    int l = 1, r = n, res = -1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (f(mid)) {
            res = mid;
            r = mid - 1;
        } else l = mid + 1;
    }

    cout << res << endl;
    
	int j = 1;
    for (int i = 1; i <= n; i++) {
		int cnt = 0;
        // cout << i << " " << j << " " << a[j].fi << endl;
		while (cnt < res && j <= m && a[j].first <= i && a[j].first + d >= i) {
            cnt++;
            cout << a[j].se << " ";
            j++;
        }
        cout << 0 << endl;
	}

	return 0;
}

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

jobs.cpp:2:1: warning: multi-line comment [-Wcomment]
    2 | // |\  \|\  \|\  \|\  ___ \ |\  \|\  \        |\   ____\|\  \|\  \|\___   ___\\  ___ \         |\  \|\  \|\   __  \|\   ___  \|\   ____\
      | ^
jobs.cpp:5:1: warning: multi-line comment [-Wcomment]
    5 | //   \ \  \ \  \ \  \ \  \_|\ \ \  \\\  \       \ \  \____\ \  \\\  \   \ \  \ \ \  \ \ \       \ \  \ \  \ \  \\\  \ \  \\ \  \ \  \|\  \
      | ^

• Subtask 1: 15 / 100