oj.uz

답안 #340336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340336 2020-12-27T13:04:39 Z amunduzbaev 원형 문자열 (IZhO13_rowords) C++14
32 / 100
 2000 ms 16236 KB 
/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
//~ #include <ext/pb_ds/assoc_container.hpp> 
//~ #include <ext/pb_ds/tree_policy.hpp> 
//~ #include <ext/rope>
 
//~ using namespace __gnu_pbds;
//~ using namespace __gnu_cxx;
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
//~ typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
 
const int N = 2e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, t, ans, dp[N][N];
 
void solve(){
	string a, b;
	cin>>a>>b;
	n = sz(b), m = sz(a);
	b += b;
	for(int i=0;i<n;i++){
		string tmp = string(b.begin() + i, b.begin() + i+ n);
		//cout<<tmp<<endl;
		memset(dp, 0, sizeof dp);
		for(int j=0;j<m;j++){
			for(int l=0;l<n;l++){
				if(j && l && a[j] == tmp[l]) dp[j][l] += dp[j-1][l-1] +1;
				else if(a[j] == tmp[l]) dp[j][l]++;
				if(j) umax(dp[j][l], dp[j-1][l]);
				if(l) umax(dp[j][l], dp[j][l-1]);
				if(j && l) umax(dp[j][l], dp[j-1][l-1]); 
			}
		}
		umax(ans, dp[m-1][n-1]);
	}
	cout<<ans<<endl;
	return;
}
 
int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
32.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 16108 KB Output isn't correct
2 Correct 30 ms 16236 KB Output is correct
3 Correct 52 ms 16108 KB Output is correct
4 Correct 124 ms 16108 KB Output is correct
5 Correct 86 ms 16108 KB Output is correct
6 Correct 276 ms 16236 KB Output is correct
7 Execution timed out 2087 ms 16108 KB Time limit exceeded
8 Execution timed out 2040 ms 16108 KB Time limit exceeded
9 Execution timed out 2087 ms 16108 KB Time limit exceeded
10 Execution timed out 2089 ms 16108 KB Time limit exceeded
11 Execution timed out 2063 ms 16108 KB Time limit exceeded
12 Execution timed out 2084 ms 16108 KB Time limit exceeded
13 Execution timed out 2098 ms 16108 KB Time limit exceeded
14 Execution timed out 2096 ms 16108 KB Time limit exceeded
15 Execution timed out 2056 ms 16236 KB Time limit exceeded
16 Execution timed out 2099 ms 16108 KB Time limit exceeded
17 Execution timed out 2084 ms 16108 KB Time limit exceeded
18 Execution timed out 2090 ms 16108 KB Time limit exceeded
19 Execution timed out 2090 ms 16108 KB Time limit exceeded
20 Execution timed out 2090 ms 16108 KB Time limit exceeded
21 Correct 520 ms 16236 KB Output is correct
22 Correct 1067 ms 16236 KB Output is correct
23 Correct 1757 ms 16132 KB Output is correct
24 Incorrect 1798 ms 16236 KB Output isn't correct
25 Execution timed out 2093 ms 16108 KB Time limit exceeded