oj.uz

답안 #359928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
359928 2021-01-27T10:32:23 Z MrRobot_28 Bajka (COCI20_bajka) C++17
70 / 70
 2 ms 748 KB 
#include<bits/stdc++.h>
using namespace std;
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >>n >> m;
    string s, t;
    cin >> s >> t;
    vector <int> pos[26];
    for(int i = 0; i < n; i++)
    {
        pos[s[i] - 'a'].push_back(i);
    }
    vector <vector <int> > dp(m, vector <int> (n, 1e9));
    for(int i = 0; i < pos[t[0] - 'a'].size(); i++)
    {
        int ind = pos[t[0] - 'a'][i];
        dp[0][ind] = 1;
    }
    for(int it = 1; it < m; it++)
    {
        int i1 = t[it - 1] - 'a';
        int minval = 1e9;
        int en = -1;
        for(int i = 0; i < pos[i1].size(); i++)
        {
            int ind = pos[i1][i];
            minval += ind - en;
            minval = min(minval, dp[it - 1][ind]);
            if(ind > 0 && s[ind - 1] == t[it])
            {
                dp[it][ind - 1] = min(dp[it][ind - 1], minval + 1);
            }
            if(ind < n - 1 && s[ind + 1] == t[it])
            {
                dp[it][ind + 1] = min(dp[it][ind + 1], minval + 1);
            }
            en = ind;
        }
        minval = 1e9;
        en = 1e9;
        for(int i = pos[i1].size() - 1;i >= 0; i--)
        {
            int ind = pos[i1][i];
            minval += en - ind;
            minval = min(minval, dp[it - 1][ind]);
            if(ind > 0 && s[ind - 1] == t[it])
            {
                dp[it][ind - 1] = min(dp[it][ind - 1], minval + 1);
            }
            if(ind < n - 1 && s[ind + 1] == t[it])
            {
                dp[it][ind + 1] =  min(dp[it][ind + 1], minval + 1);
            }
            en = ind;
        }
    }
    int ans = 1e9;
    for(int i = 0; i < n; i++)
    {
        ans = min(ans, dp[m - 1][i] - 1);
    }
    if(ans == 1e9 - 1)
    {
        ans = -1;
    }
    cout << ans;
    return 0;
}

Compilation message

bajka.cpp: In function 'int main()':
bajka.cpp:18:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0; i < pos[t[0] - 'a'].size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~
bajka.cpp:28:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for(int i = 0; i < pos[i1].size(); i++)
      |                        ~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 748 KB Output is correct