이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int mx = 5005;
int a[mx], suff[mx][mx];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m,k;
	cin >> n >> m >> k;
	for (int q = 0; q < n; q++) cin >> a[q];
	for (int q = 0; q < n; q++) suff[q][m] = 1-a[q];
	for (int q = m-1; q >= 0; q--) {
		for (int w = 0; w < n; w++) {
			int e = w == n-1 ? 0 : w+1;
			int lo = q+1, hi = min(q+k,m);
			int z = suff[e][lo]-suff[e][hi+1];
			bool win = false;
			if (a[e] == 1 && z > 0) win = true;
			if (a[e] == 0 && z < hi-lo+1) win = true;
			int res = win ? a[e] : 1 - a[e];
			suff[w][q] = suff[w][q+1]+res;
		}
	}
	for (int q = 0; q < n; q++) {
		int w = q == 0 ? n-1 : q-1;
		cout << suff[w][0]-suff[w][1] << ' ';
	}
	cout << '\n';
	return 0;
}
| # | 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... |