# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831894 | 2023-08-20T17:03:23 Z | Darren0724 | Job Scheduling (CEOI12_jobs) | C++17 | 223 ms | 12816 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define x first #define y second const int mod=1e9+7; int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n,d,m;cin>>n>>d>>m; vector<int> v[n+1]; for(int i=1;i<=m;i++){ int p;cin>>p; v[p].push_back(i); } queue<int> q; int l=0,r=m; while(r-l>1){ int mi=(l+r)>>1; bool flag=0; for(int i=1;i<=n;i++){ for(int j=0;j<v[i].size();j++){ q.push(i); } for(int j=0;j<mi;j++){ if(q.size()==0){ break; } int p=q.front(); flag|=(i>p+d); q.pop(); } } if(q.size()||flag){ l=mi; } else{ r=mi; } } cout<<r<<endl; for(int i=0;i<n;i++){ cout<<0<<endl; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 2128 KB | Output is correct |
2 | Correct | 22 ms | 2200 KB | Output is correct |
3 | Correct | 22 ms | 2128 KB | Output is correct |
4 | Correct | 24 ms | 2128 KB | Output is correct |
5 | Correct | 22 ms | 2192 KB | Output is correct |
6 | Correct | 22 ms | 2196 KB | Output is correct |
7 | Correct | 22 ms | 2196 KB | Output is correct |
8 | Correct | 22 ms | 2204 KB | Output is correct |
9 | Correct | 115 ms | 4220 KB | Output is correct |
10 | Correct | 114 ms | 4212 KB | Output is correct |
11 | Incorrect | 13 ms | 1364 KB | Output isn't correct |
12 | Incorrect | 28 ms | 2448 KB | Output isn't correct |
13 | Incorrect | 39 ms | 4668 KB | Output isn't correct |
14 | Incorrect | 74 ms | 7532 KB | Output isn't correct |
15 | Incorrect | 62 ms | 6380 KB | Output isn't correct |
16 | Incorrect | 108 ms | 10040 KB | Output isn't correct |
17 | Incorrect | 128 ms | 12772 KB | Output isn't correct |
18 | Correct | 117 ms | 9388 KB | Output is correct |
19 | Correct | 223 ms | 11676 KB | Output is correct |
20 | Incorrect | 122 ms | 12816 KB | Output isn't correct |