oj.uz

Submission #656104

# Submission time Handle Problem Language Result Execution time Memory
656104 2022-11-06T09:49:42 Z 600Mihnea Necklace (Subtask 1-3) (BOI19_necklace1) C++17
25 / 85
 1500 ms 436 KB 
bool home = 0;
bool verbose = 1;

#include <bits/stdc++.h>

using namespace std;

mt19937 rng(7777);

typedef long double ld;

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196442881097566593344612847564823378678316527120190914;
using cd = complex<ld>;

ld values[26];

cd get(string s, cd c) {
  cd sol = 0;
  cd cur = 1;
  for (int i = 0; i < (int) s.size(); i++) {
    assert('a' <= s[i] && s[i] <= 'z');
    sol += cur * values[s[i] - 'a'];
    cur *= c;
  }
  return sol;
}

bool same(string s, string t) {
  assert((int) s.size() == (int) t.size());
  int n = (int) s.size();
  ld ang = 2 * PI / n;
  cd c(cos(ang), sin(ang));
  /// get(s, c) == get(t, c) * c sau get(s, c) == get(t, c) * c^2 sau ...
  return abs(norm(get(s, c)) - norm(get(t, c))) < 1e-6;
  cd val = get(s, c) / get(t, c);
  cout << fixed << setprecision(3) << val << "\n";
  cout << fixed << setprecision(3) << c << "\n";
  cout << fixed << setprecision(3) << c * c << "\n";
  cout << fixed << setprecision(3) << c * c * c << "\n";
}

string s, t;

bool isok(int len) {
  int n = (int) s.size();
  int m = (int) t.size();
  for (int i = 0; i + len - 1 < n; i++) {
    for (int j = 0; j + len - 1 < m; j++) {
      bool ok = same(string(s.begin() + i, s.begin() + i + len), string(t.begin() + j, t.begin() + j + len));
      if (ok) {
        return 1;
      }
    }
  }
  return 0;
}


void print(int len) {
  int n = (int) s.size();
  int m = (int) t.size();
  for (int i = 0; i + len - 1 < n; i++) {
    for (int j = 0; j + len - 1 < m; j++) {
      bool ok = same(string(s.begin() + i, s.begin() + i + len), string(t.begin() + j, t.begin() + j + len));
      if (ok) {
        cout << i << " " << j << "\n";
        exit(0);
      }
    }
  }
}

int main() {
  for (int x = 0; x < 26; x++) {
    values[x] = cos(rng()) * 10;
  }
  if (!home) {
    verbose = 0;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  if (home) {
    verbose = 1;
    freopen ("___input___.txt", "r", stdin);
  }

  cin >> s >> t;
  int n = (int) s.size(), m = (int) t.size();
  int sol = min(n, m);
  while (!isok(sol)) {
    sol--;
  }
  cout << sol << "\n";
  print(sol);
  return 0;
}

Compilation message

necklace.cpp: In function 'int main()':
necklace.cpp:85:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     freopen ("___input___.txt", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 47 ms 212 KB Output is correct
4 Correct 74 ms 212 KB Output is correct
5 Correct 179 ms 312 KB Output is correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 47 ms 212 KB Output is correct
4 Correct 74 ms 212 KB Output is correct
5 Correct 179 ms 312 KB Output is correct
6 Correct 214 ms 212 KB Output is correct
7 Correct 440 ms 436 KB Output is correct
8 Execution timed out 1591 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 47 ms 212 KB Output is correct
4 Correct 74 ms 212 KB Output is correct
5 Correct 179 ms 312 KB Output is correct
6 Correct 214 ms 212 KB Output is correct
7 Correct 440 ms 436 KB Output is correct
8 Execution timed out 1591 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -