oj.uz

답안 #239326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239326 2020-06-15T11:41:24 Z dCoding Job Scheduling (CEOI12_jobs) C++14
10 / 100
 272 ms 13944 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>

#define ll long long int
#define F0R(i,n) for(auto i = 0; i < (n); i++)
#define FOR(i,a,b) for(auto i = (a); i <= (b); i++)
#define ROF(i,a,b) for(auto i = (a); i >= (b); i--)
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define vv vector
#define F first
#define S second
#define pb push_back
#define vi vector<int>

using namespace std;

const int MAXM = 1e6+5;
int n,d,m;
pii a[MAXM];
int ans[MAXM];

bool valid(int machines) {
	int mIdx = 1;
	FOR(i,1,n) {
		if(mIdx > m) break;
		FOR(j,mIdx,min(m,mIdx+machines)) {
			if(a[j].F+d < i)return false;
		}
		mIdx += machines;
	}
	return true;
}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> d >> m;
	FOR(i,1,m) cin >> a[i].F;
	FOR(i,1,m)a[i].S = i;
	sort(a+1,a+m+1);
	int lo = 1,hi = m,mid;
	while(lo < hi) {
		mid = lo+hi >> 1;
		if(valid(mid)) {
			hi = mid;
		} else {
			lo = mid+1;
		}
	}
	assert(lo == hi);
	int machines = lo;
	cout << machines << "\n";
	int	jobNumber = 1;
	F0R(i,n) {
		if(jobNumber > m) {
			cout << "0\n";
			continue;
		}
		F0R(j,machines) {
			if(jobNumber > m) {
				goto nextDay;
			} else {
				cout << a[jobNumber++].S << " ";
			}
		}
	
		cout << "0\n";
		nextDay:;
	}
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:58:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   mid = lo+hi >> 1;
         ~~^~~

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 1792 KB Output isn't correct
2 Incorrect 23 ms 1792 KB Output isn't correct
3 Incorrect 22 ms 1792 KB Output isn't correct
4 Incorrect 22 ms 1792 KB Output isn't correct
5 Incorrect 22 ms 1792 KB Output isn't correct
6 Incorrect 22 ms 1792 KB Output isn't correct
7 Incorrect 23 ms 1792 KB Output isn't correct
8 Incorrect 24 ms 1784 KB Output isn't correct
9 Incorrect 33 ms 1912 KB Unexpected end of file - int32 expected
10 Incorrect 34 ms 1912 KB Unexpected end of file - int32 expected
11 Incorrect 31 ms 1784 KB Unexpected end of file - int32 expected
12 Correct 59 ms 3192 KB Output is correct
13 Incorrect 87 ms 4728 KB Unexpected end of file - int32 expected
14 Correct 127 ms 6264 KB Output is correct
15 Incorrect 149 ms 7672 KB Output isn't correct
16 Incorrect 183 ms 9292 KB Unexpected end of file - int32 expected
17 Incorrect 207 ms 10616 KB Unexpected end of file - int32 expected
18 Incorrect 242 ms 12284 KB Unexpected end of file - int32 expected
19 Incorrect 272 ms 13944 KB Unexpected end of file - int32 expected
20 Incorrect 214 ms 10616 KB Unexpected end of file - int32 expected