oj.uz

Submission #538047

# Submission time Handle Problem Language Result Execution time Memory
538047 2022-03-16T04:01:35 Z skittles1412 Necklace (Subtask 1-3) (BOI19_necklace1) C++17
5 / 85
 125 ms 324 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
	cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
	cerr << t << " | ";
	dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
	cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
		 << ": ";                                          \
	dbgh(__VA_ARGS__)
#else
#define cerr   \
	if (false) \
	cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

constexpr long bpow(long base, long exp, long mod) {
	long ans = 1;
	while (exp) {
		if (exp & 1) {
			ans = (ans * base) % mod;
		}
		exp >>= 1;
		base = (base * base) % mod;
	}
	return ans;
}

constexpr long inv(long x, long mod) {
	return bpow(x, mod - 2, mod);
}

template <long base, long mod>
struct Pow {
	static constexpr int maxn = 3e3 + 5;
	long arr[maxn];

	constexpr Pow() : arr() {
		arr[0] = 1;
		for (int i = 1; i < maxn; i++) {
			arr[i] = (arr[i - 1] * base) % mod;
		}
	}

	long operator[](int i) const {
		return arr[i];
	}
};

template <long base, long mod>
struct Hasher {
	static constexpr long ibase = inv(base, mod);
	static constexpr Pow<base, mod> pow {};
	static constexpr Pow<ibase, mod> ipow {};
	vector<long> psum;

	explicit Hasher(const string& s) : psum(sz(s) + 1) {
		for (int i = 0; i < sz(s); i++) {
			psum[i + 1] = (psum[i] + (s[i] - 'a' + 1) * pow[i]) % mod;
		}
	}
	
	long hash(int l, int r) const {
		return (psum[r] - psum[l] + mod) * ipow[l] % mod;
	}
	
	long rot(int len, long h) const {
		long x = h % base;
		return ((h - x + mod) * ibase + x * pow[len - 1]) % mod;
	}
};

const long base = 31, mod = 1e9 + 7, ibase = inv(base, mod);

int ctoi(char c) {
	return c - 'a' + 1;
}

tuple<int, int, int> solve(const string& s, const string& t) {
	Hasher<base, mod> hs(s), ht(t);
	int n = sz(s), m = sz(t);
	for (int i = n; i >= 1; i--) {
		map<long, int> cur;
		for (int j = 0; j + i <= m; j++) {
			cur[ht.hash(j, j + i)] = j;
		}
		for (int j = 0; j + i <= n; j++) {
			long x = hs.hash(j, j + i);
			for (int k = 0; k < i; k++) {
				auto it = cur.find(x);
				if (it != cur.end()) {
					return {i, j, it->second};
				}
				x = hs.rot(i, x);
			}
		}
	}
	assert(false);
}

void solve() {
	Hasher<base, mod> tmp("aba");
	dbg(tmp.hash(0, 2), tmp.rot(2, tmp.hash(0, 2)), tmp.hash(1, 3), tmp.rot(2, tmp.hash(1, 3)));
	string s, t;
	cin >> s >> t;
	auto [x, a, b] = solve(s, t);
	reverse(begin(s), end(s));
	auto [x1, a1, b1] = solve(s, t);
	dbg(x, a, b, x1, a1, b1);
	if (x1 > x) {
		x = x1;
		a = sz(s) - a1 - x;
		b = b1;
	}
	cout << x << endl;
	cout << a << " " << b << endl;
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cin.exceptions(ios::failbit);
	solve();
}

Subtask #1
5.0 / 25.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Partially correct 2 ms 212 KB Output is partially correct
3 Partially correct 6 ms 212 KB Output is partially correct
4 Partially correct 12 ms 324 KB Output is partially correct
5 Partially correct 12 ms 320 KB Output is partially correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Partially correct 2 ms 212 KB Output is partially correct
3 Partially correct 6 ms 212 KB Output is partially correct
4 Partially correct 12 ms 324 KB Output is partially correct
5 Partially correct 12 ms 320 KB Output is partially correct
6 Partially correct 40 ms 212 KB Output is partially correct
7 Partially correct 125 ms 212 KB Output is partially correct
8 Incorrect 85 ms 320 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Partially correct 2 ms 212 KB Output is partially correct
3 Partially correct 6 ms 212 KB Output is partially correct
4 Partially correct 12 ms 324 KB Output is partially correct
5 Partially correct 12 ms 320 KB Output is partially correct
6 Partially correct 40 ms 212 KB Output is partially correct
7 Partially correct 125 ms 212 KB Output is partially correct
8 Incorrect 85 ms 320 KB Output isn't correct
9 Halted 0 ms 0 KB -