oj.uz

Submission #480916

# Submission time Handle Problem Language Result Execution time Memory
480916 2021-10-18T18:03:30 Z CSQ31 Bajka (COCI20_bajka) C++17
20 / 70
 49 ms 764 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int dp[400][400];
int main()
{
	owo
	int n,m;
	cin>>n>>m;
	string a,b;
	cin>>a>>b;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			dp[i][j] = 1e9;
		}
	}
			
	for(int i=0;i<n;i++){
		if(a[i] == b[0])dp[i][0] = 0;
	}
	for(int i=1;i<m;i++){
		for(int j=0;j<n;j++){
			for(int k=0;k<n;k++){
				if(j==k || a[j] != b[i])continue;
				dp[j][i] = min(dp[j][i],dp[k][i-1] + abs(j-k));
			}
		}
	}
	int ans =1e9;
	for(int i=0;i<n;i++){
		if(dp[i][m-1] != -1)ans = min(ans,dp[i][m-1]);
	}
	if(ans == 1e9)ans = -1;
	cout<<ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 764 KB Output isn't correct
2 Halted 0 ms 0 KB -