oj.uz

답안 #340353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340353 2020-12-27T13:21:04 Z beksultan04 원형 문자열 (IZhO13_rowords) C++14
48 / 100
 1776 ms 9068 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e5+12,INF=1e9+7;
int dp[2001][2001];
main(){
    string a,b;
    int i,j,n,y,m;
    cin>>a>>b;
    n = a.size();
    m = b.size();

    if (n > m){
        swap(n,m);
        swap(a,b);
    }

    for (i=1;i<=n;++i){
        for (j=1;j<=m;++j){
            dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
            if (a[i-1]==b[j-1]){
                dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
            }
        }
    }
    if (n*m*n > 3e8){
        cout <<dp[n][m];
        ret 0;
    }
    int ans = dp[n][m];
    for (y=0;y<n;++y){


        a.pb(a[0]);
        a.erase(a.begin());

        for (i=1;i<=n;++i){
            for (j=1;j<=m;++j){
                dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
                if (a[i-1]==b[j-1]){
                    dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
                }
            }
        }
        ans = max(ans,dp[n][m]);
    }
    reverse(all(b));
    for (y=0;y<n;++y){


        a.pb(a[0]);
        a.erase(a.begin());

        for (i=1;i<=n;++i){
            for (j=1;j<=m;++j){
                dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
                if (a[i-1]==b[j-1]){
                    dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
                }
            }
        }

        ans = max(ans,dp[n][m]);
    }


    cout <<ans;
}

Compilation message

rowords.cpp:22:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main(){
      |      ^

Subtask #1
48.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 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 83 ms 1260 KB Output is correct
7 Correct 9 ms 8172 KB Output is correct
8 Incorrect 10 ms 8172 KB Output isn't correct
9 Incorrect 9 ms 8172 KB Output isn't correct
10 Incorrect 9 ms 8172 KB Output isn't correct
11 Incorrect 10 ms 8172 KB Output isn't correct
12 Correct 12 ms 8684 KB Output is correct
13 Incorrect 11 ms 8684 KB Output isn't correct
14 Incorrect 10 ms 8172 KB Output isn't correct
15 Incorrect 11 ms 9068 KB Output isn't correct
16 Incorrect 10 ms 8300 KB Output isn't correct
17 Incorrect 6 ms 4848 KB Output isn't correct
18 Incorrect 9 ms 7148 KB Output isn't correct
19 Incorrect 9 ms 8172 KB Output isn't correct
20 Incorrect 9 ms 7148 KB Output isn't correct
21 Correct 299 ms 1644 KB Output is correct
22 Correct 869 ms 2412 KB Output is correct
23 Correct 1692 ms 3180 KB Output is correct
24 Correct 1776 ms 3180 KB Output is correct
25 Incorrect 6 ms 3820 KB Output isn't correct