Submission #863219

#TimeUsernameProblemLanguageResultExecution timeMemory
863219Cyber_WolfLampice (COCI21_lampice)C++17
50 / 50
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define lg long long int main() { lg n, k; cin >> n >> k; vector<lg> v(n); for(int i = 0; i < n; i++) { cin >> v[i]; } vector<lg> ans; for(int i = 0; i < n; i++) { for(int j = i; j+(j-i+1)*(k-1) < n; j++) { bool b = 1; for(int l = i; l <= j; l++) { for(int z = 0; z < k; z++) { if(v[l] != v[l+z*(j-i+1)]) { b = 0; break; } } } if(b) { for(int l = i; l <= j; l++) ans.push_back(v[l]); break; } } if(ans.size()) break; } if(ans.empty()) { cout << "-1\n"; return 0; } cout << ans.size() << '\n'; for(auto it : ans) cout << it << ' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...