Submission #699002

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
6990022023-02-15 08:28:12nguyenneheheJob Scheduling (CEOI12_jobs)C++14
100 / 100
251 ms20200 KiB
#include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 1, M = 1e6 + 1;
int n, d, m;
pair<int, int> a[M];
vector<int> ans[N];
bool good(int k) {
int j = 1;
for (int i = 1; i <= n; ++i) {
for (int x = 1; x <= k; ++x) {
if (a[j].first > i) break;
if (a[j].first + d < i) return false;
if (j == m) return true;
++j;
}
}
return false;
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> d >> m;
for (int i = 1; i <= m; ++i) {
cin >> a[i].first;
a[i].second = i;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...