#pragma region include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include #include #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) #define ALL(X) X.begin(), X.end() ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef std::pair PLL;// typedef std::pair PII;// #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)4e18+20; const LD PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; void solve(){ int N,M; cin >> N >> M; --N; vector< vector > A(M,vector(M,0) ); vector< vector< vector > >dp2(32, vector< vector >(M, vector(M,0) ) ); for(int r=0;r> A[r][c]; } } { for(int r=0;rB->C dp2[i][A][C] = max(dp2[i][A][C],dp2[i-1][A][B]+dp2[i-1][B][C] ); } } } } vector< vector > ans(M,vector(M,-1)); for(int i=0;i > next(M,vector(M,-1)); for(int A=0;A>= 1; ++bit; } LL AAA = 0; for(int r=0;r