#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
pii R[1000000];
int n[100000],p[100000];
int main() {
int i;
int N,D,M;
scanf("%d %d %d",&N,&D,&M);
for (i = 0; i < M; i++) scanf("%d",&R[i].first),n[--R[i].first]++,R[i].second = i;
sort(R,R+M);
int j,l = 0,r = M;
while (l < r) {
int m = (l+r) / 2;
j = 0;
for (i = 0; i < N; i++) p[i] = n[i];
for (i = 0; i < N; i++) {
while ((j <= i) && (p[j] == 0)) j++;
if ((i-j) > D) break;
int c = m;
while ((j <= i) && (c > 0)) {
int t = min(p[j],c);
p[j] -= t,c -= t;
if (p[j] == 0) j++;
}
}
if (i == N) r = m;
else l = m+1;
}
j = 0;
printf("%d\n",l);
for (i = 0; i < N; i++) {
int c = l;
while ((j < M) && (R[j].first <= i) && (c > 0)) {
printf("%d ",R[j].second+1);
j++,c--;
}
printf("0\n");
}
return 0;
}
Compilation message
jobs.cpp: In function 'int main()':
jobs.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d",&N,&D,&M);
~~~~~^~~~~~~~~~~~~~~~~~~~~
jobs.cpp:64:70: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (i = 0; i < M; i++) scanf("%d",&R[i].first),n[--R[i].first]++,R[i].second = i;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
1788 KB |
Output is correct |
| 2 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 3 |
Correct |
24 ms |
1896 KB |
Output is correct |
| 4 |
Correct |
24 ms |
1956 KB |
Output is correct |
| 5 |
Correct |
24 ms |
1972 KB |
Output is correct |
| 6 |
Correct |
48 ms |
2064 KB |
Output is correct |
| 7 |
Correct |
29 ms |
2064 KB |
Output is correct |
| 8 |
Correct |
25 ms |
2132 KB |
Output is correct |
| 9 |
Correct |
58 ms |
2516 KB |
Output is correct |
| 10 |
Correct |
39 ms |
2576 KB |
Output is correct |
| 11 |
Correct |
38 ms |
2576 KB |
Output is correct |
| 12 |
Correct |
68 ms |
3472 KB |
Output is correct |
| 13 |
Correct |
108 ms |
4972 KB |
Output is correct |
| 14 |
Correct |
147 ms |
6416 KB |
Output is correct |
| 15 |
Correct |
169 ms |
7828 KB |
Output is correct |
| 16 |
Correct |
231 ms |
9404 KB |
Output is correct |
| 17 |
Correct |
247 ms |
10896 KB |
Output is correct |
| 18 |
Correct |
277 ms |
12304 KB |
Output is correct |
| 19 |
Correct |
342 ms |
14284 KB |
Output is correct |
| 20 |
Correct |
257 ms |
14284 KB |
Output is correct |
