This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
int32_t main(){
fast
int n, k;
cin >> n >> k;
vector <int> arr(n);
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
for(int len = 1; len <= n / k; len++) {
for(int b = 0; b <= n - k * len; b++) {
bool yes = 1;
for(int i = b; i < b + k * len; i++) {
if(arr[i] != arr[(i - b) % len + b]) {
yes = 0;
}
}
if(yes) {
cout << len << "\n";
for(int i = b; i < b + len; i++) {
cout << arr[i] << " ";
}
return 0;
}
}
}
cout << -1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |