# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738989 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++17 | 233 ms | 13864 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>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pi3 = pair<int,pii>;
#define ON(n , k) ( (n) | ( 1 << (k) ))
#define OFF(n ,k) ( (n) & ( ~( 1 << (k))))
#define ISON(n ,k) ( ( (n)>>(k) ) & (1) )
#define F first
#define S second
const int N = 2e5+5;
const int mod = 1e9+7;
const int INF = 1e9+9;
const double PI = 3.1415926536;
int dx[10] = {0, 0, 1, -1, 1, 1, -1, -1, 0};
int dy[10] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
char str[N];
int n, d, m;
vector<pii>v;
bool cmp(pii A, pii B)
{
return A.S < B.S;
}
bool ok(int mid)
{
int i = 0;
for(int j = 1; j <= n; j++)
{
for(int x = 0; x < mid; x++)
{
if(v[i].S > j)break;
if(v[i].S + d < j)return false;
i++;
if(i == m)return true;
}
}
return false;
}
void solve()
{
scanf("%d%d%d", &n, &d, &m);
for(int i = 1; i <= m; i++)
{
int x;
scanf("%d", &x);
v.push_back({i, x});
}
sort(v.begin(), v.end(), cmp);
int l = 0, r = m+2, mid;
while(l + 1 < r)
{
mid = l + (r - l)/2;
if(ok(mid))
{
r = mid;
}
else
{
l = mid;
}
}
printf("%d\n", r);
int i = 0;
for(int j = 1; j <= n ; j++)
{
for(int x = 0; x < mid && i < m; x++)
{
if(v[i].S > j)break;
printf("%d ", v[i].F);
i++;
}
printf("0\n");
}
}
int main()
{
//freopen("", "r", stdin);
//freopen("", "w", stdout);
/*
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
*/
int T;
T = 1 ;
//scanf("%d" , &T);
while(T--)
{
// init();
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |