Submission #18738675


Source Code Expand

Copy
// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#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>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
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;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(m);
  for (auto& x : a) cin >> x;
  for (auto& x : b) cin >> x;
  vector<vector<int>> dp(n + 1, vector<int>(m + 1));
  for (int i = 1; i <= n; ++i) dp[i][0] = i;
  for (int j = 1; j <= m; ++j) dp[0][j] = j;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      dp[i][j] = inf<int>;
      dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + (a[i - 1] == b[j - 1] ? 0 : 1));
      dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
      dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1);
      trace(i, j, dp[i][j]);
    }
  }
  cout << dp[n][m] << '\n';
  return 0;
}

Submission Info

Submission Time
Task E - Sequence Matching
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 500
Code Size 3189 Byte
Status AC
Exec Time 22 ms
Memory 7128 KB

Compile Error

./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
1 warning generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All extreme_00.txt, extreme_01.txt, extreme_02.txt, extreme_03.txt, extreme_04.txt, extreme_05.txt, extreme_06.txt, handmade_00.txt, handmade_01.txt, pattern_00.txt, pattern_01.txt, pattern_02.txt, pattern_03.txt, pattern_04.txt, pattern_05.txt, pattern_06.txt, pattern_07.txt, pattern_08.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
extreme_00.txt AC 13 ms 7128 KB
extreme_01.txt AC 16 ms 6988 KB
extreme_02.txt AC 15 ms 7112 KB
extreme_03.txt AC 15 ms 7124 KB
extreme_04.txt AC 16 ms 7072 KB
extreme_05.txt AC 4 ms 3040 KB
extreme_06.txt AC 4 ms 3256 KB
handmade_00.txt AC 2 ms 3028 KB
handmade_01.txt AC 2 ms 3164 KB
pattern_00.txt AC 22 ms 7064 KB
pattern_01.txt AC 17 ms 7072 KB
pattern_02.txt AC 16 ms 7052 KB
pattern_03.txt AC 8 ms 3884 KB
pattern_04.txt AC 4 ms 3348 KB
pattern_05.txt AC 4 ms 3404 KB
pattern_06.txt AC 8 ms 4380 KB
pattern_07.txt AC 6 ms 3652 KB
pattern_08.txt AC 9 ms 4060 KB
random_00.txt AC 14 ms 7128 KB
random_01.txt AC 16 ms 6996 KB
random_02.txt AC 16 ms 7008 KB
random_03.txt AC 4 ms 3136 KB
random_04.txt AC 2 ms 3208 KB
random_05.txt AC 4 ms 3388 KB
random_06.txt AC 8 ms 4244 KB
random_07.txt AC 3 ms 3640 KB
random_08.txt AC 6 ms 3900 KB
random_09.txt AC 9 ms 4824 KB
sample_01.txt AC 2 ms 3060 KB
sample_02.txt AC 4 ms 3168 KB
sample_03.txt AC 2 ms 3008 KB