oj.uz

답안 #880965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880965 2023-11-30T09:24:12 Z vjudge1 Necklace (Subtask 1-3) (BOI19_necklace1) C++17
25 / 85
 1500 ms 604 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 1e5, SQ = 300, INF = 2e9 + 8, LGN = 21, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
string s, t;

#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC target ("avx2")

int32_t main(){
  fast_io;
  cin >> s >> t;
  n = s.size(), m = t.size();
  for (int len = min(n, m); len >= 1; -- len){
    for (int l = 0; l + len <= n; ++ l){
      for (int r = 0; r + len <= m; ++ r){
        for (int k = 0; k <= len; ++ k){
          string ten = t.substr(r, len - k);
          string ts = t.substr(r + len - k, k);
          if (s.substr(l, k) == ts && s.substr(l + k, len - k) == ten){
            cout << len << '\n';
            cout << l << " " << r << '\n';
            return 0;
          }
          string s2 = s.substr(l, len);
          reverse(all(s2));
          if (s2.substr(0, k) == ts && s2.substr(k, len - k) == ten){
            cout << len << '\n';
            cout << l << " " << r << '\n';
            return 0;
          }
        }
      }
    }
  }
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 604 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 383 ms 432 KB Output is correct
4 Correct 529 ms 428 KB Output is correct
5 Correct 1004 ms 428 KB Output is correct

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 604 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 383 ms 432 KB Output is correct
4 Correct 529 ms 428 KB Output is correct
5 Correct 1004 ms 428 KB Output is correct
6 Execution timed out 1590 ms 344 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 604 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 383 ms 432 KB Output is correct
4 Correct 529 ms 428 KB Output is correct
5 Correct 1004 ms 428 KB Output is correct
6 Execution timed out 1590 ms 344 KB Time limit exceeded
7 Halted 0 ms 0 KB -