Submission #433182

#	Time	Username	Problem	Language	Result	Execution time	Memory
433182		Return_0	Matching (CEOI11_mat)	C++17	83 / 100	2076 ms	43328 KiB

mat

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse2,sse4,avx,avx2")

#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 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 + 7, base = 1e6 + 11;

ll pw [N], H, cur;
ll p [N], a [N], n, m;
ll cmprs [N], ans [N], lst;

struct fenwick {
	ll fen [N];
	inline void inc (ll i) { for (; i < N; i += i & -i) ++fen[i]; }
	inline void dec (ll i) { for (; i < N; i += i & -i) --fen[i]; }
	inline ll ask (ll i) { ll t = 0; for (; i; i -= i & -i) t += fen[i]; return t; }
} fen;

struct segtree {
	ll lz [N << 2], sum [N << 2];

	inline void push (cl &v, cl &x) { sum[v] *= pw[x]; lz[v] += x; }
	inline void shift (cl &v) { if (lz[v]) { push(lc, lz[v]); push(rc, lz[v]); lz[v] = 0; } }

	void modify (cl &pos, cl &x, cl &l = 1, cl &r = m, cl &v = 1) {
		if (l == r) { sum[v] = x; return; }
		shift(v);
		if (pos <= mid) modify(pos, x, l, mid, lc);
		else modify(pos, x, mid + 1, r, rc);
		sum[v] = sum[lc] + sum[rc];
	}

	ll ask (cl &ql, cl &qr, cl &l = 1, cl &r = m, cl &v = 1) {
		if (r < ql || qr < l) return 0;
		if (ql <= l && r <= qr) return sum[v];
		shift(v);
		return ask(ql, qr, l, mid, lc) + ask(ql, qr, mid + 1, r, rc);
	}
} seg;


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] = pw[i - 1] * 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 = H * base + p[i];
	for (ll i = 1; i <= m; i++) cin>> a[i], cmprs[i] = a[i];
	sort(cmprs + 1, cmprs + m + 1);
	for (ll i = 1; i <= m; i++) {
		a[i] = lower_bound(cmprs + 1, cmprs + m + 1, a[i]) - cmprs;
		if (i > n) {
			cur -= pw[n - 1] * fen.ask(a[i - n]) + seg.ask(a[i - n] + 1, m);
			fen.dec(a[i - n]); seg.modify(a[i - n], 0);
		}
		seg.push(1, 1);
		fen.inc(a[i]); seg.modify(a[i], 1);
		cur = cur * base + fen.ask(a[i]) + seg.ask(a[i] + 1, m);
		if (i >= n && cur == H) ans[lst++] = i - n + 1;
	}
	cout<< lst << '\n'; output(0, lst, 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

*/

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