Submission #1172785


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int H, W;
char C[300][300];
int dp[302][302], s[301][301];

int f(int x) {
  if (x < 0 || x+1 >= W) return 0;
  rep(i, H+1) rep(j, H+1) dp[i][j] = INF, s[i][j] = 0;
  for (int d=0; d<=H; d++) {
    // 0 d
    for (int a=0; a<=H; a++) {
      if (a+d+1>H) break;
      s[a+1][a+d+1] = s[a][a+d] + (C[x][a] == C[x+1][a+d]);
    }
    // d 0
    for (int a=0; a<=H; a++) {
      if (a+d+1>H) break;
      s[a+d+1][a+1] = s[a+d][a] + (C[x][a+d] == C[x+1][a]);
    }
  }

  dp[0][0] = 0;
  rep(a, H+1) {
    rep(b, H+1) {
      if (dp[a][b] == INF) continue;
      dp[a+1][b] = min(dp[a+1][b], dp[a][b] + s[H-a][H-b]);
      dp[a][b+1] = min(dp[a][b+1], dp[a][b] + s[H-a][H-b]);
    }
  }
  return dp[H][H];
}

int solve(int x, int l, int r) {
  // [l,x) x (x,r]
  if (l >= r) return 0;
  int m = f(x-1) + f(x);
  return m + solve((l+x-1)/2, l, x-1) + solve((x+1+r)/2, x+1, r);
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> H >> W;
  rep(y, H) {
    rep(x, W) {
      cin >> C[x][y];
    }
  }
  long long s = 0;
  rep(i, W) s += f(i);
  //cout << solve((W-1)/2, 0, W-1) << "\n";
  cout << s << "\n";
  return 0;
}

Submission Info

Submission Time
Task D - Friction
User funcsr
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1599 Byte
Status AC
Exec Time 206 ms
Memory 1024 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 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 3 ms 1024 KB
1_008.txt AC 3 ms 1024 KB
1_009.txt AC 3 ms 1024 KB
1_010.txt AC 3 ms 1024 KB
1_011.txt AC 3 ms 896 KB
1_012.txt AC 3 ms 1024 KB
1_013.txt AC 2 ms 640 KB
1_014.txt AC 3 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 3 ms 1024 KB
1_019.txt AC 2 ms 768 KB
1_020.txt AC 3 ms 1024 KB
1_021.txt AC 3 ms 1024 KB
1_022.txt AC 3 ms 1024 KB
2_023.txt AC 1 ms 384 KB
2_024.txt AC 205 ms 1024 KB
2_025.txt AC 205 ms 1024 KB
2_026.txt AC 205 ms 1024 KB
2_027.txt AC 206 ms 1024 KB
2_028.txt AC 206 ms 1024 KB
2_029.txt AC 9 ms 512 KB
2_030.txt AC 205 ms 1024 KB
2_031.txt AC 8 ms 512 KB
2_032.txt AC 206 ms 1024 KB
2_033.txt AC 48 ms 768 KB
2_034.txt AC 206 ms 1024 KB
2_035.txt AC 119 ms 1024 KB
2_036.txt AC 206 ms 1024 KB
2_037.txt AC 7 ms 640 KB
2_038.txt AC 206 ms 1024 KB
2_039.txt AC 5 ms 512 KB
2_040.txt AC 205 ms 1024 KB