oj.uz

답안 #1073224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073224 2024-08-24T10:38:36 Z Glitch00 Job Scheduling (CEOI12_jobs) C++17
55 / 100
 296 ms 20820 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>d){
            ok = 0;
            break;
        }
        cnt++;
        if(cnt==md)day++,cnt=0;
    }

    return ok;
}

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
55.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 2396 KB Output isn't correct
2 Incorrect 25 ms 2396 KB Output isn't correct
3 Incorrect 25 ms 2396 KB Output isn't correct
4 Incorrect 25 ms 2624 KB Output isn't correct
5 Incorrect 24 ms 2648 KB Output isn't correct
6 Incorrect 25 ms 2524 KB Output isn't correct
7 Incorrect 24 ms 2648 KB Output isn't correct
8 Incorrect 25 ms 2392 KB Output isn't correct
9 Correct 125 ms 2664 KB Output is correct
10 Correct 118 ms 2668 KB Output is correct
11 Correct 22 ms 2384 KB Output is correct
12 Correct 43 ms 4696 KB Output is correct
13 Correct 63 ms 7000 KB Output is correct
14 Correct 97 ms 9300 KB Output is correct
15 Incorrect 106 ms 11600 KB Output isn't correct
16 Correct 142 ms 13908 KB Output is correct
17 Correct 163 ms 16032 KB Output is correct
18 Correct 177 ms 18260 KB Output is correct
19 Correct 296 ms 20820 KB Output is correct
20 Correct 161 ms 16212 KB Output is correct