제출 #1185716

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185716		swishy123	Job Scheduling (CEOI12_jobs)	C++20	60 / 100	234 ms	13804 KiB

jobs

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const ll inf = 1e18;
const ll def = 1e6+1;
const ll mod = 1e9;

using namespace std;

pi p[def];
void solve(){
    int n, m, d;
    read(n, d, m);

    for (int i = 0; i < m; i++){
        p[i].y = i + 1;
        read(p[i].x);
    }
    sort(p, p + m);
    int l = 1, r = n, mid = (l + r) / 2;
    while (l < r){
        int L = 0, R = -1;
        bool ok = 1;

        for (int i = 1; i <= n; i++){
            while (R + 1 < m && p[R + 1].x <= i)
                R++;
            for (int j = 0; j < mid; j++){
                if (L > R)
                    break;
                if (i - p[L].x > d)
                    ok = 0;
                L++;
            }
        }
        if (ok && L == m)
            r = mid;
        else
            l = mid + 1;
        mid = (l + r) / 2;
    }
    cout << r << endl;

    int L = 0, R = -1;
    for (int i = 1; i <= n; i++){
        while (R + 1 < m && p[R + 1].x <= i)
            R++;
        for (int j = 0; j < r; j++){
            if (L > R)
                break;
            cout << p[L].y << ' ';
            L++;
        }
        cout << 0;
        if (i != n)
            cout << endl;
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t = 1;
    while (t--){
        solve();
    }

    return 0;
}

• Subtask 1: 60 / 100