oj.uz

답안 #58714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58714 2018-07-19T01:20:47 Z Benq 원형 문자열 (IZhO13_rowords) C++14
24 / 100
 2000 ms 476 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

string a,b;
array<int,2001> cur;

int lcs() {
    cur.fill(0);
    for (char c: b) {
        FORd(i,1,sz(a)+1) if (a[i-1] == c) cur[i] = cur[i-1]+1;
        FOR(i,1,sz(a)+1) cur[i] = max(cur[i],cur[i-1]);
    }
    return cur[sz(a)];
}

int solve() {
    int ans = 0;
    F0R(i,sz(a)) {
        ans = max(ans,lcs());
        rotate(a.begin(),a.begin()+1,a.end());
    }
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> a >> b;
    int ans = solve();
    reverse(all(a));
    ans = max(ans,solve());
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
24.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 574 ms 476 KB Output is correct
7 Execution timed out 2028 ms 376 KB Time limit exceeded
8 Execution timed out 2051 ms 376 KB Time limit exceeded
9 Execution timed out 2041 ms 380 KB Time limit exceeded
10 Execution timed out 2049 ms 376 KB Time limit exceeded
11 Execution timed out 2039 ms 376 KB Time limit exceeded
12 Execution timed out 2060 ms 376 KB Time limit exceeded
13 Execution timed out 2063 ms 376 KB Time limit exceeded
14 Execution timed out 2053 ms 380 KB Time limit exceeded
15 Execution timed out 2050 ms 376 KB Time limit exceeded
16 Execution timed out 2070 ms 376 KB Time limit exceeded
17 Execution timed out 2070 ms 376 KB Time limit exceeded
18 Execution timed out 2053 ms 376 KB Time limit exceeded
19 Execution timed out 2069 ms 376 KB Time limit exceeded
20 Execution timed out 2062 ms 376 KB Time limit exceeded
21 Execution timed out 2076 ms 376 KB Time limit exceeded
22 Execution timed out 2029 ms 376 KB Time limit exceeded
23 Execution timed out 2050 ms 376 KB Time limit exceeded
24 Execution timed out 2041 ms 376 KB Time limit exceeded
25 Execution timed out 2055 ms 376 KB Time limit exceeded