Submission #880943

#TimeUsernameProblemLanguageResultExecution timeMemory
880943TAhmed33Bajka (COCI20_bajka)C++98
0 / 70
7 ms860 KiB
#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}); } } while (!pq.empty()) { auto k = pq.top(); pq.pop(); if (k[0] > dist[k[1]][k[2]]) continue; if (k[2] == m - 1) 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]) { if (k[0] + val < dist[node][k[2] + 1]) { dist[node][k[2] + 1] = k[0] + val; pq.push({dist[node][k[2] + 1], node, k[2] + 1}); } } } } int mn = inf; for (int i = 0; i < n; i++) mn = min(mn, dist[i][m - 1]); if (mn >= inf) { cout << "-1\n"; } else { cout << mn << '\n'; } }

Compilation message (stderr)

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