Submission #1284057

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284057		Faisal_Saqib	Job Scheduling (CEOI12_jobs)	C++20	100 / 100	290 ms	21620 KiB

jobs

/* 
    VENI VIDI VICI
*/

// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
// #define sum accumulate

//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto &i:v) is>>i;
    return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    is>>p.fi>>p.se;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(const auto &i:v) os<<i<<' ';
    return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
    os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
void readIO() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
}

void solve();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    // readIO();

    int uwu=1;

    // cin>>uwu;

    for(int tc=1;tc<=uwu;tc++) {
        // cout<<"Case #"<<tc<<": ";
        solve();
    }
    return 0;
}

void solve()
{
    ll n,d,m;
    cin>>n>>d>>m;
    vl a(m);
    cin>>a;
    // sort(all(a));
    vl cnt(n+2);
    for(auto i:a)cnt[i]+=1;
    ll s=0,e=1e6+1;
    while(s+1<e)
    {
        ll mid=(s+e)/2;
        ll cur=0;
        deque<ll> tp;
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<cnt[i];j++)tp.pb(i);
            for(int j=0;j<mid and tp.size()>0;j++)
            {
                tp.pop_front();
            }
            if(tp.size()>0 and tp.front()+d<=i)
            {
                cur=1;
                break;
            }
        }
        if(cur==0)
        {
            e=mid;
        }
        else
        {
            s=mid;
        }
    }
    vpi c(m);
    for(int i=0;i<m;i++)
    {
        c[i].fi=a[i];
        c[i].se=i+1;
    }
    sort(all(c));
    cout<<e<<endl;
    deque<ll> tp;
    int j=0;
    for(int i=1;i<=n;i++)
    {
        while(j<m and c[j].fi<=i)
        {
            tp.pb(c[j].se);
            j++;
        }
        for(int j=0;j<e and tp.size()>0;j++)
        {
            cout<<tp.front()<<' ';
            tp.pop_front();
        }
        cout<<0<<endl;
    }
}

Compilation message (stderr)

jobs.cpp: In function 'void readIO()':
jobs.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100