oj.uz

답안 #1105582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105582 2024-10-26T19:46:53 Z coolboy19521 Bajka (COCI20_bajka) C++17
0 / 70
 1000 ms 4580 KB 
#include "bits/stdc++.h"

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    if (m > n) {
        cout << "-1\n";
        return 0;
    }

    string s, t;
    cin >> s >> t;

    int alp = 27;

    vector<vector<int>> sm(alp);

    for (int i = 0; i < n; i ++) {
        sm[s[i] - 'a'].push_back(i);
    }

    int maxr = 1e9;
    int mn = maxr;

    auto dijk = [&](){
        priority_queue<tuple<int,int,int>> q;
        map<pair<int,int>,int> vi;

        for (int i : sm[t[0] - 'a']) {
            q.emplace(0, 0, i);
            vi[{0, i}] = 0;
        }

        while (!q.empty()) {
            auto [ds, at, ix] = q.top();
            q.pop();

            if (ds != vi[{at, ix}]) {
                continue;
            }

            if (at == m - 1) {
                mn = min(mn, -ds);
            } else {
                for (int i : sm[t[at] - 'a']) {
                    if (!vi.count({at, i}) || ds - abs(i - ix) > vi[{at, i}]) {
                        q.emplace(ds - abs(i - ix), at, i);
                        vi[{at, i}] = ds - abs(i - ix);
                    }
                }
                for (int i : {-1, 1}) {
                    if (0 <= ix + i && ix + i < n && t[at + 1] == s[ix + i]) {
                        if (!vi.count({at + 1, ix + i}) || ds - 1 > vi[{at + 1, ix + i}]) {
                            q.emplace(ds - 1, at + 1, ix + i);
                            vi[{at + 1, ix + i}] = ds - 1;
                        }
                    }
                }
            }
        }
    };

    dijk();

    if (mn != maxr) {
        cout << mn << '\n';
    } else {
        cout << "-1\n";
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 660 KB Output is correct
2 Correct 47 ms 876 KB Output is correct
3 Correct 14 ms 848 KB Output is correct
4 Correct 22 ms 916 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 187 ms 1824 KB Output is correct
8 Correct 596 ms 4580 KB Output is correct
9 Execution timed out 1059 ms 3700 KB Time limit exceeded
10 Halted 0 ms 0 KB -