oj.uz

Submission #1058400

# Submission time Handle Problem Language Result Execution time Memory
1058400 2024-08-14T09:48:01 Z Malix Job Scheduling (CEOI12_jobs) C++14
60 / 100
 254 ms 18372 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

vi a;
pii arr;
int n,d,m;

int BS(int l,int r){
    if(l==r)return l;
    int t=(l+r)/2;
    int k=0;int p=1;
    bool flag=1;
    REP(i,0,m){
        k++;
        if(arr[i].F+d<p){
            flag=0;
            break;
        }
        if(k==t){
            k=0;p++;
        }
    }
    if(flag)return BS(l,t);
    else return BS(t+1,r);
}

int main() {   
    cin>>n>>d>>m;
    a.resize(m);
    REP(i,0,m)cin>>a[i];
    REP(i,0,m)arr.PB({a[i],i+1});
    sort(arr.begin(),arr.end());
    int ans=BS(1,m);
    if(ans==501)ans++;
    cout<<ans<<"\n";
    int pos=0;int x=0;
    REP(i,0,n){
        while(pos<m&&x<ans){
            cout<<arr[pos].S<<" ";
            pos++;x++;
        }
        cout<<"0\n";
        x=0;
    }
}

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2508 KB Output isn't correct
2 Incorrect 21 ms 2252 KB Output isn't correct
3 Incorrect 17 ms 2108 KB Output isn't correct
4 Incorrect 17 ms 2256 KB Output isn't correct
5 Incorrect 17 ms 2504 KB Output isn't correct
6 Incorrect 17 ms 2256 KB Output isn't correct
7 Incorrect 17 ms 2256 KB Output isn't correct
8 Incorrect 17 ms 2256 KB Output isn't correct
9 Correct 23 ms 2520 KB Output is correct
10 Correct 39 ms 2500 KB Output is correct
11 Correct 23 ms 2256 KB Output is correct
12 Correct 56 ms 4036 KB Output is correct
13 Correct 71 ms 7112 KB Output is correct
14 Correct 101 ms 7868 KB Output is correct
15 Correct 117 ms 9664 KB Output is correct
16 Correct 217 ms 12736 KB Output is correct
17 Correct 182 ms 13752 KB Output is correct
18 Correct 194 ms 17072 KB Output is correct
19 Correct 219 ms 18372 KB Output is correct
20 Correct 254 ms 15304 KB Output is correct