/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < ll, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
//const ll mod = (ll) 998244353;
const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 1e5 + 5;
vector < ll > v[N];
vector < ll > a[N];
ll n , m, d;
ll check(ll machine){
queue < ii > q;
for(ll i = 1; i <= n; i++){
v[i].clear();
for(auto u : a[i]) q.push({u, i});
ll x = machine;
while(x && q.size()){
x--;
if(i - q.front().ss > d) return 0;
v[i].pb(q.front().ff);
q.pop();
}
}
if(q.size()) return 0;
return 1;
}
void solve(){
cin >> n >> d >> m;
for(ll i = 1; i <= m; i++){
ll A; cin >> A;
a[A].pb(i);
}
ll lo = 1, hg = 1e6 + 5, ans = hg;
while(lo <= hg){
ll mid = (lo + hg)/2;
if(check(mid)){
ans = mid, hg = mid - 1;
}else{
lo = mid + 1;
}
}
cout << ans << '\n';
for(ll i = 1; i <= n; i++){
for(auto u : v[i]) cout << u << ' ';
cout << "0\n";
}
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre(N);
ll T = 1, CT = 0; //cin >> T;
while(T--){
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}
Compilation message
jobs.cpp: In function 'int main()':
jobs.cpp:128:15: warning: unused variable 'CT' [-Wunused-variable]
128 | ll T = 1, CT = 0; //cin >> T;
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
7680 KB |
Output is correct |
| 2 |
Correct |
32 ms |
7736 KB |
Output is correct |
| 3 |
Correct |
34 ms |
7632 KB |
Output is correct |
| 4 |
Correct |
33 ms |
7660 KB |
Output is correct |
| 5 |
Correct |
32 ms |
7636 KB |
Output is correct |
| 6 |
Correct |
30 ms |
7732 KB |
Output is correct |
| 7 |
Correct |
30 ms |
7668 KB |
Output is correct |
| 8 |
Correct |
29 ms |
7664 KB |
Output is correct |
| 9 |
Correct |
35 ms |
7192 KB |
Output is correct |
| 10 |
Correct |
35 ms |
7252 KB |
Output is correct |
| 11 |
Correct |
28 ms |
6860 KB |
Output is correct |
| 12 |
Correct |
55 ms |
8636 KB |
Output is correct |
| 13 |
Correct |
79 ms |
11400 KB |
Output is correct |
| 14 |
Correct |
133 ms |
13552 KB |
Output is correct |
| 15 |
Correct |
126 ms |
14316 KB |
Output is correct |
| 16 |
Correct |
163 ms |
16312 KB |
Output is correct |
| 17 |
Correct |
214 ms |
20548 KB |
Output is correct |
| 18 |
Correct |
203 ms |
19364 KB |
Output is correct |
| 19 |
Correct |
234 ms |
20060 KB |
Output is correct |
| 20 |
Correct |
215 ms |
20560 KB |
Output is correct |
