Submission #1221518

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221518		nibert	Hieroglyphs (IOI24_hieroglyphs)	C++20	0 / 100	949 ms	2162688 KiB

hieroglyphs

#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;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 3
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 16
• Subtask 5: 0 / 14
• Subtask 6: 0 / 42