oj.uz

Submission #648492

# Submission time Handle Problem Language Result Execution time Memory
648492 2022-10-06T17:43:10 Z inksamurai Vođe (COCI17_vode) C++17
72 / 120
 3000 ms 524288 KB 
#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.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 576 KB Output is correct
3 Correct 1 ms 572 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4820 KB Output is correct
2 Correct 15 ms 1368 KB Output is correct
3 Correct 68 ms 4308 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3796 KB Output is correct
2 Correct 73 ms 3496 KB Output is correct
3 Correct 11 ms 4040 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 6868 KB Output is correct
2 Correct 137 ms 8020 KB Output is correct
3 Correct 24 ms 7636 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 12148 KB Output is correct
2 Correct 76 ms 10964 KB Output is correct
3 Correct 336 ms 9332 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10816 KB Output is correct
2 Correct 114 ms 11456 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1036 ms 163476 KB Output is correct
2 Execution timed out 3087 ms 184100 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3101 ms 392256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 454 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 430 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -