oj.uz

답안 #715767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715767 2023-03-27T20:03:48 Z bLIC Necklace (Subtask 1-3) (BOI19_necklace1) C++17
37 / 85
 278 ms 64540 KB 
/**
 *  Author: Anil Byar
**/

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

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ft first
#define sd second
#define pb push_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;
const int maxN = 101;
const int maxK = 8001;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    out<<'\n';
    return out;
}

vector<int> pi(const string &s, const string& t) {
	int n = (int)s.size();
	vector<int> pi_s(n);
	for (int i = 1, j = 0; i < n; i++) {
		while (j > 0 && s[j] != s[i]) { j = pi_s[j - 1]; }
		if (s[i] == s[j]) { j++; }
		pi_s[i] = j;
	}

    n = sz(t);
    vi ans(n);
    for (int i = 0, j = 0; i < n; i++){
        while(j>0 && s[j]!=t[i]) j = pi_s[j-1];
        if (s[j]==t[i]) j++;
        ans[i] = j;
    }
	return ans;
}


void solve(){
    string s, t;
    cin>>s>>t;
    int n = sz(s), m = sz(t);
    vvi pfx(n+5, vi(m+5));
    
    for (int i = 0;i<n;i++){
        pfx[i] = pi(s.substr(i, n-i), t);
        pfx[i].pb(0);
    }
    // cout<<pfx;
    int ans = 0, p1 = -1, p2 = -1;
    for (int i = 0;i<m;i++){
        for (int j = 0;j<n;j++){
            int len = pfx[j][i];
            int len1 = (i>=len && j+len<n)?pfx[j+len][i-len]:0;
            // debug(i, j, len, len1);
            if (len+len1>=ans){
                ans = len+len1;
                p2 = i-ans+1;
                p1 = j;
            }
        }
    }
    // debug(ans, p1, p2);
    // if (ans){
    //     cout<<s.substr(p1, ans)<<endl;
    //     cout<<t.substr(p2, ans)<<endl;
    // }
    reverse(all(t));
    for (int i = 0;i<n;i++){
        pfx[i] = pi(s.substr(i, n-i), t);
        pfx[i].pb(0);
    }
    for (int i = 0;i<m;i++){
        for (int j = 0;j<n;j++){
            int len = pfx[j][i];
            int len1 = (i>=len && j+len<n)?pfx[j+len][i-len]:0;
            if (len+len1>=ans){
                ans = len+len1;
                p2 = m-i-1;
                p1 = j;
            }
            // debug(ans, l, r);
        }
    }
    // debug(ans, p1, p2);
    // reverse(all(t));
    // if (ans){
    //     cout<<s.substr(p1, ans)<<endl;
    //     cout<<t.substr(p2, ans)<<endl;
    // }
    cout<<ans<<'\n';
    cout<<p1<<' '<<p2;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

// #define ONLINE_JUDGE
// #ifndef ONLINE_JUDGE
//     freopen("./input/input24.txt", "r", stdin);
//     freopen("output.out", "w", stdout);
//     freopen("debug.dbg", "w", stderr);
//     int tt = clock();
// #endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
// #ifndef ONLINE_JUDGE
//     cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
//     tt = clock();
// #endif
}

Compilation message

necklace.cpp: In function 'int main()':
necklace.cpp:180:14: warning: unused variable 'i' [-Wunused-variable]
  180 |     int t=1, i = 1;
      |              ^

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1540 KB Output is correct
8 Partially correct 3 ms 1364 KB Output is partially correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 3 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct

Subtask #3
8.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1540 KB Output is correct
8 Partially correct 3 ms 1364 KB Output is partially correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 3 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 278 ms 59448 KB Output is correct
14 Correct 242 ms 59444 KB Output is correct
15 Partially correct 261 ms 64540 KB Output is partially correct
16 Partially correct 256 ms 58596 KB Output is partially correct
17 Correct 207 ms 57424 KB Output is correct
18 Correct 211 ms 59052 KB Output is correct
19 Correct 223 ms 58828 KB Output is correct
20 Correct 232 ms 57420 KB Output is correct
21 Correct 238 ms 57940 KB Output is correct