oj.uz

답안 #674948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674948 2022-12-26T16:38:44 Z vjudge1 Bajka (COCI20_bajka) C++17
70 / 70
 87 ms 1020 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
 
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define vvb vector<vb>
#define pb push_back
#define ppb pop_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define vc vector<char>
#define vvc vector<vc>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
#define int long long
#define ld long double
const int INF = 1e18;
const int inf = 1e9;
 
void solve(){
    int n, m; cin >> n >> m;
    string s, t; cin >> s >> t;

    vvi dp(n, vi(m, INF));
    for(int i=0; i<n; i++)
        if(s[i] == t[0]) dp[i][0] = 0;
    
    for(int j=0; j<m; j++){
        for(int i=0; i<n && j > 0; i++)
            if(s[i] == t[j]){
                if(i-1 >= 0) dp[i][j] = min(dp[i][j], dp[i-1][j-1]+1);
                if(i+1 < n) dp[i][j] = min(dp[i][j], dp[i+1][j-1]+1);
            }
        for(int i=0; i<n; i++)
            for(int k=0; k<n; k++)
                if(s[i] == s[k] && i != k) dp[i][j] = min(dp[i][j], dp[k][j]+abs(k-i));
    }

    int ans = INF;
    for(int i=0; i<n; i++)
        ans = min(ans, dp[i][m-1]);
    cout << (ans == INF ? -1 : ans) << "\n";
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int tt = 1;
    // cin >> tt;
    while(tt--)
        solve();
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 980 KB Output is correct
2 Correct 43 ms 980 KB Output is correct
3 Correct 34 ms 980 KB Output is correct
4 Correct 36 ms 960 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 316 KB Output is correct
7 Correct 64 ms 964 KB Output is correct
8 Correct 54 ms 980 KB Output is correct
9 Correct 87 ms 1020 KB Output is correct
10 Correct 2 ms 316 KB Output is correct
11 Correct 59 ms 980 KB Output is correct