#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) x.clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define pf push_front
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10;
int n, d, m;
vector<int> adj[N];
void solve_() {
cin >> n >> d >> m;
for(int i = 1; i <= m; i++) {
int curr; cin >> curr;
adj[curr].pb(i);
}
auto check = [&](int mid)->bool {
deque<pair<int, int>> q;
for(int i = 1; i <= n; i++) {
for (auto j: adj[i]) {
q.push_back({i, j});
}
int szi = sz(q);
for (int j = 0; j < min(mid, szi); j++) {
q.pop_front();
}
if (!q.empty() && q.front().first <= i - d) {
return false;
}
}
return (q.empty());
};
int ina = 1, inb = m, answ = -1;
while(ina <= inb) {
int mid = (ina + inb) / 2;
if(check(mid)) {
answ = mid;
inb = mid - 1;
} else {
ina = mid + 1;
}
}
deque<int> q;
cout << answ << endl;
for(int i = 1; i <= n; i++) {
for (auto j: adj[i]) {
q.push_back(j);
}
int szi = sz(q);
for(int j = 0; j < min(answ, szi); j++) {
printf("%d ", q.front());
q.pop_front();
}
printf("0\n");
}
}
int main() {
setIO("");
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
solve(test_cases);
return 0;
}
Compilation message
jobs.cpp: In function 'void setIO(std::string)':
jobs.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
73 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
4096 KB |
Output is correct |
| 2 |
Correct |
28 ms |
4040 KB |
Output is correct |
| 3 |
Correct |
25 ms |
4028 KB |
Output is correct |
| 4 |
Correct |
28 ms |
4052 KB |
Output is correct |
| 5 |
Correct |
25 ms |
3988 KB |
Output is correct |
| 6 |
Correct |
27 ms |
4140 KB |
Output is correct |
| 7 |
Correct |
26 ms |
4168 KB |
Output is correct |
| 8 |
Correct |
27 ms |
4036 KB |
Output is correct |
| 9 |
Correct |
34 ms |
4060 KB |
Output is correct |
| 10 |
Correct |
36 ms |
4044 KB |
Output is correct |
| 11 |
Correct |
23 ms |
3744 KB |
Output is correct |
| 12 |
Correct |
43 ms |
5032 KB |
Output is correct |
| 13 |
Correct |
76 ms |
6872 KB |
Output is correct |
| 14 |
Correct |
98 ms |
8340 KB |
Output is correct |
| 15 |
Correct |
106 ms |
9012 KB |
Output is correct |
| 16 |
Correct |
136 ms |
10756 KB |
Output is correct |
| 17 |
Correct |
170 ms |
12604 KB |
Output is correct |
| 18 |
Correct |
173 ms |
12600 KB |
Output is correct |
| 19 |
Correct |
209 ms |
13448 KB |
Output is correct |
| 20 |
Correct |
164 ms |
12704 KB |
Output is correct |
