oj.uz

Submission #880961

# Submission time Handle Problem Language Result Execution time Memory
880961 2023-11-30T09:16:20 Z TAhmed33 Bajka (COCI20_bajka) C++
50 / 70
 153 ms 6908 KB 
#include <bits/stdc++.h>
using namespace std;
vector <pair <int, int>> adj[301];
const int inf = 2e5 + 25;
int dist[301][301];
int n, m; string s, t;
int main () {
    cin >> n >> m >> s >> t;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (s[i] == s[j]) {
                adj[i].push_back({j, j - i});
                adj[j].push_back({i, j - i});
            }
        }
    }
    for (int i = 1; i + 1 < n; i++) {
        adj[i - 1].push_back({i, 1});
        adj[i].push_back({i - 1, 1});
        adj[i + 1].push_back({i, 1});
        adj[i].push_back({i + 1, 1});
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            dist[i][j] = inf;
        }
    }
    priority_queue <vector <int>, vector <vector <int>>, greater <vector <int>>> pq;
    for (int i = 0; i < n; i++) {
        if (s[i] == t[0]) {
            dist[i][0] = 0;
            pq.push({0, i, 0});
        }
    }
    int mn = inf;
    while (!pq.empty()) {
        auto k = pq.top();
        pq.pop();
        if (k[0] > dist[k[1]][k[2]]) continue; 
        if (k[2] == m - 1) {
            mn = min(mn, k[0]);
            continue;
        }
        for (auto [node, val] : adj[k[1]]) {
            if (s[node] == s[k[1]]) {
                if (k[0] + val < dist[node][k[2]]) {
                    dist[node][k[2]] = k[0] + val;
                    pq.push({k[0] + val, node, k[2]});
                }
            }
            if (s[node] == t[k[2] + 1] && abs(node - k[1]) == 1) {
                if (k[0] + val < dist[node][k[2] + 1]) {
                    dist[node][k[2] + 1] = k[0] + val;
                    pq.push({k[0] + val, node, k[2] + 1});
                }
            }
        }
    }
    if (mn >= inf) {
        cout << "-1\n";
    } else {
        cout << mn << '\n';
    }
}

Compilation message

bajka.cpp: In function 'int main()':
bajka.cpp:44:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |         for (auto [node, val] : adj[k[1]]) {
      |                   ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 6 ms 1112 KB Output is correct
3 Correct 3 ms 856 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 29 ms 1688 KB Output is correct
8 Correct 153 ms 6908 KB Output is correct
9 Correct 78 ms 4880 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 19 ms 1276 KB Output is correct