oj.uz

답안 #880962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880962 2023-11-30T09:17:12 Z vjudge1 Necklace (Subtask 1-3) (BOI19_necklace1) C++17
0 / 85
 224 ms 348 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());

string s, t;

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

int32_t main(){
  fast_io;
  cin >> s >> t;
  for (int len = min (s.size(), t.size()); len >= 1; -- len){
    for (int tt = 0; tt + len <= t.size(); ++ tt){
      for (int ss = 0; ss + len <= s.size(); ++ ss){
        for (int k = 0; k <= len; ++ k){
          string x = s.substr(ss, len);
          reverse(x.begin(), x.end());
          if (s.substr(0, k) == t.substr(tt + len - k, k) && x.substr(k, len - k) == t.substr(tt, len - k)) {
            cout << len << "\n";
            cout << ss << " " << tt << "\n";
            return 0;
          }
          if (s.substr(ss, k) == t.substr(tt + len - k, k) && s.substr(ss + k, len - k) == t.substr(tt, len - k)) {
            cout << len << "\n";
            cout << ss << " " << tt << "\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

Compilation message

necklace.cpp: In function 'int32_t main()':
necklace.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (int tt = 0; tt + len <= t.size(); ++ tt){
      |                      ~~~~~~~~~^~~~~~~~~~~
necklace.cpp:50:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |       for (int ss = 0; ss + len <= s.size(); ++ ss){
      |                        ~~~~~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 54 ms 344 KB Output is partially correct
2 Partially correct 24 ms 348 KB Output is partially correct
3 Incorrect 224 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 54 ms 344 KB Output is partially correct
2 Partially correct 24 ms 348 KB Output is partially correct
3 Incorrect 224 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 54 ms 344 KB Output is partially correct
2 Partially correct 24 ms 348 KB Output is partially correct
3 Incorrect 224 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -