제출 #446881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446881		Return_0	Matching (CEOI11_mat)	C++17	9 / 100	312 ms	25416 KiB

mat

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long long lol;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e6 + 3, base = 1e6 + 7;

inline ll add (ll x, ll y) { x += y; return x >= mod ? x - mod : x; }
inline ll sub (ll x, ll y) { x -= y; return x < 0 ? x + mod : x; }
#define mul(x, y) ((lol) (x) * (y) % mod)
inline ll bpow (ll x, ll n) { ll t = 1; for (; n; n >>= 1, x = mul(x, x)) if (n & 1) t = mul(t, x); return t; }
inline ll inv (cl &x) { return bpow(x, mod - 2); }

ll pw [N], INV, PW = 1, I = 1;
ll a [N], p [N], n, m, H, cur, cnt;
ll fen [N], fen2 [N];
vector <ll> ans;

inline ll ask (ll l, ll r) {
	ll t = 0;
	for (; r; r -= r & -r) t = add(t, fen[r]);
	for (l--; l; l -= l & -l) t = sub(t, fen[l]);
	return mul(t, I);
}

inline ll Ask (ll i) {
	ll t = 0;
	for (; i; i -= i & -i) t += fen2[i];
	return t;
}

inline void upd (ll i, ll x) {
	x = mul(x, PW);
	for (; i < N; i += i & -i) fen[i] = add(fen[i], x);
}

inline void Upd (ll i, cl &x) { for (; i < N; i += i & -i) fen2[i] += x; }

inline void Ins (ll x) {
	cur = add(cur, ask(x + 1, N - 1));
	upd(x, pw[cnt]);
	Upd(x, 1);
	cur = add(cur, mul(Ask(x), pw[cnt]));
	cnt++;
}

inline void Rmv (ll x) {
	cur = sub(cur, Ask(x));
	Upd(x, -1);
	upd(x, sub(0, ask(x, x)));
	cur = mul(cur, INV);
	PW = mul(PW, base), I = mul(I, INV);
	cur = sub(cur, ask(x + 1, N - 1));
	cnt--;
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	pw[0] = 1; for (ll i = 1; i < N; i++) pw[i] = mul(pw[i - 1], base);
	INV = inv(base);

	cin>> n >> m;
	for (ll i = 1, x; i <= n; i++) cin>> x, p[x] = i;
	for (ll i = 1; i <= n; i++) H = add(H, mul(p[i], pw[i - 1]));
	input(1, m, a);

	for (ll i = 1; i < n; i++) Ins(a[i]);
	for (ll i = n; i <= m; i++) {
		Ins(a[i]);
		if (cur == H) ans.push_back(i - n + 1);
		Rmv(a[i - n + 1]);
	}
	
	cout<< SZ(ans) << '\n';
	output(0, SZ(ans), ans, 1);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 10
2 1 5 3 4
5 6 3 8 12 7 1 10 11 9

3 4
1 2 3
10 2 3 4

*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10