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>
using namespace std;
bool check(vector<int> const&a, int l, int r, int k) {
int patsize = (r - l + 1) / k;
vector<int> pattern(patsize);
for(int i = l; i < l + patsize; i++) {
pattern[i - l] = a[i];
}
for(int j = l + patsize; j < r + (patsize == 1 ? 1 : 0); j += patsize) {
for(int i = j; i < j + patsize; i ++) {
if(pattern[i - j] != a[i]) return false;
}
}
return true;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for(auto &x:a) cin >> x;
for(int i = 0; i < n; i ++) {
for(int j = i; j < n; j ++) {
if((j - i + 1) % k != 0) continue;
bool flag = check(a, i, j, k);
if(flag) {
cout << (j - i + 1) / k << '\n';
for(int t = i; t < i + ((j - i + 1) / k); t ++) {
cout << a[t] << ' ';
}
cout << '\n';
return 0;
}
}
}
cout << "-1\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |