Submission #1696306

---

Source Code Expand

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

typedef long long cat;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int H,W;
	cin >> H >> W;
	vector<string> S(H);
	for(int i =0; i < H; i++) cin >> S[i];

	int ans =0;
	for(int i =0; i < W-1; i++) {
		vector< vector<int> > cost0(H+1,vector<int>(H+1,0));
		for(int j =H-1; j >= 0; j--) for(int k =H-1; k >= 0; k--)
			cost0[j][k] =cost0[j+1][k+1]+(S[H-1-j][i] == S[H-1-k][i+1]);
		vector< vector<int> > cost(H+1,vector<int>(H+1,OVER9000));
		cost[0][0] =0;
		for(int j =0; j <= H; j++) for(int k =0; k <= H; k++) {
			if(j < H) cost[j+1][k] =min(cost[j+1][k],cost[j][k]+cost0[j][k]);
			if(k < H) cost[j][k+1] =min(cost[j][k+1],cost[j][k]+cost0[j][k]);
		}
		ans +=cost[H][H];
	}
	cout << ans << "\n";
	return 0;}

// look at my code
// my code is amazing

Submission Info

Judge Result