# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78621 | ekrem | Job Scheduling (CEOI12_jobs) | C++98 | 1088 ms | 33792 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 <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define orta ((bas+son)/2)
#define N 1000005
using namespace std;
typedef pair < int , int > ii;
int n, m, d, bas = 1, son, l, r, q[N], a[N];
vector < int > g[N];
bool dene(int x){
l = 1;
r = 0;
int ind = 1;
for(int i = 1; i <= n; i++){
for(int j = 0; j < g[i].size(); j++){
q[++r] = i;
ind++;
}
int say = 0;
for(int j = 1; j <= x; j++)
if(r - l + 1 > 0){
if(i - q[l] > d)
return 0;
else
l++;
}
}
if(r - l + 1 > 0)
return 0;
return 1;
}
void bastir(int x){
l = 1;
r = 0;
int ind = 1;
for(int i = 1; i <= n; i++){
for(int j = 0; j < g[i].size(); j++){
q[++r] = g[i][j];
ind++;
}
int say = 0;
for(int j = 1; j <= x; j++)
if(r - l + 1 > 0){
cout << q[l] << " ";
l++;
}
cout << 0 << endl;
}
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d %d %d",&n ,&d ,&m);
son = m;
for(int i = 1; i <= m; i++){
scanf("%d",&a[i]);
g[a[i]].pb(i);
}
while(bas < son)
if(dene(orta))
son = orta;
else
bas = orta + 1;
cout << orta << endl;
bastir(orta);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |