제출 #98152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98152		qkxwsm	Selling RNA Strands (JOI16_selling_rna)	C++14	0 / 100	1591 ms	812760 KiB

selling_rna

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 200013
#define MAXM 4000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int M, Q;
vi s[MAXN];
vpl sh[MAXN], th[MAXN];
int beg[MAXN], teg[MAXN];
int lt[MAXN], rt[MAXN];
vi S;
pair<vi, vi> t[MAXN];
int ans[MAXN];

int mpc(char c)
{
	if (c == 'A') return 1;
	if (c == 'C') return 2;
	if (c == 'G') return 3;
	if (c == 'U') return 4;
}

int N;
int sval[30][MAXM];
int srank[MAXM], suf[MAXM];
vector<int> sfi[MAXM], sse[MAXM];
int lcp[MAXM];
int sparse[25][MAXM];
vector<pair<pii, pii> > quer[MAXM];

void getsuf()
{
	for (int i = 0; i <= 22; i++)
	{
		int Z = (i == 0 ? max(N, M + Q + 10) : N + 2);
		for (int j = 0; j <= Z; j++)
		{
			sfi[j].clear();
			sse[j].clear();
		}
		for (int j = 0; j < N; j++)
		{
			int curval = 0;
			if (j + (1 << i) < N) curval = sval[i][j + (1 << i)];
			sse[curval].PB(j);
		}
		for (int j = 0; j <= Z; j++)
		{
			for (int idx : sse[j])
			{
				sfi[sval[i][idx]].PB(idx);
			}
		}
		int K = 0; pii was = MP(-1, -1);
		for (int j = 0; j <= Z; j++)
		{
			for (int idx : sfi[j])
			{
				pii cur = MP(0, 0);
				cur.fi = sval[i][idx];
				if (idx + (1 << i) < N) cur.se = sval[i][idx + (1 << i)];
				if (cur != was)
				{
					assert(cur > was);
					was = cur;
					K++;
				}
				sval[i + 1][idx] = K;
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		srank[i] = sval[23][i] - 1;
		suf[srank[i]] = i;
	}
}
void getlcp()
{
	int best = 0;
	for (int i = 0; i < N; i++)
	{
		if (srank[i] == N - 1)
		{
			lcp[N - 1] = 0;
			continue;
		}
		int idx = suf[srank[i] + 1];
		while(idx + best < N && i + best < N && S[idx + best] == S[i + best]) best++;
		lcp[srank[i]] = best;
		if (best) best--;
	}
}
int compare(int x, int y)
{
	//compare s[x] with t[y]
	int lo = 0, hi = min(SZ(s[x]), SZ(t[y].fi));
	while(hi > lo)
	{
		int mid = (hi + lo + 1) >> 1;
		if (sh[x][mid] == th[y][mid])
		{
			lo = mid;
		}
		else
		{
			hi = mid - 1;
		}
	}
	int res;
	if (lo == SZ(t[y].fi)) res = 0;
	else res = ((lo == SZ(s[x]) || s[x][lo] < t[y].fi[lo])  ? -1 : 1);
	// cerr << "ask " << x << ' ' << y << ' ' << res << endl;
	return res;
}
int qry(int x, int y)
{
	if (x > y) swap(x, y);
	int sz = 31 - __builtin_clz(y - x + 1);
	return min(sparse[sz][x], sparse[sz][y - (1 << sz) + 1]);
}
bool cmp(int x, int y)
{
	int lo = 0, hi = min(SZ(s[x]), SZ(s[y]));
	while(hi > lo)
	{
		int mid = (hi + lo + 1) >> 1;
		if (sh[x][mid] == sh[y][mid])
		{
			lo = mid;
		}
		else
		{
			hi = mid - 1;
		}
	}
	if (lo == min(SZ(s[x]), SZ(s[y]))) return SZ(s[x]) < SZ(s[y]);
	return (s[x][lo] < s[y][lo]);
}

int fen[MAXM];

void upd(int idx, int v)
{
	for (int e = idx + 1; e <= N; e += e & (-e))
	{
		fen[e] += v;
	}
}
int query(int idx)
{
	int res = 0;
	for (int e = idx + 1; e; e -= e & (-e))
	{
		res += fen[e];
	}
	return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> M >> Q;
	FOR(i, 0, M)
	{
		string temps;
		cin >> temps;
		for(char c : temps)
		{
			s[i].PB(mpc(c));
		}
		sh[i].PB({0, 0});
		for (int x : s[i])
		{
			pll p = sh[i].back();
			p.fi *= CO; p.fi += x; p.fi %= INF;
			p.se *= CO; p.se += x; p.se %= BIG;
			sh[i].PB(p);
		}
	}
	int ord[M];
	FOR(i, 0, M)
	{
		ord[i] = i;
	}
	sort(ord, ord + M, cmp);
	FOR(i, 0, M)
	{
		t[i].fi = s[i];
	}
	FOR(i, 0, M)
	{
		s[i] = t[ord[i]].fi;
		// for (int x : s[i])
		// {
		// 	cerr << x << ' ';
		// }
		// cerr << endl;
		sh[i].clear();
		sh[i].PB({0, 0});
		for (int x : s[i])
		{
			pll p = sh[i].back();
			p.fi *= CO; p.fi += x; p.fi %= INF;
			p.se *= CO; p.se += x; p.se %= BIG;
			sh[i].PB(p);
		}
	}
	// cerr << endl;
	FOR(i, 0, M)
	{
		beg[i] = SZ(S);
		S.insert(S.end(), s[i].begin(), s[i].end());
		S.PB(5);
		S.PB(i + 6);
	}
	beg[M] = SZ(S);
	FOR(i, 0, Q)
	{
		string temps, tempt;
		cin >> temps >> tempt;
		// DBG(temps); DBG(tempt);
		t[i].fi.clear();
		for (char c : temps)
		{
			t[i].fi.PB(mpc(c));
		}
		for (char c : tempt)
		{
			t[i].se.PB(mpc(c));
		}
		// for (int x : t[i].se)
		// {
		// 	cerr << x << ' ';
		// }
		// cerr << endl;
	}
	FOR(i, 0, Q)
	{
		th[i].PB({0, 0});
		for (int x : t[i].fi)
		{
			pll p = th[i].back();
			p.fi *= CO; p.fi += x; p.fi %= INF;
			p.se *= CO; p.se += x; p.se %= BIG;
			th[i].PB(p);
		}
		teg[i] = SZ(S);
		int lo = 0, hi = M;
		while(hi > lo)
		{
			int mid = (hi + lo) >> 1;
			if (compare(mid, i) == -1) //mid < i
			{
				lo = mid + 1;
			}
			else
			{
				hi = mid;
			}
		}
		lt[i] = lo;
		lo = -1; hi = M - 1;
		while(hi > lo)
		{
			int mid = (hi + lo + 1) >> 1;
			if (compare(mid, i) == 1)
			{
				hi = mid - 1;
			}
			else
			{
				lo = mid;
			}
		}
		rt[i] = lo;
		// cerr << lt[i] << ' ' << rt[i] << endl;
		S.insert(S.end(), t[i].se.begin(), t[i].se.end());
		S.PB(5);
		S.PB(i + M + 6);
		//count how many of the above strings, start with S and end with T
	}
	teg[Q] = SZ(S);
	N = SZ(S);
	getsuf();
	getlcp();
	// FOR(i, 0, N)
	// {
	// 	cerr << S[i] << ' ';
	// }
	// cerr << endl;
	// FOR(i, 0, N)
	// {
	// 	cerr << suf[i] << ' ';
	// }
	// cerr << endl;
	// FOR(i, 0, N)
	// {
	// 	cerr << lcp[i] << ' ';
	// }
	// cerr << endl;
	FOR(i, 0, N)
	{
		sparse[0][i] = lcp[i];
	}
	FOR(i, 1, 25)
	{
		FOR(j, 0, N)
		{
			if (j + (1 << i) > N) continue;
			sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + (1 << (i - 1))]);
		}
	}
	FOR(i, 0, Q)
	{
		int x = teg[i];
		if (lt[i] > rt[i]) continue;
		// cerr << lt[i] << ' ' << rt[i] << endl;
		lt[i] = beg[lt[i]];
		rt[i] = beg[rt[i] + 1] - 1;
		int idx = teg[i], sz = SZ(t[i].se) + 1;
		// cerr << lt[i] << ' ' << rt[i] << ' ' << idx << ' ' << sz << endl;
		int L, R;
		int lo = 0, hi = srank[idx];
		while(hi > lo)
		{
			int mid = (hi + lo) >> 1;
			if (qry(mid, srank[idx] - 1) >= sz)
			{
				hi = mid;
			}
			else
			{
				lo = mid + 1;
			}
		}
		L = lo;
		lo = srank[idx]; hi = N - 1;
		while(hi > lo)
		{
			int mid = (hi + lo + 1) >> 1;
			if (qry(srank[idx], mid - 1) >= sz)
			{
				lo = mid;
			}
			else
			{
				hi = mid - 1;
			}
		}
		R = hi;
		// cerr << "OK " << L << ' ' << R << endl;
		if (L != 0)
		{
			quer[L - 1].PB({{lt[i], rt[i]}, {i, -1}});
		}
		quer[R].PB({{lt[i], rt[i]}, {i, 1}});
		// FOR(j, L, R + 1)
		// {
		// 	if (lt[i] <= suf[j] && suf[j] <= rt[i])
		// 	{
		// 		ans[i]++;
		// 	}
		// }
		//how many have lcp(a....idx) is >= SZ(t[i].se) + 1 AND it's within lt[i]...rt[i]
		//when does lcp get greater than x?
	}
	FOR(i, 0, N)
	{
		upd(suf[i], 1);
		for (auto p : quer[i])
		{
			ans[p.se.fi] += p.se.se * (query(p.fi.se) - query(p.fi.fi - 1));
		}
	}
	FOR(i, 0, Q)
	{
		cout << ans[i] << '\n';
	}
	//
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

컴파일 시 표준 에러 (stderr) 메시지

selling_rna.cpp: In function 'int32_t main()':
selling_rna.cpp:471:7: warning: unused variable 'x' [-Wunused-variable]
   int x = teg[i];
       ^
selling_rna.cpp: In function 'int mpc(char)':
selling_rna.cpp:169:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 40