oj.uz

답안 #483439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
483439 2021-10-29T13:28:01 Z XII 원형 문자열 (IZhO13_rowords) C++17
28 / 100
 135 ms 54620 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "rowords"
void Fi(){
    if(fopen(PROB".in", "r")){
        freopen(PROB".in", "r", stdin);
        freopen(PROB".out", "w", stdout);
    }
}

const int N = 2e3 + 1;
int dp[N * 2][N], t[N * 2][N];
int n, m, ans;
string s, p;

int dx[] = {-1, 0, -1};
int dy[] = {0, -1, -1};

void calc(){
//    memset(dp, 0, sizeof(dp));
    memset(t, -1, sizeof(t));
    FORU(i, 1, n * 2) t[i][0] = 0;
    FORU(j, 1, m) t[0][j] = 1;
    FORU(i, 1, n * 2) FORU(j, 1, m){
        auto selection = {
            dp[i - 1][j],
            dp[i][j - 1],
            dp[i - 1][j - 1] + (s[i] == p[j])
        };
        dp[i][j] = *max_element(ALL(selection));
        t[i][j] = max_element(ALL(selection)) - selection.begin();
    }
    ans = max(ans, dp[n][m]);
    FORU(row, 1, n){
        {
            int i = row, j;
            for(j = 1; j <= m && t[i][j] != 2; ++j);
            if(j <= m){
                t[i][j] = 1;
                while(i < n * 2 && j <= m){
                    if(t[i + 1][j] == 0) t[++i][j] = 1;
                    else if(j == m) break;
                    else if(t[i + 1][j + 1] == 2) t[++i][++j] = 1;
                    else ++j;
                }
            }
        }
        {
            int tmp = 0;
            for(int i = n + row, j = m; i > row && j > 0;){
                int d = t[i][j];
                if(d == 2) ++tmp;
                i += dx[d], j += dy[d];
            }
            ans = max(ans, tmp);
        }
    }
}

int main(){
    IOS;
    Fi();
    cin >> s >> p;
    n = s.size(), m = p.size();
    s = " " + s + s;
    p = " " + p;
    calc();
    reverse(p.begin() + 1, p.begin() + m + 1);
    calc();
    cout << ans;
    return 0;
}

Compilation message

rowords.cpp: In function 'void Fi()':
rowords.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(PROB".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
rowords.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
28.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31692 KB Output is correct
2 Correct 15 ms 31688 KB Output is correct
3 Correct 14 ms 31780 KB Output is correct
4 Correct 15 ms 32044 KB Output is correct
5 Incorrect 15 ms 31996 KB Output isn't correct
6 Correct 34 ms 40396 KB Output is correct
7 Correct 43 ms 47304 KB Output is correct
8 Incorrect 73 ms 47316 KB Output isn't correct
9 Incorrect 102 ms 47216 KB Output isn't correct
10 Incorrect 77 ms 47308 KB Output isn't correct
11 Incorrect 86 ms 48844 KB Output isn't correct
12 Correct 74 ms 50380 KB Output is correct
13 Incorrect 108 ms 50380 KB Output isn't correct
14 Incorrect 90 ms 49404 KB Output isn't correct
15 Incorrect 104 ms 51016 KB Output isn't correct
16 Incorrect 92 ms 48580 KB Output isn't correct
17 Incorrect 88 ms 49744 KB Output isn't correct
18 Incorrect 105 ms 53848 KB Output isn't correct
19 Incorrect 76 ms 47300 KB Output isn't correct
20 Incorrect 115 ms 51376 KB Output isn't correct
21 Incorrect 76 ms 47276 KB Output isn't correct
22 Incorrect 97 ms 49612 KB Output isn't correct
23 Incorrect 101 ms 51020 KB Output isn't correct
24 Incorrect 110 ms 52036 KB Output isn't correct
25 Incorrect 135 ms 54620 KB Output isn't correct