oj.uz

답안 #711367

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711367 2023-03-16T18:04:42 Z xyzxyz Job Scheduling (CEOI12_jobs) C++14
100 / 100
 246 ms 13900 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, d, m;
	cin >> n >> d >> m;
	vector<int> requests(n);
	vector<vector<int>> auftrage(n);
	int upper = 0, lower = 1;
	for (int i = 1; i <= m; i++) {
		int a;
		cin >> a;
		a--;
		requests[a]++;
		auftrage[a].push_back(i);
		upper = max(upper, requests[a]);
	}
	//cout << d << endl;
	while(upper-lower>0){
		int maschinen = (lower+upper)/2;
		//cout << maschinen << endl;
		int last = 0, rest = requests[0];
		bool pos = true;
		for(int i=0; i<n && pos; i++){
			if (i - last > d) {
				//cout << i << "-" << last << ">" << d << "false" << endl;
				pos = false;
			}
			int tmp = maschinen;
			while(tmp>0 && last<=i){
				int tmp2 = min(rest, tmp);
				tmp -= tmp2;
				rest -= tmp2;
				if(rest == 0 && last<=i){
					last++;
					rest = requests[last];
				}
			}
		}
		if(pos){
			//cout << maschinen << endl;
			upper = maschinen;
		} 
		else lower = maschinen+1;
	}
	cout << lower << endl;
	int curr = 0;
	int j = auftrage[curr].size()-1;
	for (int b = 0; b < n; b++) {
		for (int i = 0; i < lower && b >= curr && curr < auftrage.size() && j >= 0; i++) {
			cout << auftrage[curr][j] << " ";
			j--;
			if (j < 0) {
				curr++;
				if(curr < auftrage.size()) j = auftrage[curr].size()-1;
			}
		}
		cout << 0 << endl;
	}

	return 0;
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:53:50: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for (int i = 0; i < lower && b >= curr && curr < auftrage.size() && j >= 0; i++) {
      |                                             ~~~~~^~~~~~~~~~~~~~~~~
jobs.cpp:58:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     if(curr < auftrage.size()) j = auftrage[curr].size()-1;
      |        ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1232 KB Output is correct
2 Correct 18 ms 1232 KB Output is correct
3 Correct 18 ms 1232 KB Output is correct
4 Correct 17 ms 1232 KB Output is correct
5 Correct 17 ms 1232 KB Output is correct
6 Correct 21 ms 1232 KB Output is correct
7 Correct 18 ms 1232 KB Output is correct
8 Correct 18 ms 1232 KB Output is correct
9 Correct 129 ms 4476 KB Output is correct
10 Correct 126 ms 4484 KB Output is correct
11 Correct 18 ms 1452 KB Output is correct
12 Correct 31 ms 2648 KB Output is correct
13 Correct 47 ms 4544 KB Output is correct
14 Correct 84 ms 5916 KB Output is correct
15 Correct 75 ms 6700 KB Output is correct
16 Correct 119 ms 8580 KB Output is correct
17 Correct 138 ms 10544 KB Output is correct
18 Correct 131 ms 10568 KB Output is correct
19 Correct 246 ms 13900 KB Output is correct
20 Correct 136 ms 10480 KB Output is correct