제출 #672992

#제출 시각아이디문제언어결과실행 시간메모리
672992sudheerays123Job Scheduling (CEOI12_jobs)C++17
55 / 100
253 ms23184 KiB
#include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define ll long long int const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7; void solve(){ ll n,d,m; cin >> n >> d >> m; vector<pair<ll,ll>> a(m+5); for(ll i = 1; i <= m; i++){ cin >> a[i].first; a[i].second = i; } sort(a.begin()+1,a.begin()+m+1); ll low = 1 , high = m; ll ans; while(low <= high){ ll mid = (low+high)/2; vector<ll> cur[n+5]; bool possible = true; ll machine = mid , day = 1; for(ll i = 1; i <= m;){ if(machine){ if(day > n){ possible = false; break; } if(day > a[i].first+d){ possible = false; break; } machine--; i++; } else{ machine = mid; day++; } } if(possible){ ans = mid; high = mid-1; } else low = mid+1; } cout << ans << "\n"; for(ll i = 1; i <= n; i++){ for(ll j = (i-1)*ans+1; j <= min(i*ans,m); j++){ cout << a[j].second << " "; } cout << "0\n"; } } int main(){ fast; ll tc = 1; // cin >> tc; while(tc--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...