oj.uz

답안 #468975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468975 2021-08-30T10:04:37 Z sinamhdv Dabbeh (INOI20_dabbeh) C++11
0 / 100
 2000 ms 175672 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000000363;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;
const int prm = 727;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define fast_io ios::sync_with_stdio(0); cin.tie(0);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fr first
#define sc second
#define endl '\n'

const int MAXN = 10100;
const int MAXL = 300100;
const int MAXT = 500100;

int n, q;
string t[MAXN];
string s;
int lcp[MAXL];
int qans[MAXL];
set<int> hst;
int pw[MAXT];
int hsh[MAXL];
vector<pii> qr[MAXL];
int seg[4 * MAXL];
vector<int> vec[MAXL];
int ssz;

inline int gethash(int l, int r)
{
	return (mod + (hsh[r + 1] - hsh[l] * (ll)pw[r - l + 1]) % mod) % mod;
}

inline int getlcp(int i)
{
	int l = 0, r = (int)s.size() - i + 1;
	while (r - l > 1)
	{
		int mid = (r + l) / 2;
		if (hst.count(gethash(i, i + mid - 1))) l = mid;
		else r = mid;
	}
	return l;
}

void setind(int i, int x)
{
	for (seg[i += MAXL] = x; i > 1; i /= 2) seg[i/2] = min(seg[i], seg[i^1]);
}

int get(int l, int r)
{
	r++;
	int res = INF;
	for (l += MAXL, r += MAXL; l < r; l /= 2, r /= 2)
	{
		if (l % 2) res = min(res, seg[l++]);
		if (r % 2) res = min(res, seg[--r]);
	}
	return res;
}


int32_t main(void)
{
	fast_io;
	
	pw[0] = 1;
	FOR(i, 1, MAXT) pw[i] = (ll)pw[i - 1] * prm % mod;

	cin >> n >> q;
	FOR(i, 0, n)
	{
		cin >> t[i];
		// prehash
		ll h = 0;
		for (char c : t[i])
		{
			h = (prm * h + c) % mod;
			hst.insert(h);
		}
	}
	cin >> s;

	ssz = s.size();

	// prehash
	FOR(i, 1, (int)s.size() + 1) hsh[i] = (hsh[i - 1] * (ll)prm + s[i - 1]) % mod;

	FOR(i, 0, (int)s.size()) lcp[i] = getlcp(i);

	dbgr(lcp, lcp + (int)s.size());

	FOR(i, 0, (int)s.size()) if (lcp[i])
	{
		vec[i + lcp[i] - 1].pb(i);
	}

	FOR(i, 0, q)
	{
		int l, r;
		cin >> l >> r;
		r--;
		qr[r].pb({l, i});
	}

	fill(seg, seg + 4 * MAXL, INF);

	for (int r = (int)s.size() - 1; r >= 0; r--)
	{
		dbg(r);
		for (int u : vec[r])
		{
			dbg(u);
			dbg(seg[1]);
			setind(u, u);
		}
		for (pii p : qr[r])
		{
			dbg(p.fr);
			int nxt = get(p.fr, ssz - 1);
			dbg(p.sc);
			dbg(nxt);
			if (nxt > r)
			{
				qans[p.sc] = -1;
				continue;
			}
			qans[p.sc]++;
			if (nxt > p.fr) qr[nxt - 1].pb(p);
		}

		dbg("=================\n");
	}

	FOR(i, 0, q) cout << qans[i] << endl;

	return 0;
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21324 KB Output is correct
2 Correct 534 ms 81220 KB Output is correct
3 Correct 1040 ms 148972 KB Output is correct
4 Incorrect 1443 ms 175672 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2011 ms 39772 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21324 KB Output is correct
2 Correct 534 ms 81220 KB Output is correct
3 Correct 1040 ms 148972 KB Output is correct
4 Incorrect 1443 ms 175672 KB Output isn't correct
5 Halted 0 ms 0 KB -