oj.uz

답안 #1073233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073233 2024-08-24T10:46:39 Z Glitch00 Job Scheduling (CEOI12_jobs) C++17
55 / 100
 308 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;
    }
    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
55.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 2544 KB Output isn't correct
2 Incorrect 24 ms 2396 KB Output isn't correct
3 Incorrect 25 ms 2652 KB Output isn't correct
4 Incorrect 40 ms 2624 KB Output isn't correct
5 Incorrect 24 ms 2568 KB Output isn't correct
6 Incorrect 23 ms 2632 KB Output isn't correct
7 Incorrect 23 ms 2396 KB Output isn't correct
8 Incorrect 24 ms 2396 KB Output isn't correct
9 Correct 119 ms 2640 KB Output is correct
10 Correct 118 ms 2652 KB Output is correct
11 Correct 21 ms 2380 KB Output is correct
12 Correct 44 ms 4856 KB Output is correct
13 Correct 83 ms 6960 KB Output is correct
14 Correct 107 ms 9280 KB Output is correct
15 Incorrect 108 ms 11604 KB Output isn't correct
16 Correct 140 ms 13932 KB Output is correct
17 Correct 167 ms 16028 KB Output is correct
18 Correct 176 ms 18348 KB Output is correct
19 Correct 308 ms 20820 KB Output is correct
20 Correct 154 ms 16208 KB Output is correct