제출 #200192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200192		Saboon	Vođe (COCI17_vode)	C++14	120 / 120	898 ms	106168 KiB

vode

#include <iostream>

using namespace std;

const int maxn = 5e3 + 500;
int dp[maxn][maxn];
int num[2][maxn];
int ani[maxn];

int main() {
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++)
		cin >> ani[i]; // 0 is a sheep, 1 is a goat
	for (int i = 0; i < n; i++){
		dp[i][m - 1] = (ani[i] ^ 1);
		num[ani[i] ^ 1][i] ++;
	}
	for (int j = m - 2; j >= 0; j--){
		for (int i = 0; i < n; i++){
			int nex = (i + 1) % n;
			if (num[ani[i]][nex])
				dp[i][j] = ani[i];
			else
				dp[i][j] = ani[i] ^ 1;
//			cout << i << " " << j << " " << dp[i][j] << endl;
		}
		for (int i = 0; i < n; i++){
			num[dp[i][j]][i] ++;
			if (j + k < m) 
				num[dp[i][j + k]][i] --;
		}
	}
	for (int i = 0; i < n; i++)
		cout << dp[i][0] << " ";
	
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12