oj.uz

답안 #1094073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094073 2024-09-28T11:40:24 Z Sunbae Job Scheduling (CEOI12_jobs) C++17
0 / 100
 191 ms 20640 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"); 
	cout<<endl;
}

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 24 ms 4516 KB Expected EOLN
2 Incorrect 16 ms 4564 KB Expected EOLN
3 Incorrect 16 ms 4608 KB Expected EOLN
4 Incorrect 19 ms 4564 KB Expected EOLN
5 Incorrect 21 ms 4564 KB Expected EOLN
6 Incorrect 18 ms 4564 KB Expected EOLN
7 Incorrect 16 ms 4376 KB Expected EOLN
8 Incorrect 15 ms 4564 KB Expected EOLN
9 Incorrect 21 ms 4696 KB Expected EOLN
10 Incorrect 19 ms 4852 KB Expected EOLN
11 Incorrect 25 ms 4700 KB Expected EOLN
12 Incorrect 44 ms 6484 KB Expected EOLN
13 Incorrect 70 ms 9296 KB Expected EOLN
14 Incorrect 94 ms 11604 KB Expected EOLN
15 Incorrect 112 ms 12880 KB Expected EOLN
16 Incorrect 140 ms 15956 KB Expected EOLN
17 Incorrect 164 ms 18620 KB Expected EOLN
18 Incorrect 163 ms 18768 KB Expected EOLN
19 Incorrect 191 ms 20640 KB Expected EOLN
20 Incorrect 162 ms 18768 KB Expected EOLN