Educational Codeforces Round 136 (Rated for Div. 2) E.Cleaning Robot(基础dp)
题目两行n列,也就是2*n(n#include#includeusingnamespacestd;typedeflonglongll;typedefpairP;constintN=2e5+10;chars[2][N];intn,one,dp[N][2];intsolve(intx,inty){if(x>=n-1)return0;if(~dp[x][y])returndp[x][y];int&ans