oj.uz

답안 #896253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896253 2024-01-01T05:52:05 Z akkshaysr Job Scheduling (CEOI12_jobs) C++17
40 / 100
 174 ms 14164 KB 
#include <bits/stdc++.h>
#define fr first
#define se second
#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define repr(i,a,b) for(int i = a; i > (b); --i)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define IN(i,l,r) (l<i&&i<r)
#define pb push_back
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef long long ll;
const int U = 1e6+2;
int N,D,M;
pi job[U];
int jd[U/10 + 1];

bool check(int m){
    int day = 0,t = 0;
    while(day < N && t < M){
        ++day;
        t = min(t+m,jd[day]);
        if(t>M) t = M;
        if(job[t-1].fr + D < day){
            return false;
        }
    }
    return true;
}

int main(){
    cin.tie(0)->sync_with_stdio(false);
    cin >> N >> D >> M;
    rep(i,0,M){
        cin >> job[i].fr;
        jd[job[i].fr] += 1;
        job[i].se = i+1;
    }
    rep(i,2,N+1) jd[i] += jd[i-1];
    sort(job,job+M);
    int lo=1,hi=U;
    while(lo < hi){
        ll m = (lo+hi)/2;
        if(check(m)){
            hi = m;
        }else{
            lo = m+1;
        }
    }
    cout << hi << '\n';
    int day = 0,t = 0;
    while(day < N){
        ++day;
        int t_ = min(t+hi,jd[day]);
        if(t_ > M){t_ = M;}
        rep(i,t,t_){
            cout << job[i].se << ' ';
        }
        cout << "0\n";
        t = t_;
    }
}

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 3160 KB Output isn't correct
2 Incorrect 11 ms 3160 KB Output isn't correct
3 Incorrect 12 ms 3164 KB Output isn't correct
4 Incorrect 11 ms 3164 KB Output isn't correct
5 Incorrect 12 ms 2960 KB Output isn't correct
6 Incorrect 12 ms 2908 KB Output isn't correct
7 Incorrect 11 ms 3164 KB Output isn't correct
8 Incorrect 12 ms 3164 KB Output isn't correct
9 Correct 20 ms 3420 KB Output is correct
10 Correct 20 ms 3416 KB Output is correct
11 Correct 19 ms 2908 KB Output is correct
12 Correct 37 ms 3788 KB Output is correct
13 Incorrect 57 ms 6480 KB Output isn't correct
14 Correct 80 ms 7252 KB Output is correct
15 Incorrect 94 ms 9928 KB Output isn't correct
16 Correct 118 ms 10576 KB Output is correct
17 Incorrect 140 ms 11348 KB Output isn't correct
18 Correct 153 ms 12500 KB Output is correct
19 Correct 174 ms 14164 KB Output is correct
20 Incorrect 137 ms 11256 KB Output isn't correct