제출 #648492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648492		inksamurai	Vođe (COCI17_vode)	C++17	72 / 120	3101 ms	524288 KiB

vode

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3Rz7lEu ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3Rz7lEu;
	int n,m,k;
	cin>>n>>m>>k;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	vec(vec(vi)) dp(n,vec(vi)(m+1,vi(2,-1)));
	auto dfs=[&](auto self,int i,int j,int t)->int{
		if(dp[i][j][t]!=-1) return dp[i][j][t];
		if(j==m-1) return dp[i][j][t]=0;
		int res=0;
		rng(ad,1,k+1){
			int ni=(i+1)%n;
			int nj=j+ad;
			if(nj<m){
				int val=self(self,ni,nj,a[ni]);
				if(val){
					if(a[ni]==t){
						res=1;
					}
				}else{
					if(a[ni]!=t){
						res=1;
					}
				}
			}
		}
		return dp[i][j][t]=res;
	};
	rep(i,n){
		int val=dfs(dfs,i,0,a[i]);
		// cout<<val<<" ";
		cout<<(val^a[i]^1)<<" ";
	}
}

• 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: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12