oj.uz

답안 #340381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340381 2020-12-27T13:37:37 Z tengiz05 원형 문자열 (IZhO13_rowords) C++17
72 / 100
 2000 ms 11944 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();
	vector<int> idx(m);
	for(i=0;i<m;i++)idx[i] = i;
	unsigned seed = chrono::system_clock::now().time_since_epoch().count();
	shuffle(all(idx), default_random_engine(seed));
	for(i=0;i<m;i++){
		short int now = idx[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 > 4e8+1213131){
			break;
		}
	}
	cout << ans << '\n';
	return;
}
 
signed main(){
	FASTIO;
	solve(1);
	return 0;
}

Subtask #1
72.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 89 ms 4716 KB Output is correct
7 Correct 1908 ms 8252 KB Output is correct
8 Execution timed out 2041 ms 8172 KB Time limit exceeded
9 Incorrect 1916 ms 8252 KB Output isn't correct
10 Correct 1603 ms 8252 KB Output is correct
11 Incorrect 1559 ms 9040 KB Output isn't correct
12 Correct 1635 ms 9832 KB Output is correct
13 Incorrect 1734 ms 9836 KB Output isn't correct
14 Correct 1587 ms 9352 KB Output is correct
15 Incorrect 1549 ms 10092 KB Output isn't correct
16 Execution timed out 2048 ms 8940 KB Time limit exceeded
17 Correct 1599 ms 9452 KB Output is correct
18 Incorrect 1576 ms 11628 KB Output isn't correct
19 Correct 1569 ms 8252 KB Output is correct
20 Correct 1857 ms 10328 KB Output is correct
21 Correct 323 ms 8172 KB Output is correct
22 Correct 962 ms 9388 KB Output is correct
23 Correct 1643 ms 9964 KB Output is correct
24 Correct 1751 ms 10632 KB Output is correct
25 Correct 1701 ms 11944 KB Output is correct