oj.uz

Submission #453032

# Submission time Handle Problem Language Result Execution time Memory
453032 2021-08-04T07:38:43 Z BT21tata Job Scheduling (CEOI12_jobs) C++17
0 / 100
 278 ms 13544 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());

int n, d, m;
pii a[1000005];

bool check(int x)
{
    int day=1;
    while(day<=n)
    {
        if(day*x>n) 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);
    int l=1, r=m, mid;
    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<m; i+=l, cout<<0<<endl)
        for(int j=i; j<min(m, i+l); j++)
            cout<<a[j].S<<' ';
    cout<<"0\n0\n";
    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 1740 KB Output isn't correct
2 Incorrect 23 ms 1620 KB Output isn't correct
3 Incorrect 20 ms 1644 KB Output isn't correct
4 Incorrect 21 ms 1676 KB Output isn't correct
5 Incorrect 20 ms 1592 KB Output isn't correct
6 Incorrect 20 ms 1612 KB Output isn't correct
7 Incorrect 20 ms 1668 KB Output isn't correct
8 Incorrect 20 ms 1620 KB Output isn't correct
9 Incorrect 32 ms 1600 KB Output isn't correct
10 Incorrect 29 ms 1612 KB Output isn't correct
11 Incorrect 29 ms 1612 KB Output isn't correct
12 Incorrect 60 ms 3232 KB Output isn't correct
13 Incorrect 91 ms 4600 KB Output isn't correct
14 Incorrect 125 ms 6144 KB Output isn't correct
15 Incorrect 157 ms 7572 KB Output isn't correct
16 Incorrect 191 ms 9092 KB Output isn't correct
17 Incorrect 218 ms 10564 KB Output isn't correct
18 Incorrect 251 ms 12068 KB Output isn't correct
19 Incorrect 278 ms 13544 KB Output isn't correct
20 Incorrect 217 ms 10512 KB Output isn't correct