Submission #1320404


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int H, W, ret, dp[400][400], r[400][400]; char c[400][400];
int solve(vector<int>a1, vector<int>a2) {
	for (int i = 0; i < 400; i++) { for (int j = 0; j < 400; j++)dp[i][j] = 1e9, r[i][j] = -1; }
	dp[a1.size()][a2.size()] = 0;
	for (int i = a1.size(); i >= 0; i--) {
		for (int j = a2.size(); j >= 0; j--) {
			if (r[i][j] != -1)continue;
			int c = 0;
			for (int k = min(i, j) - 1; k >= 0; k--) {
				c += (a1[a1.size() - i + k] == a2[a2.size() - j + k]);
				r[i - k][j - k] = c;
			}
			r[i][j] = c;
		}
	}
	for (int i = a1.size(); i >= 0; i--) {
		for (int j = a2.size(); j >= 0; j--) {
			if (i >= 1)dp[i - 1][j] = min(dp[i - 1][j], dp[i][j] + r[i][j]);
			if (j >= 1)dp[i][j - 1] = min(dp[i][j - 1], dp[i][j] + r[i][j]);
		}
	}
	return dp[0][0];
}
int main() {
	cin >> H >> W;
	for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++)cin >> c[i][j]; }
	for (int i = 0; i < W - 1; i++) {
		vector<int>p1, p2;
		for (int j = H - 1; j >= 0; j--)p1.push_back(c[j][i]);
		for (int j = H - 1; j >= 0; j--)p2.push_back(c[j][i + 1]);
		ret += solve(p1, p2);
	}
	cout << ret << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Friction
User E869120
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1210 Byte
Status AC
Exec Time 236 ms
Memory 1664 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 500 / 500
Status
AC × 5
AC × 20
AC × 41
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt
Subtask 0_000.txt, 0_001.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt
Case Name Status Exec Time Memory
0_000.txt AC 4 ms 1660 KB
0_001.txt AC 2 ms 1536 KB
0_002.txt AC 2 ms 1536 KB
0_003.txt AC 2 ms 1536 KB
0_004.txt AC 3 ms 1536 KB
1_005.txt AC 2 ms 1536 KB
1_006.txt AC 3 ms 1664 KB
1_007.txt AC 3 ms 1664 KB
1_008.txt AC 3 ms 1664 KB
1_009.txt AC 3 ms 1664 KB
1_010.txt AC 3 ms 1664 KB
1_011.txt AC 3 ms 1664 KB
1_012.txt AC 3 ms 1664 KB
1_013.txt AC 3 ms 1536 KB
1_014.txt AC 3 ms 1664 KB
1_015.txt AC 3 ms 1536 KB
1_016.txt AC 3 ms 1664 KB
1_017.txt AC 2 ms 1536 KB
1_018.txt AC 3 ms 1664 KB
1_019.txt AC 3 ms 1536 KB
1_020.txt AC 3 ms 1664 KB
1_021.txt AC 3 ms 1664 KB
1_022.txt AC 3 ms 1664 KB
2_023.txt AC 51 ms 1536 KB
2_024.txt AC 236 ms 1664 KB
2_025.txt AC 235 ms 1664 KB
2_026.txt AC 235 ms 1664 KB
2_027.txt AC 235 ms 1664 KB
2_028.txt AC 235 ms 1664 KB
2_029.txt AC 57 ms 1536 KB
2_030.txt AC 235 ms 1664 KB
2_031.txt AC 48 ms 1536 KB
2_032.txt AC 235 ms 1664 KB
2_033.txt AC 85 ms 1536 KB
2_034.txt AC 235 ms 1664 KB
2_035.txt AC 137 ms 1664 KB
2_036.txt AC 235 ms 1664 KB
2_037.txt AC 12 ms 1536 KB
2_038.txt AC 235 ms 1664 KB
2_039.txt AC 14 ms 1536 KB
2_040.txt AC 235 ms 1664 KB