oj.uz

답안 #493396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493396 2021-12-11T08:05:32 Z PikaQ Job Scheduling (CEOI12_jobs) C++17
100 / 100
 261 ms 20708 KB 
#include<bits/stdc++.h>
#define int ll
#define forn(i,n) for(int i=0;i<(n);i++)
#define Forn(i,n) for(int i=1;i<=(n);i++)
#define ll long long
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define rz resize
#define vi vector<int>
#define vl vector<long long>
#define vpi vector<pair<int,int> >
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp make_pair
#define all(p) p.begin(),p.end()
#define alr(p,q) p+1,p+q+1
#define ull unsigned long long
#define st0(p) memset((p),0,sizeof(p))
#define T(x) ((x)%2 ? s[(x)/2] : '.')
#define lowb(x) x&-x
#define ls(x) (x)*2
#define rs(x) (x)*2+1
using namespace std;
 
inline void USACO(const string &s){
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
 
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
// template <class T> int max(T a, T ... b) { cout << a << " "; debug(b...);}
#define fail() {cout << "-1\n";return;}
const int INF = 1e9+7;
const int N = 1e6+9;
int n,d,m;
vpi a;
 
bool check(int x){
	int cur = 1,res = x;
	for(auto &i : a){
		if(cur > i.F + d) return 0;
		while(cur < i.F ) cur++,res = x;
		res--;
		if(res == 0) cur++,res = x;
	}
	return 1;
}
 
void out(int x){
	int cur = 1,res = x;
	for(auto &i : a){
		while(cur < i.F || res == 0){
			cout << "0\n";
			cur++,res = x;
		}
		cout << i.S << ' ';
		res--;
	}
	while(cur <= n) cur++,cout << "0\n";
}
void solve(){
	cin >> n >> d >> m;
	a.rz(m);
	forn(i,m) cin >> a[i].F,a[i].S = i+1;
	sort(all(a));
	int lo =0,hi = m;
	while(lo != hi-1){
		int mid = (lo+hi)/2;
		if(check(mid)) hi = mid;
		else lo = mid;
	}
	cout << hi << '\n';
	// Forn(i,n) cout << "0\n";
	out(hi);
}
 
 
 
 
signed main(){
	// USACO("sabotage");
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
	


	// int t;
	// cin >> t;
	// while(t--)
		solve();
 
	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 2404 KB Output is correct
2 Correct 16 ms 2404 KB Output is correct
3 Correct 19 ms 2504 KB Output is correct
4 Correct 19 ms 2412 KB Output is correct
5 Correct 19 ms 2392 KB Output is correct
6 Correct 25 ms 2460 KB Output is correct
7 Correct 16 ms 2500 KB Output is correct
8 Correct 17 ms 2456 KB Output is correct
9 Correct 26 ms 2624 KB Output is correct
10 Correct 26 ms 2584 KB Output is correct
11 Correct 28 ms 2372 KB Output is correct
12 Correct 56 ms 4736 KB Output is correct
13 Correct 77 ms 6920 KB Output is correct
14 Correct 105 ms 9256 KB Output is correct
15 Correct 135 ms 11476 KB Output is correct
16 Correct 153 ms 13796 KB Output is correct
17 Correct 208 ms 16004 KB Output is correct
18 Correct 206 ms 18440 KB Output is correct
19 Correct 261 ms 20708 KB Output is correct
20 Correct 203 ms 16020 KB Output is correct