oj.uz

답안 #320885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320885 2020-11-10T06:56:18 Z dolphingarlic Bajka (COCI20_bajka) C++14
50 / 70
 27 ms 484 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int dp[2][300];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    string s, t;
    vector<int> pos;
    cin >> n >> m >> s >> t;
    for (int i = 1; i < m; i++) {
        pos.clear();
        for (int j = 0; j < n; j++) if (s[j] == t[i]) {
            pos.push_back(j);
            dp[i & 1][j] = INT_MAX / 2;
            if (j && s[j - 1] == t[i - 1]) {
                dp[i & 1][j] = min(dp[i & 1][j], dp[i - 1 & 1][j - 1] + 1);
            }
            if (j < n - 1 && s[j + 1] == t[i - 1]) {
                dp[i & 1][j] = min(dp[i & 1][j], dp[i - 1 & 1][j + 1] + 1);
            }
        }

        for (int j : pos) for (int k : pos) dp[i & 1][j] = min(dp[i & 1][j], dp[i & 1][k] + abs(k - j));
    }

    int ans = INT_MAX / 2;
    for (int i : pos) ans = min(ans, dp[m - 1 & 1][i]);
    if (ans == INT_MAX / 2) cout << -1;
    else cout << ans;
    return 0;
}

Compilation message

bajka.cpp: In function 'int main()':
bajka.cpp:20:55: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   20 |                 dp[i & 1][j] = min(dp[i & 1][j], dp[i - 1 & 1][j - 1] + 1);
      |                                                     ~~^~~
bajka.cpp:23:55: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   23 |                 dp[i & 1][j] = min(dp[i & 1][j], dp[i - 1 & 1][j + 1] + 1);
      |                                                     ~~^~~
bajka.cpp:31:43: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   31 |     for (int i : pos) ans = min(ans, dp[m - 1 & 1][i]);
      |                                         ~~^~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 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
7 Correct 4 ms 364 KB Output is correct
8 Correct 14 ms 364 KB Output is correct
9 Correct 27 ms 484 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct