oj.uz

답안 #900205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900205 2024-01-07T21:28:46 Z VMaksimoski008 Job Scheduling (CEOI12_jobs) C++14
100 / 100
 447 ms 4616 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int N, D, M;
vector<int> v, cnt;

bool check(int mid) {
    int left = mid;
    priority_queue<int, vector<int>, greater<int> > pq;

    int last = 0;
    for(int i=1; i<=N; i++) {
        left = mid;
        //cout << "DAY: " << i << '\n';

        for(int j=0; j<cnt[i]; j++) pq.push(i);

        while(left > 0 && !pq.empty()) {
            int u = pq.top();
            pq.pop();
            if(i - u > D) return false;
            left--;
        }

        //cout << "LEFT: " << pq.size() << '\n';
    }

    return true;
}

int32_t main() {
    setIO();

    cin >> N >> D >> M;
    v.resize(M);
    cnt.resize(N+1);
    for(int &x : v) cin >> x, cnt[x]++;
    sort(all(v));

    int l=1, r=M;
    int ans = 0;

    while(l <= r) {
        int mid = (l + r) / 2;
        if(check(mid)) ans = mid, r = mid - 1;
        else l = mid + 1;
    }

    cout << ans << '\n';
    for(int i=1; i<=N; i++) cout << 0 << '\n';
    return 0;
}

Compilation message

jobs.cpp: In function 'bool check(int)':
jobs.cpp:37:9: warning: unused variable 'last' [-Wunused-variable]
   37 |     int last = 0;
      |         ^~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 1820 KB Output is correct
2 Correct 38 ms 1792 KB Output is correct
3 Correct 38 ms 1796 KB Output is correct
4 Correct 38 ms 1776 KB Output is correct
5 Correct 38 ms 1776 KB Output is correct
6 Correct 45 ms 2096 KB Output is correct
7 Correct 38 ms 1804 KB Output is correct
8 Correct 38 ms 1708 KB Output is correct
9 Correct 51 ms 1340 KB Output is correct
10 Correct 62 ms 1368 KB Output is correct
11 Correct 28 ms 860 KB Output is correct
12 Correct 125 ms 1708 KB Output is correct
13 Correct 130 ms 1628 KB Output is correct
14 Correct 186 ms 2312 KB Output is correct
15 Correct 138 ms 2416 KB Output is correct
16 Correct 145 ms 2648 KB Output is correct
17 Correct 256 ms 3412 KB Output is correct
18 Correct 447 ms 3632 KB Output is correct
19 Correct 428 ms 4616 KB Output is correct
20 Correct 254 ms 3240 KB Output is correct