oj.uz

답안 #1094080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094080 2024-09-28T11:51:49 Z Sunbae Job Scheduling (CEOI12_jobs) C++17
45 / 100
 185 ms 20560 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100000];
int a[1000000];
signed main(){
	int n, d, m; scanf("%d %d %d", &n, &d, &m);
	for(int i = 0; i<m; ++i) scanf("%d", a+i), v[--a[i]].push_back(i);
	sort(a, a+m);
	int low = 1, high = m, ans;
	while(low <= high){
		int mid = low + ((high-low)>>1), ch = 1;
		for(int i = 0; i<m; ++i) if(i/mid > a[i] + d){ ch = 0; break;}
		if(ch) high = mid-1, ans = mid;
		else low = mid+1;
	}
	int cnt = 0;
	printf("%d\n", ans);
	for(int i = 0, j; i < m; i = j, ++cnt){
		for(j = i; j < m && (i/ans) == (j/ans); ++j) printf("%d ", v[a[j]].back() + 1), v[a[j]].pop_back();
		puts("0");
	}
	for(int j = 0; j<n-cnt-1; ++j) puts("0");
	printf("0");
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:6:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |  int n, d, m; scanf("%d %d %d", &n, &d, &m);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:7:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  for(int i = 0; i<m; ++i) scanf("%d", a+i), v[--a[i]].push_back(i);
      |                           ~~~~~^~~~~~~~~~~
jobs.cpp:19:36: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 |   for(j = i; j < m && (i/ans) == (j/ans); ++j) printf("%d ", v[a[j]].back() + 1), v[a[j]].pop_back();
      |                                  ~~^~~~~

Subtask #1
45.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 4564 KB Output isn't correct
2 Incorrect 16 ms 4472 KB Output isn't correct
3 Incorrect 16 ms 4560 KB Output isn't correct
4 Incorrect 16 ms 4564 KB Output isn't correct
5 Incorrect 16 ms 4564 KB Output isn't correct
6 Incorrect 16 ms 4564 KB Output isn't correct
7 Incorrect 19 ms 4560 KB Output isn't correct
8 Incorrect 16 ms 4560 KB Output isn't correct
9 Correct 19 ms 4700 KB Output is correct
10 Correct 20 ms 4688 KB Output is correct
11 Correct 21 ms 4692 KB Output is correct
12 Incorrect 40 ms 6568 KB Extra information in the output file
13 Correct 60 ms 9300 KB Output is correct
14 Incorrect 92 ms 11604 KB Extra information in the output file
15 Incorrect 97 ms 12884 KB Output isn't correct
16 Correct 137 ms 15860 KB Output is correct
17 Correct 161 ms 18688 KB Output is correct
18 Correct 166 ms 18792 KB Output is correct
19 Correct 185 ms 20560 KB Output is correct
20 Correct 166 ms 18772 KB Output is correct