oj.uz

Submission #453064

# Submission time Handle Problem Language Result Execution time Memory
453064 2021-08-04T07:48:01 Z BT21tata Job Scheduling (CEOI12_jobs) C++17
15 / 100
 289 ms 20844 KB 
#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
//mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

ll n, d, m;
pll a[1000005];

bool check(ll x)
{
    ll day=1;
    while(day<=n)
    {
        if(day*x>m) break;
        //cout<<x<<' ' <<day<<' '<<a[day*x-1].F<<endl;
        if(a[day*x-1].F<day) return 0;
        day++;
    }
    return 1;
}

int main()
{
    SPEED;
    cin>>n>>d>>m;
    for(int i=0; i<m; i++)
    {
        cin>>a[i].F;
        a[i].F+=d;
        a[i].S=i+1;
    }
    sort(a, a+m);
    ll l=1, r=m, mid, pos=0;
    while(l<=r)
    {
        mid=(l+r)>>1;
        if(check(mid)) r=mid-1;
        else l=mid+1;
    }
    cout<<l<<endl;
    for(int i=0; i<n; i++, cout<<0<<endl)
        for(int j=0; j<l and pos<m; j++)
            cout<<a[pos++].S<<' ';

    return 0;
}

Subtask #1
15.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 2472 KB Output isn't correct
2 Incorrect 27 ms 2472 KB Output isn't correct
3 Incorrect 21 ms 2380 KB Output isn't correct
4 Incorrect 27 ms 2456 KB Output isn't correct
5 Incorrect 21 ms 2372 KB Output isn't correct
6 Incorrect 27 ms 2380 KB Output isn't correct
7 Incorrect 21 ms 2444 KB Output isn't correct
8 Incorrect 47 ms 2460 KB Output isn't correct
9 Incorrect 37 ms 2640 KB Output isn't correct
10 Incorrect 136 ms 2668 KB Output isn't correct
11 Incorrect 32 ms 2380 KB Output isn't correct
12 Correct 64 ms 4716 KB Output is correct
13 Incorrect 92 ms 6928 KB Output isn't correct
14 Correct 127 ms 9248 KB Output is correct
15 Incorrect 209 ms 11500 KB Output isn't correct
16 Correct 200 ms 13792 KB Output is correct
17 Incorrect 224 ms 16088 KB Output isn't correct
18 Incorrect 249 ms 18340 KB Output isn't correct
19 Incorrect 289 ms 20844 KB Output isn't correct
20 Incorrect 222 ms 16056 KB Output isn't correct