Submission #1933775


Source Code Expand

#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;

const int N = 300 + 10;
char s[N][N];
int cost[N][N], dp[N][N];
int n, m;

int solve(int x, int y) {
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= n; ++j) {
      if (i == 0 || j == 0) {
        cost[i][j] = 0;
      } else {
        cost[i][j] = cost[i - 1][j - 1] +
          (s[i - 1][x] == s[j - 1][y]);
      }
    }
  }
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= n; ++j) {
      if (i == 0 || j == 0) {
        dp[i][j] = 0;
      } else {
        dp[i][j] = cost[i][j] + min(dp[i - 1][j], dp[i][j - 1]);
      }
    }
  }
  return dp[n][n];
}

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%s", s[i]);
  }
  int ret = 0;
  for (int i = 1; i < m; ++i) {
    ret += solve(i - 1, i);
  }
  printf("%d\n", ret);
  return 0;
}

Submission Info

Submission Time
Task D - Friction
User cuiaoxiang
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1796 Byte
Status AC
Exec Time 126 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:71:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &m);
                        ^
./Main.cpp:73:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s[i]);
                      ^

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 2 ms 1024 KB
1_007.txt AC 2 ms 1024 KB
1_008.txt AC 2 ms 1024 KB
1_009.txt AC 2 ms 1024 KB
1_010.txt AC 2 ms 1024 KB
1_011.txt AC 2 ms 1024 KB
1_012.txt AC 2 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 2 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 2 ms 1024 KB
2_023.txt AC 1 ms 256 KB
2_024.txt AC 126 ms 1024 KB
2_025.txt AC 126 ms 1024 KB
2_026.txt AC 126 ms 1024 KB
2_027.txt AC 126 ms 1024 KB
2_028.txt AC 126 ms 1024 KB
2_029.txt AC 6 ms 384 KB
2_030.txt AC 126 ms 1024 KB
2_031.txt AC 5 ms 384 KB
2_032.txt AC 126 ms 1024 KB
2_033.txt AC 29 ms 640 KB
2_034.txt AC 126 ms 1024 KB
2_035.txt AC 73 ms 1024 KB
2_036.txt AC 126 ms 1024 KB
2_037.txt AC 4 ms 640 KB
2_038.txt AC 126 ms 1024 KB
2_039.txt AC 3 ms 512 KB
2_040.txt AC 126 ms 1024 KB