// Om Namah Shivaya
// GM in 123 days
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
bool dp[5005][5005];
int suff[5005][5005];
void solve(int test_case)
{
int n, m, k; cin >> n >> m >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
rev(j, m - 2, 0) {
rep(i, n) {
int nxt = (i + 1) % n;
int l = j + 1, r = min(j + k, m);
int len = r - l + 1;
int ones = suff[nxt][l] - suff[nxt][r + 1];
int zeros = len - ones;
if (a[i] == a[nxt]) {
dp[i][j] = ones > 0;
}
else {
dp[i][j] = zeros > 0;
}
suff[i][j] = suff[i][j + 1] + dp[i][j];
/*
naive O(k) dp transition:
rep1(x, k) {
if (j + x >= m) conts;
ll nxt = (i + 1) % n;
if (a[i] == a[nxt]) {
if (dp[nxt][j + x] == 1) {
dp[i][j] = 1;
}
}
else {
if (dp[nxt][j + x] == 0) {
dp[i][j] = 1;
}
}
}
*/
}
}
rep(i, n) {
if (dp[i][0]) cout << a[i] << " ";
else cout << (a[i] ^ 1) << " ";
}
cout << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
Compilation message
vode.cpp: In function 'void usaco(std::string)':
vode.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vode.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
852 KB |
Output is correct |
| 3 |
Correct |
1 ms |
724 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2004 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2004 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2388 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2260 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2516 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4052 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3796 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
5076 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4692 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4436 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4564 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
62 ms |
27848 KB |
Output is correct |
| 2 |
Correct |
82 ms |
29644 KB |
Output is correct |
| 3 |
Correct |
493 ms |
118332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
162 ms |
50420 KB |
Output is correct |
| 2 |
Correct |
430 ms |
117928 KB |
Output is correct |
| 3 |
Correct |
166 ms |
54732 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
541 ms |
119044 KB |
Output is correct |
| 2 |
Correct |
4 ms |
3028 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1876 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
544 ms |
119876 KB |
Output is correct |
| 2 |
Correct |
454 ms |
120216 KB |
Output is correct |
| 3 |
Correct |
612 ms |
120580 KB |
Output is correct |
