Submission #1317514
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int DIM = 3e2 + 5; char mat[DIM][DIM]; int cst[DIM][DIM], dp[DIM][DIM]; int main( void ) { int n, m; scanf( "%d %d", &n, &m ); for( int i = 1; i <= n; i ++ ) scanf( "%s", mat[i] + 1 ); int ans = 0; for( int k = 1; k <= m - 1; k ++ ) { for( int i = 0; i <= n; i ++ ) { cst[i][0] = 0; for( int j = i + 1; j <= n; j ++ ) cst[i][0] += ( mat[j - i][k] == mat[j][k + 1] ); } for( int i = 0; i <= n; i ++ ) { cst[0][i] = 0; for( int j = i + 1; j <= n; j ++ ) cst[0][i] += ( mat[j][k] == mat[j - i][k + 1] ); } for( int i = 1; i <= n; i ++ ) for( int j = 1; j <= n; j ++ ) cst[i][j] = cst[i - 1][j - 1] - ( mat[n - i + 1][k] == mat[n - j + 1][k + 1] ); for( int i = 1; i <= n; i ++ ) dp[i][0] = dp[i - 1][0] + cst[i - 1][0]; for( int i = 1; i <= n; i ++ ) dp[0][i] = dp[0][i - 1] + cst[0][i - 1]; for( int i = 1; i <= n; i ++ ) for( int j = 1; j <= n; j ++ ) dp[i][j] = min( dp[i - 1][j] + cst[i - 1][j], dp[i][j - 1] + cst[i][j - 1] ); ans += dp[n][n]; } printf( "%d\n", ans ); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Friction |
User | EmanuelNrx |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1470 Byte |
Status | AC |
Exec Time | 158 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%d %d", &n, &m ); ^ ./Main.cpp:15:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%s", mat[i] + 1 ); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 500 / 500 | ||||||
Status |
|
|
|
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 | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
0_003.txt | AC | 1 ms | 256 KB |
0_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 3 ms | 1024 KB |
1_007.txt | AC | 2 ms | 1024 KB |
1_008.txt | AC | 3 ms | 1024 KB |
1_009.txt | AC | 2 ms | 1024 KB |
1_010.txt | AC | 3 ms | 1024 KB |
1_011.txt | AC | 2 ms | 1024 KB |
1_012.txt | AC | 3 ms | 1024 KB |
1_013.txt | AC | 2 ms | 768 KB |
1_014.txt | AC | 2 ms | 1024 KB |
1_015.txt | AC | 2 ms | 768 KB |
1_016.txt | AC | 3 ms | 1024 KB |
1_017.txt | AC | 1 ms | 384 KB |
1_018.txt | AC | 2 ms | 1024 KB |
1_019.txt | AC | 2 ms | 768 KB |
1_020.txt | AC | 2 ms | 1024 KB |
1_021.txt | AC | 2 ms | 1024 KB |
1_022.txt | AC | 3 ms | 1024 KB |
2_023.txt | AC | 1 ms | 256 KB |
2_024.txt | AC | 158 ms | 1024 KB |
2_025.txt | AC | 158 ms | 1024 KB |
2_026.txt | AC | 158 ms | 1024 KB |
2_027.txt | AC | 158 ms | 1024 KB |
2_028.txt | AC | 158 ms | 1024 KB |
2_029.txt | AC | 7 ms | 384 KB |
2_030.txt | AC | 158 ms | 1024 KB |
2_031.txt | AC | 6 ms | 384 KB |
2_032.txt | AC | 158 ms | 1024 KB |
2_033.txt | AC | 37 ms | 640 KB |
2_034.txt | AC | 158 ms | 1024 KB |
2_035.txt | AC | 91 ms | 1024 KB |
2_036.txt | AC | 158 ms | 1024 KB |
2_037.txt | AC | 5 ms | 640 KB |
2_038.txt | AC | 158 ms | 1024 KB |
2_039.txt | AC | 4 ms | 512 KB |
2_040.txt | AC | 158 ms | 1024 KB |