oj.uz

답안 #340361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340361 2020-12-27T13:24:32 Z tengiz05 원형 문자열 (IZhO13_rowords) C++17
36 / 100
 2000 ms 11884 KB 
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
short int n, m, k;
string a, b;
string B;
int ans;
int dp[2005][2005];
int iter = 0;
inline void do_it_now(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			iter++;
			dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
			if(a[i-1] == b[j-1]){
				chmax(dp[i][j], dp[i-1][j-1]+1);
			}
		}
	}
	chmax(ans, dp[n][m]);
}
void solve(int test_case){
	short int i, j;
	cin >> a >> B;
	if(a.length() < B.length())swap(a,B);
	n = a.length(), m = B.length();
	for(i=0;i<m;i++){
		short int now = i;
		b.erase(all(b));
		for(j=0;j<m;j++){
			if(now == m)now=0;
			b.pb(B[now]);
			now++;
		}
		do_it_now();
		reverse(all(b));
		do_it_now();
		if(iter > 5e8){
			break;
		}
	}
	cout << ans << '\n';
	return;
}
 
signed main(){
	FASTIO;
	solve(1);
	return 0;
}

Subtask #1
36.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 85 ms 4716 KB Output is correct
7 Execution timed out 2001 ms 8300 KB Time limit exceeded
8 Execution timed out 2080 ms 8300 KB Time limit exceeded
9 Execution timed out 2095 ms 8172 KB Time limit exceeded
10 Execution timed out 2089 ms 8172 KB Time limit exceeded
11 Execution timed out 2031 ms 9068 KB Time limit exceeded
12 Execution timed out 2080 ms 9708 KB Time limit exceeded
13 Execution timed out 2095 ms 9708 KB Time limit exceeded
14 Execution timed out 2063 ms 9348 KB Time limit exceeded
15 Execution timed out 2041 ms 10108 KB Time limit exceeded
16 Execution timed out 2075 ms 8812 KB Time limit exceeded
17 Execution timed out 2047 ms 9452 KB Time limit exceeded
18 Execution timed out 2005 ms 11520 KB Time limit exceeded
19 Execution timed out 2019 ms 8300 KB Time limit exceeded
20 Execution timed out 2048 ms 10220 KB Time limit exceeded
21 Correct 325 ms 8172 KB Output is correct
22 Correct 984 ms 9324 KB Output is correct
23 Correct 1881 ms 10084 KB Output is correct
24 Execution timed out 2013 ms 10632 KB Time limit exceeded
25 Execution timed out 2080 ms 11884 KB Time limit exceeded