# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930094 | ByeWorld | Job Scheduling (CEOI12_jobs) | C++14 | 3033 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
//#define int long long
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int INF = 1e9+10;
const int MAXN = 1e6+10;
int a[MAXN];
vector <pii> vec;
vector <vector<int>> ans;
int n, m, k;
signed main() {
cin >> k >> m >> n;
for(int i=1; i<=n; i++){
cin >> a[i]; vec.pb({a[i], i});
}
sort(vec.begin(), vec.end());
int mn = -1, cnt = 1;
for(int i=0; i<n; i+=m){
vector <int> te;
for(int j=0; j<m && i+j<n; j++){
mn = max(mn, cnt-vec[i+j].fi+1);
te.pb(vec[i+j].se);
}
ans.pb(te);
cnt++;
}
cout << mn << '\n';
for(auto vec : ans){
for(auto in : vec){
cout << in << ' ';
}
cout << "0\n";
}
for(int i=0; i<k-ans.size(); i++) cout << "0\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |