oj.uz

답안 #1094071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094071 2024-09-28T11:37:45 Z Sunbae Job Scheduling (CEOI12_jobs) C++17
0 / 100
 187 ms 19024 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;
	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();
		printf("0\n");
	}
	for(int j = 0; j<n-cnt; ++j) puts("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:18:36: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   18 |   for(j = i; j < m && (i/ans) == (j/ans); ++j) printf("%d ", v[a[j]].back() + 1), v[a[j]].pop_back();
      |                                  ~~^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 4308 KB Expected EOLN
2 Incorrect 16 ms 4160 KB Expected EOLN
3 Incorrect 16 ms 4308 KB Expected EOLN
4 Incorrect 16 ms 4292 KB Expected EOLN
5 Incorrect 16 ms 4308 KB Expected EOLN
6 Incorrect 16 ms 4304 KB Expected EOLN
7 Incorrect 16 ms 4308 KB Expected EOLN
8 Incorrect 16 ms 4304 KB Expected EOLN
9 Incorrect 19 ms 4436 KB Expected EOLN
10 Incorrect 20 ms 4444 KB Expected EOLN
11 Incorrect 21 ms 4188 KB Expected EOLN
12 Incorrect 40 ms 5896 KB Expected EOLN
13 Incorrect 76 ms 8020 KB Expected EOLN
14 Incorrect 92 ms 9552 KB Expected EOLN
15 Incorrect 101 ms 11092 KB Expected EOLN
16 Incorrect 135 ms 13140 KB Expected EOLN
17 Incorrect 166 ms 18772 KB Expected EOLN
18 Incorrect 163 ms 15696 KB Expected EOLN
19 Incorrect 187 ms 17492 KB Expected EOLN
20 Incorrect 165 ms 19024 KB Expected EOLN