Educational Codeforces Round 62 (Rated for Div. 2) E. Palindrome-less Arrays

CodeCraft-19 and Codeforces Round #537 (Div. 2) A, B, C

---

E. Palindrome-less Arrays

题目链接

题面：

划掉

题意：

给定N，K和一个长度为N的由1到K或者-1组成的数组，要求将所有-1替换成1到K的一个数，使得
$a_i!=a_{i+2}$，问有多少种情况。

思路：

易得，奇\偶数位置数的可能情况只与奇\偶数位置有关，故分别考虑即可。
而对于每一段数，可以分割成 # -1 … -1 #，#为空或者某个不为-1的数，-1的出现可以是0也可以是多个，对于上述片段分类讨论即可获得答案，具体分类讨论情况见代码。

AC代码：

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include <bitset>

using namespace std;

#define FSIO  ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define DEBUG(a)   cout<<"DEBUG: "<<(a)<<endl;
#define ll  long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define MP make_pair
#define X  first
#define Y  second
#define REP(i,st,ed)    for(int i=st;i<=ed;++i)
#define IREP(i,st,ed)   for(int i=st;i>=ed;--i)
#define TCASE(T)    cin>>T;while(T--)

const int MAXN = 200005;
const ll MOD = 998244353  ;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 1e9+7;
const double PI = acos(-1.0);
const double EPS = 1e-8;

int _;

using namespace std;

int aa[MAXN];
ll ram[MAXN];


ll powermod(ll n,ll k, ll MOD)
{
    ll ans=1;
    while(k)
    {
        if(k&1)
        {
            ans=((ans%MOD)*(n%MOD))%MOD;
        }
        n=((n%MOD)*(n%MOD))%MOD;
        k>>=1;
    }
    return ans;
}

ll dp[MAXN][2];
vector<int> togo;
ll N, K;

ll solve()
{
    if(togo.size()==0)  return 1;
    else if(togo.size()==1)
    {
        if(togo[0]==-1) return K;
        else    return 1;
    }

    int first = togo[0];
    int last = togo[togo.size()-1];
    if(first==last&&first!=-1&&togo.size()==2)  return 0;
    if(first==-1&&last==-1) return powermod(K-1,togo.size()-1,MOD)*K%MOD;
    if(first==-1||last==-1) return powermod(K-1,togo.size()-1,MOD);

    int len = togo.size();

    dp[0][0] = 1;
    dp[1][0] = K-2+(first==last);
    dp[1][1] = !(first==last);
    for(int i=2;i+1<len;++i)
    {
        if(togo[i+1]!=last)
        {
            dp[i][1] = dp[i-1][0];
            dp[i][0] = (dp[i-1][1]*(K-1)%MOD+dp[i-1][0]*(K-2)%MOD)%MOD;
        }
        else
        {
            //dp[i][1] = dp[i-1][0];
            dp[i][0] = (dp[i-1][1]*(K-1)%MOD+dp[i-1][0]*(K-2)%MOD)%MOD;
        }
    }
    return dp[len-2][0];
}


int main()
{
    //freopen("test.in","r+",stdin);
    //freopen("test.out","w+",stdout);
    FSIO;
    while(cin>>N>>K)
    {
        ll res = -1;
        memset(ram,-1,sizeof(ram));
        REP(i,1,N)  cin>>aa[i];
        togo.clear();
        for(int i=1;i<=N;i+=2)
        {
            if(aa[i]!=-1)
            {
                togo.pb(aa[i]);
                if(res==-1) res = solve();
                else    res = res*solve()%MOD;
                togo.clear();
                togo.pb(aa[i]);
            }
            else    togo.pb(aa[i]);
        }
        if(!togo.empty())
        {
            if(res==-1) res = solve();
            else    res = res*solve()%MOD;
            togo.clear();
        }
        for(int i=2;i<=N;i+=2)
        {
            if(aa[i]!=-1)
            {
                togo.pb(aa[i]);
                if(res==-1) res = solve();
                else    res = res*solve()%MOD;
                togo.clear();
                togo.pb(aa[i]);
            }
            else    togo.pb(aa[i]);
        }
        if(!togo.empty())
        {
            if(res==-1) res = solve();
            else    res = res*solve()%MOD;
            togo.clear();
        }
        cout<<res%MOD<<endl;
    }

    return 0;
}