oj.uz

Submission #657384

# Submission time Handle Problem Language Result Execution time Memory
657384 2022-11-09T19:09:23 Z bicsi Necklace (Subtask 4) (BOI19_necklace4) C++14
3 / 15
 378 ms 640 KB 
#include <bits/stdc++.h>

using namespace std;
using ld = long double;
const ld EPS = 1e-10;

int main() {
  string s, t; cin >> s >> t;

  mt19937_64 rng(52);
  vector<complex<ld>> rnd(256);
  for (int i = 0; i < 256; ++i) {
    ld real = 1.0L * rng() / rng.max();
    ld imag = 1.0L * rng() / rng.max();
    rnd[i] = {real, imag};
  }
  
  vector<pair<ld, int>> vs, vt;
  auto check = [&](int len) {
    complex<ld> eps = polar(1.0L, 2.0L * M_PI / len);
    pair<int, int> ans = {-1, -1};
    for (int rev = 0; rev < 2; ++rev) {
      vs.clear(); vt.clear();
      for (int it = 0; it < 2; ++it) {
        complex<ld> h = 0;
        for (int i = 0; i < (int)s.size(); ++i) {
          h = (h + rnd[s[i]]) * eps;
          if (i >= len - 1) {
            vs.emplace_back(norm(h), i - len + 1);
            h -= rnd[s[i - len + 1]];
          }
        }
        swap(s, t); swap(vs, vt);
      }
      sort(vs.begin(), vs.end());
      sort(vt.begin(), vt.end());
      for (int i = 0, j = 0; i < (int)vs.size(); ++i) {
        while (j < vt.size() && vs[i].first + EPS > vt[j].first) {
          if (abs(vt[j].first - vs[i].first) < EPS) {
            ans.first = vs[i].second;
            ans.second = vt[j].second;
            if (rev) ans.first = s.size() - ans.first - len;
          }
          ++j;
        }
      }
      reverse(s.begin(), s.end());
    }
    return ans;
  };

  int ans = 0, ps = -1, pt = -1;
  int bound = 1;
  while (check(bound).first >= 0) bound *= 2;
  for (int i = bound; i >= bound/2; --i) {
    auto [a, b] = check(i);
    if (a >= 0) {
      ans = i, ps = a, pt = b;
      break;
    }
  }
  cout << ans << endl << ps << " " << pt << endl;

  return 0;
}

Compilation message

necklace.cpp: In lambda function:
necklace.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long double, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         while (j < vt.size() && vs[i].first + EPS > vt[j].first) {
      |                ~~^~~~~~~~~~~
necklace.cpp: In function 'int main()':
necklace.cpp:56:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   56 |     auto [a, b] = check(i);
      |          ^

Subtask #1
3.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 640 KB Output is correct
2 Correct 114 ms 636 KB Output is correct
3 Correct 53 ms 596 KB Output is correct
4 Correct 378 ms 624 KB Output is correct
5 Partially correct 24 ms 596 KB Output is partially correct
6 Partially correct 27 ms 596 KB Output is partially correct
7 Correct 325 ms 632 KB Output is correct
8 Correct 245 ms 632 KB Output is correct
9 Correct 366 ms 632 KB Output is correct