Submission #830749

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
830749	2023-08-19T10:04:21 Z	AnhPham	Matching (CEOI11_mat)	C++17	100 / 100	244 ms	48672 KB

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <functional>
#include <numeric>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <map>
#include <set>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;

int n, m, a[1000005], b[1000005];
int lp[1000005], rp[1000005], fail[1000005];

bool ins1(int x, int p){
	return a[x - lp[p]] <= a[x] && a[x] <= a[x - rp[p]];
}

bool ins2(int x, int p){
	return b[x - lp[p]] <= b[x] && b[x] <= b[x - rp[p]];
}

int nxtl[1000005], nxtr[1000005], r[1000005];

int fl(int x){
	if(x < 0) return x;
	return nxtl[x] = (nxtl[x] == x ? x : fl(nxtl[x]));
}

int fr(int x){
	if(x >= n) return x;
	return nxtr[x] = (nxtr[x] == x ? x : fr(nxtr[x]));
}

int main(){
	cin >> n >> m;
	for(int i=0; i<n; i++){
		int v;
		scanf("%d",&v);
		a[v-1] = i;
		r[i] = v-1;
		nxtl[i] = nxtr[i] = i;
	}
	for(int i=n-1; i>=0; i--){
		nxtl[a[i]] = fl(a[i] - 1);
		nxtr[a[i]] = fr(a[i] + 1);
		if(nxtr[a[i]] < n) rp[i] = i - r[nxtr[a[i]]];
		if(nxtl[a[i]] >= 0) lp[i] = i - r[nxtl[a[i]]];
	}
	int p = 0;
	for(int i=1; i<n; i++){
		while(p > 0 && !ins1(i, p)){
			p = fail[p];
		}
		if(ins1(i, p)) p++;
		fail[i+1] = p;
	}
	p = 0;
	vector<int> v;
	for(int i=0; i<m; i++){
		scanf("%d",&b[i]);
		while(p > 0 && !ins2(i, p)){
			p = fail[p];
		}
		if(ins2(i, p)) p++;
		if(p == n){
			v.push_back(i - n + 2);
			p = fail[p];
		}
	}
	printf("%d\n", v.size());
	for(auto &i : v) printf("%d ",i);
}

Compilation message

mat.cpp: In function 'int main()':
mat.cpp:84:11: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   84 |  printf("%d\n", v.size());
      |          ~^     ~~~~~~~~
      |           |           |
      |           int         std::vector<int>::size_type {aka long unsigned int}
      |          %ld
mat.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |   scanf("%d",&v);
      |   ~~~~~^~~~~~~~~
mat.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d",&b[i]);
      |   ~~~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	3736 KB	Output is correct
2	Correct	19 ms	2492 KB	Output is correct
3	Correct	34 ms	4644 KB	Output is correct
4	Correct	29 ms	4640 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	4612 KB	Output is correct
2	Correct	23 ms	3120 KB	Output is correct
3	Correct	25 ms	3980 KB	Output is correct
4	Correct	32 ms	4504 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	4580 KB	Output is correct
2	Correct	22 ms	3956 KB	Output is correct
3	Correct	23 ms	3692 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	126 ms	21484 KB	Output is correct
2	Correct	244 ms	47860 KB	Output is correct
3	Correct	89 ms	11780 KB	Output is correct

Subtask #9
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	127 ms	23116 KB	Output is correct
2	Correct	104 ms	10868 KB	Output is correct
3	Correct	226 ms	43348 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	109 ms	14608 KB	Output is correct
2	Correct	185 ms	21948 KB	Output is correct
3	Correct	108 ms	16176 KB	Output is correct
4	Correct	191 ms	48672 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	118 ms	16596 KB	Output is correct
2	Correct	113 ms	16388 KB	Output is correct
3	Correct	56 ms	9476 KB	Output is correct
4	Correct	192 ms	45028 KB	Output is correct