제출 #1275632

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275632		somefolk	Job Scheduling (CEOI12_jobs)	C++20	0 / 100	90 ms	7796 KiB

jobs

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;
const int MAXN = 1e6+5;

int days, delay, n;

bool check(int m, vector<int> &a){
    vector<int> cnt(MAXN, 0);
    for(int i = 0; i < n; i+=m){
        cnt[a[i]]++;
    }
    for(auto &i : cnt){
        if(i > delay) return false;
    }
    return true;
}

void solve(){
    cin >> days >> delay >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());

    int l = 1, r = INF, sol = 0;
    while(l <= r){
        int m = (l+r)/2;
        if(check(m, a)){
            sol = m;
            r = m-1;
        } else {
            l = m+1;
        }
    }

    cout << sol << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

• Subtask 1: 0 / 100