Submission #1189721

#TimeUsernameProblemLanguageResultExecution timeMemory
1189721Muaath_5상형문자열 (IOI24_hieroglyphs)C++20
3 / 100
18 ms1980 KiB
#include <bits/stdc++.h>
#include "hieroglyphs.h"
using namespace std;

int N, M;

vector<int> lcs(vector<int> s, vector<int> t) {
  int LCS[N+2][M+2] = {};

  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      LCS[i][j] = max({LCS[i-1][j], LCS[i][j-1], LCS[i-1][j-1] + (s[i-1] == t[j-1])});
    }
  }

  vector<int> res;

  return res;
}


// A, B
// LCS(A, B) = S
// 



// i
// LCS1(i-1, j) + LCS2(i+1, j+1)
// 

vector<int> ucs(vector<int> A, vector<int> B) {
  N = A.size(), M = B.size();
  if (A == B) return A;
  return {-1};
  if (A.size() > 3000) return {-1};



  return vector<int>();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...