oj.uz

Submission #742787

# Submission time Handle Problem Language Result Execution time Memory
742787 2023-05-17T00:07:59 Z joesephdiver Job Scheduling (CEOI12_jobs) C++17
0 / 100
 363 ms 15772 KB 
#include <bits/stdc++.h>
#define ll long long
#define FOR(x, n) for(int x = 0; x < n; x++)
#define LFOR(x, l, r) for(int x = l; x < r; x++)
#define last(x) x[x.size()-1]
#define negind(x, i) x[x.size()-i]
#define pii pair<int, int>
#define ins insert
#define pb push_back
#define pf push_front
#define s(x) set(x)
#define v(x) vector<x>
#define uom(x, y) unordered_map<x, y>
#define triplet(x) tuple<x, x, x>
#define all(x) x.begin(), x.end()
#define inf INT_MAX

using namespace std;

inline void solve(){
    int N, D, M;
	cin >> N >> D >> M;
	pii a[M];
	FOR(i, M){
		cin >> a[i].first;
		a[i].second = i+1;
	}
	sort(a, a+M);
	int l = 1, r = 1000000, sol;
	while(l <= r){
		int mid = l + (r-l)/2, index = mid-1, day = 1, delay = 0;
		while(index < M){
			delay = max(delay, day-a[index].first);
			day++;
			FOR(i, mid){
				if(index >= M || a[index+1].first > day) break;
				index++;
			}
		}
		if(delay <= D) sol = mid, r = mid - 1;
		else l = mid+1;
	}
	cout << sol << endl;
	int index = 0;
	while(index < M){
		LFOR(i, index, min(M, index+sol)) cout << a[i].second << " "; 
		index += sol;
		cout << "0\n";
	}
	FOR(i, N-ceil((double)M/sol)) cout << "0\n";
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	solve();
	return 0;
}

Compilation message

jobs.cpp: In function 'void solve()':
jobs.cpp:50:15: warning: 'sol' may be used uninitialized in this function [-Wmaybe-uninitialized]
   50 |  FOR(i, N-ceil((double)M/sol)) cout << "0\n";
      |               ^

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 97 ms 1868 KB Output isn't correct
2 Incorrect 107 ms 1888 KB Output isn't correct
3 Incorrect 102 ms 1900 KB Output isn't correct
4 Incorrect 102 ms 1944 KB Output isn't correct
5 Incorrect 119 ms 1884 KB Output isn't correct
6 Incorrect 97 ms 1996 KB Output isn't correct
7 Incorrect 103 ms 1888 KB Output isn't correct
8 Incorrect 100 ms 1884 KB Output isn't correct
9 Incorrect 113 ms 2100 KB Output isn't correct
10 Incorrect 111 ms 2092 KB Output isn't correct
11 Incorrect 111 ms 1980 KB Output isn't correct
12 Incorrect 151 ms 3900 KB Output isn't correct
13 Incorrect 155 ms 5692 KB Output isn't correct
14 Incorrect 188 ms 8020 KB Output isn't correct
15 Incorrect 139 ms 9452 KB Output isn't correct
16 Incorrect 239 ms 11180 KB Output isn't correct
17 Incorrect 313 ms 12652 KB Output isn't correct
18 Incorrect 307 ms 14064 KB Output isn't correct
19 Incorrect 363 ms 15772 KB Output isn't correct
20 Incorrect 275 ms 12552 KB Output isn't correct