oj.uz

답안 #1073246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073246 2024-08-24T10:54:59 Z Glitch00 Job Scheduling (CEOI12_jobs) C++17
100 / 100
 291 ms 20932 KB 
#include <bits/stdc++.h>

#define int long long
#define ll long long
using namespace std;
int dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
int n,d,m;
vector<pair<int,int>>v;

bool can(int md){
    int cnt = 0;
    int day = 1;
    bool ok = 1;
    for(int i=0 ; i<m ; i++){
        if(day<v[i].first)day = v[i].first,cnt = 0;
        if(day-v[i].first>d){
            ok = 0;
            break;
        }
        cnt++;
        if(cnt==md)day++,cnt=0;
    }
    if(!ok)return ok;
    if(day<=n || (day==n+1 && cnt==0))return 1;
    return 0;
}

void solve() {
    cin>>n>>d>>m;
    v = vector<pair<int,int>>(m);
    for(int i=0 ; i<m ; i++){
        cin>>v[i].first;
        v[i].second=i+1;
    }
    std::sort(v.begin(), v.end());
    int l =1 , r=1e9;
    int best = -1;
    while(l<=r){
        int md = (l+r)>>1;
        if(can(md)){
            best = md;
            r = md - 1;
        }else l = md + 1;
    }
    int j = 0;
    cout<<best<<endl;
    for(int i=0 ; i<n ; i++){
        for(int w = j ; w<min(j+best,m) ; w++){
            cout<<v[w].second<<" ";
        }
        cout<<0<<endl;
        j+=best;
    }
}

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

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2396 KB Output is correct
2 Correct 24 ms 2396 KB Output is correct
3 Correct 24 ms 2392 KB Output is correct
4 Correct 27 ms 2396 KB Output is correct
5 Correct 27 ms 2396 KB Output is correct
6 Correct 25 ms 2648 KB Output is correct
7 Correct 25 ms 2396 KB Output is correct
8 Correct 24 ms 2652 KB Output is correct
9 Correct 116 ms 2796 KB Output is correct
10 Correct 131 ms 2792 KB Output is correct
11 Correct 27 ms 2552 KB Output is correct
12 Correct 44 ms 4688 KB Output is correct
13 Correct 64 ms 6992 KB Output is correct
14 Correct 99 ms 9300 KB Output is correct
15 Correct 110 ms 11600 KB Output is correct
16 Correct 138 ms 13904 KB Output is correct
17 Correct 170 ms 16212 KB Output is correct
18 Correct 180 ms 18260 KB Output is correct
19 Correct 291 ms 20932 KB Output is correct
20 Correct 165 ms 16212 KB Output is correct