oj.uz

답안 #918900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918900 2024-01-30T17:33:18 Z vjudge1 Bajka (COCI20_bajka) C++17
20 / 70
 1 ms 1224 KB 
#include "bits/stdc++.h"
using namespace std;
string a, b;
vector< vector<long long> > Memorizaci_n;
long long Resolver(long long i, long long j){
    //cout<<i<<" "<<j<<"\n";
    long long Retorno = 2222222222222222;
    if(Memorizaci_n[i][j] != -2) return Memorizaci_n[i][j];
    else if(j >= b.size() - 1) return 0;
    Memorizaci_n[i][j] = -1;
    if(i == 0 and a[i + 1] == b[j + 1]){
        long long A = Resolver(i + 1, j + 1);
        if(A != -1) Retorno = min(Retorno, A + 1);
    } else if(i == a.size() - 1 and a[i - 1] == b[j + 1]){
        long long A = Resolver(i - 1, j + 1);
        if(A != -1) Retorno = min(Retorno, A + 1);
    } else {
        if(a[i + 1] == b[j + 1]){
            long long A = Resolver(i + 1, j + 1);
            if(A != -1) Retorno = min(Retorno, A + 1);
        }
        if(a[i - 1] == b[j + 1]){
            long long A = Resolver(i - 1, j + 1);
            if(A != -1) Retorno = min(Retorno, A + 1);
        }
    }
    for(long long k = i + 1; k < a.size(); k++){
        if(a[k] == a[i]){
            long long A = Resolver(k, j);
            if(A != -1) Retorno = min(Retorno, A + abs(i - k));
            break;
        }
    }
    for(long long k = i - 1; k > -1; k--){
        if(a[k] == a[i]){
            long long A = Resolver(k, j);
            if(A != -1) Retorno = min(Retorno, A + abs(i - k));
            break;
        }
    }
    if(Retorno == 2222222222222222) return Memorizaci_n[i][j] = -1;
    else return Memorizaci_n[i][j] = Retorno;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    long long n, m;
    cin>>n>>m>>a>>b;
    Memorizaci_n.assign(n, vector<long long>(m, -2));
    long long Respuesta = 2222222222222222;
    vector<long long> Posibles;
    for(long long i = 0; i < n; i++) if(a[i] == b[0]) Posibles.push_back(Resolver(i, 0));
    sort(Posibles.begin(), Posibles.end());
    for(long long i = 0; i < Posibles.size(); i++){
        if(Posibles[i] != -1){
            Respuesta = Posibles[i];
            break;
        }
    }
    /*for(auto E: Memorizaci_n){
        for(auto e: E) cout<<e<<" ";
        cout<<"\n";
    }*/
    if(Respuesta == 2222222222222222) Respuesta = -1;
    cout<<Respuesta;
    return 0;
}

Compilation message

bajka.cpp: In function 'long long int Resolver(long long int, long long int)':
bajka.cpp:9:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     else if(j >= b.size() - 1) return 0;
      |             ~~^~~~~~~~~~~~~~~
bajka.cpp:14:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     } else if(i == a.size() - 1 and a[i - 1] == b[j + 1]){
      |               ~~^~~~~~~~~~~~~~~
bajka.cpp:27:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(long long k = i + 1; k < a.size(); k++){
      |                              ~~^~~~~~~~~~
bajka.cpp: In function 'int main()':
bajka.cpp:54:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(long long i = 0; i < Posibles.size(); i++){
      |                          ~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 50.0

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