| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 666981 | Kenpar | Lampice (COCI21_lampice) | C++17 | 1 ms | 324 KiB | 
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;
#define ll long long
#define endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e18;
const ll MAX = 1e5;
void solve(){	
	int n,k; cin>>n>>k;
	int arr[n];
	for(int i = 0; i < n; i++){
		cin>>arr[i];
	}
	int ans = 0;
	vector<int> ansVec;
	for(int i = 0; i < n; i++){
		int l = 0, r = i;
		while(r < n){
			int curAns = 0;
			int cur = l;
			int curIndex = l;
			while(cur < n){
				if(arr[cur] == arr[curIndex]){
					cur++;
					curIndex++;
					if(curIndex > r){
						curIndex = l;
						curAns++;
					}
				}else{
					break;
				}
			}
			if(ans < curAns){
				ans = curAns;
				ansVec.clear();
				for(int i = l; i <= r; i++){
					ansVec.push_back(arr[i]);
				}
			}
			l++;
			r++;
		}
	}
	if(ans >= k){
		cout<<ansVec.size()<<endl;
		for(int a : ansVec) cout<<a<<" ";
	}else{
		cout<<-1;
	}
	
}	 
int main()
{
    cin.tie(NULL);
    ios::sync_with_stdio(NULL);
    int t = 1;
    //cin>>t;
    int temp = t;
    while(t--){
        //cout<<"Case #"<<temp - t<<" > "<<endl;
        solve();
        cout<<endl;
    }
}
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... | ||||
