# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93987 | Rakhmand | Job Scheduling (CEOI12_jobs) | C++14 | 338 ms | 27432 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
const long long MXN = 1e6 + 1;
const long long MNN = 1e5 + 1;
const long long MOD = 998244353;
const long long INF = 1e18;
const long long OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
int n, d, m;
vector<int> v[MNN];
queue<pair<int, int> > t;
vector<int> ans[MNN];
bool isEnough(int x){
queue<pair<int, int> > test;
test = t;
for(int i = 1; i <= n; i++){
int cnt = x;
while(!test.empty() && cnt != 0){
pair<int, int> j = test.front();
if(j.F + d < i){
return false;
}if(j.F > i){
break;
}if(i <= j.F + d){
test.pop();
cnt--;
}
}
}return true;
}
int main(){
ios;
cin >> n >> d >> m;
for(int i = 1; i <= m; i++){
int x;
cin >> x;
v[x].pb(i);
}for(int i = 1; i <= n; i++){
for(int j = 0; j < v[i].size(); j++){
t.push({i, v[i][j]});
}
}int l = 1, r = MXN;
while(r - l > 1){
int mid = (r + l) / 2;
if(isEnough(mid)){
r = mid;
}else{
l = mid;
}
}int ans = (isEnough(l) == true ? l : r);
cout << ans << nl;
for(int i = 1; i <= n; i++){
int cnt = ans;
while(!t.empty() && cnt != 0){
pair<int, int> j = t.front();
if(j.F > i){
break;
}if(i <= j.F + d){
cout << j.S << ' ';
t.pop();
cnt--;
}
}cout << 0 << nl;
}
return 0;
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |