제출 #554380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554380		farhan132	Job Scheduling (CEOI12_jobs)	C++17	90 / 100	246 ms	33620 KiB

jobs

/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e5 + 5;

vector < ll > v[N];
vector < ll > a[N];
ll n , m, d;

ll check(ll machine){
    queue < ii > q;
    for(ll i = 1; i <= n; i++){
        v[i].clear();
        for(auto u : a[i]) q.push({u, i});
        ll x = machine;
        while(x && q.size()){
            x--;
            if(i - q.front().ss > d) return 0;
            v[i].pb(q.front().ff); 
            q.pop();
        } 
    }
    if(q.size()) return 0;
    return 1;
}

void solve(){

  cin >> n >> d >> m;

  for(ll i = 1; i <= m; i++){
    ll A; cin >> A;
    a[A].pb(i);
  }
  ll lo = 1, hg = 1e6 + 5, ans = hg;
  while(lo <= hg){
    ll mid = (lo + hg)/2;
    if(check(mid)){
        ans = mid, hg = mid - 1;
    }else{
        lo = mid + 1;
    }
  }
  cout << ans << '\n';
  for(ll i = 1; i <= n; i++){
    for(auto u : v[i]) cout << u << ' ';
    cout << "0\n";
  }
  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

jobs.cpp: In function 'int main()':
jobs.cpp:128:15: warning: unused variable 'CT' [-Wunused-variable]
  128 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

• Subtask 1: 90 / 100