Submission #1017206

#TimeUsernameProblemLanguageResultExecution timeMemory
1017206vjudge1Lampice (COCI21_lampice)C++17
50 / 50
1 ms348 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...