Submission #236789

#	Time	Username	Problem	Language	Result	Execution time	Memory
236789		topovik	Vođe (COCI17_vode)	C++14	72 / 120	3106 ms	96248 KiB

vode

#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const ll oo = 1e9+7;
const ll N  = 5000+2;

int dp[N][N];
int b[N];
int n,m,k;

int Rec(int x,int y)
{
    if (y==m)        return 0;
    if (dp[x][y]<oo) return dp[x][y];
    int nx=(x+1)%n;
    bool g0=0,g1=0;
    for (int i=1; i<=k && i+y<=m; i++)
    {
        int c=Rec(nx,i+y);
        if (c==0) g0=1;
        if (c==1) g1=1;
    }
    if (b[x]==b[nx]) {
        if (g1==1) dp[x][y]=1;
        else       dp[x][y]=0;
    }
    else    {
        if (g0==1) dp[x][y]=1;
        else       dp[x][y]=0;
    }
    return dp[x][y];
}

int main()
{
    cin>>n>>m>>k;
    for (int i=0; i<n; i++) cin>>b[i];
    m--;
    for (int i=0; i<n; i++)
        for (int j=0; j<=m; j++) dp[i][j]=oo;
    for (int i=0; i<n; i++)
    {
        cout<<(Rec(i,0)^1^b[i])<<" ";
    }
}

• 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