| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1221513 | nibert | 메시지 (IOI24_message) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> ucs(vector<int> A, vector<int> B) {
int N = A.size(), M = B.size();
vector<vector<int>> dp(N + 1, vector<int>(M + 1, 0));
for (int i = N - 1; i >= 0; --i) {
for (int j = M - 1; j >= 0; --j) {
if (A[i] == B[j]) {
dp[i][j] = 1 + dp[i + 1][j + 1];
} else {
dp[i][j] = max(dp[i + 1][j], dp[i][j + 1]);
}
}
}
vector<int> lcs;
int i = 0, j = 0;
bool multiple = false;
while (i < N && j < M) {
if (A[i] == B[j]) {
lcs.push_back(A[i]);
i++;
j++;
} else if (dp[i + 1][j] == dp[i][j] && dp[i][j + 1] == dp[i][j]) {
multiple = true;
break;
} else if (dp[i + 1][j] == dp[i][j]) {
i++;
} else {
j++;
}
}
if (multiple) return {-1};
return lcs;
}
int main(){
ifstream input("input.txt");
ofstream output("output.txt");
int N, M;
input >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; ++i) input >> A[i];
for (int i = 0; i < M; ++i) input >> B[i];
vector<int> result = ucs(A, B);
output << result.size() << "\n";
for (int value : result) {
output << value << " ";
}
output << "\n";
input.close();
output.close();
return 0;
}