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 pb push_back
using namespace std;
const int N = 5e3 + 10;
int n, m, k, a[N], f[N][N];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; i++)
f[(i + 1) % n][m] = (a[i] != a[(i + 1) % n]);
for (int j = m - 1; j >= 0; --j)
for (int i = 0; i < n; ++i) {
int nxt = (i + 1) % n;
bool gd = 0;
if (a[i] != a[nxt]) {
for (int l = j + 1; l <= min(j + k, m); ++l)
gd |= !(f[nxt][l]);
} else {
for (int l = j + 1; l <= min(j + k, m); ++l)
gd |= f[nxt][l];
}
f[i][j] = gd;
}
for (int i = 0; i < n; i++)
cout << (f[i][0] ? a[i] : a[i] ^ 1) << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |