Submission #349666

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
349666	2021-01-18T06:51:40 Z	silverfish	Matching (CEOI11_mat)	C++14	100 / 100	900 ms	59804 KB

#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 1e6, M = 2*N + 1;

int p[2*N+1], pi[2*N+1], place[N+1], n, m;
ar<int,2> sorted[2*N+1];
int fen[2*N+1];

void upd(int i, int v){
	for(; i <= M; i += i&-i) fen[i] += v;
}

int get(int i){
	int ret = 0;
	for(; i > 0; i -= i&-i) ret += fen[i];
	return ret;
}

int main(void)
{
	FAST;

	cin >> n >> m;

	for(int i = 0; i < n; ++i){
		int x; cin >> x;
		p[--x] = i+1;
	}

	for(int i = 0; i < n; ++i){
		place[i] = get(p[i]);
		upd(p[i], 1);
	}
	for(int i = 0; i < n; ++i) upd(p[i], -1);

	p[n] = -1;

	for(int i = n+1; i <= n+m; ++i){
		cin >> p[i];
		p[i] += n;
	}
	for(int i = 0; i <= n+m; ++i){
		sorted[i] = {p[i], i};
	}
	sort(sorted, sorted+n+m+1);
	p[n] = -1;
	for(int i = 1; i <= n+m; ++i){
		p[sorted[i][1]] = i;
	}

	pi[0] = 0;

	int cnt = 0, left = 1;
	vector<int> ans;

	for(int i = 1; i <= n+m; ++i){

		if(p[i] == -1){
			pi[i] = 0;
			while(left < i){
				upd(p[left++], -1);
			}
			left++;
			continue;
		}

		int j = pi[i-1];

		if(j == n) {
			j = pi[j-1];
		}

		while(left < i-j) upd(p[left++], -1);

		while(j > 0 && place[j] != get(p[i])){
			j = pi[j-1];
			while(left < i-j) upd(p[left++], -1);
		}

		if(place[j] == get(p[i])) ++j;

		upd(p[i], 1);

		pi[i] = j;

		if(pi[i] == n){
			++cnt;
			ans.pb(i-n-n);
		}
	}

	cout << cnt << '\n';
	for(int i : ans) cout << i+1 << ' ';
	cout << '\n';

	return 0;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	1004 KB	Output is correct
2	Correct	10 ms	1004 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	1004 KB	Output is correct
2	Correct	8 ms	1004 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	4972 KB	Output is correct
2	Correct	52 ms	4460 KB	Output is correct
3	Correct	96 ms	7716 KB	Output is correct
4	Correct	95 ms	7752 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	5996 KB	Output is correct
2	Correct	83 ms	6380 KB	Output is correct
3	Correct	69 ms	7020 KB	Output is correct
4	Correct	75 ms	7912 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	72 ms	6000 KB	Output is correct
2	Correct	67 ms	5484 KB	Output is correct
3	Correct	74 ms	5100 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	417 ms	36200 KB	Output is correct
2	Correct	872 ms	59804 KB	Output is correct
3	Correct	296 ms	23948 KB	Output is correct

Subtask #9
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	430 ms	36588 KB	Output is correct
2	Correct	383 ms	26860 KB	Output is correct
3	Correct	900 ms	55404 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	351 ms	30060 KB	Output is correct
2	Correct	331 ms	37724 KB	Output is correct
3	Correct	379 ms	31552 KB	Output is correct
4	Correct	649 ms	57836 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	367 ms	31796 KB	Output is correct
2	Correct	375 ms	31852 KB	Output is correct
3	Correct	166 ms	16748 KB	Output is correct
4	Correct	671 ms	56032 KB	Output is correct

Submission #349666

Compilation message