# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1183200 | nevuorig | Matching (CEOI11_mat) | C++20 | 1940 ms | 3072 KiB |
#include <iostream>
using namespace std;
int n , m , i , j , lst , x , t = 0 , a[50009] , b[200009] , ans[200009];
main()
{
cin >> n >> m;
for (i = 1 ; i <= n ; i ++) cin >> a[i];
for (i = 1 ; i <= m ; i ++)
{
cin >> b[i];
if (i >= n)
{
lst = b[i - n + a[1]];
for (j = 2 ; j <= n ; j ++)
{
x = b[i - n + a[j]];
if (x < lst) goto to;
lst = x;
}
ans[t ++] = i - n + 1;
to:;
}
}
cout << t << '\n';
for (i = 0 ; i < t ; i ++) cout << ans[i] << " ";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |