Submission #1017223

#TimeUsernameProblemLanguageResultExecution timeMemory
1017223vjudge1Lampice (COCI21_lampice)C++17
25 / 50
1 ms456 KiB
#include <bits/stdc++.h> #define fast cin.tie(0)->sync_with_stdio(0); #define int long long #define inf ((int)1e18) using namespace std; void solve() { int n,k; cin>>n>>k; vector<int>x(n); vector<int>y; for(int i=0;i<n;i++){ cin>>x[i]; } for(int i=1;i<=(n/k);i++){ int cnt=i; for(int j=0;j<n-i;j++){ if(cnt/i>=k){ cout<<i<<endl; for(int s=0;s<i;s++){ cout<<y[s]<<" "; } cout<<endl; return; } if(x[j]==x[j+i]){ cnt+=1; y.push_back(x[j]); } else if(cnt>i){ cnt=i; y.clear(); } if(cnt/i>=k){ cout<<i<<endl; for(int s=0;s<i;s++){ cout<<y[s]<<" "; } cout<<endl; return; } } } cout<<-1<<endl; } int32_t main(){ fast solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...