Submission #1163538

#TimeUsernameProblemLanguageResultExecution timeMemory
1163538asli_bgLampice (COCI21_lampice)C++20
10 / 50
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define int long long typedef pair<int,int> pii; typedef vector<pii> vii; typedef vector<int> vi; #define FOR(i,a) for(int i=0;i<(a);i++) #define FORE(i,a,b) for(int i=(a);i<(b);i++) #define all(x) x.begin(),x.end() #define fi first #define se second #define pb push_back #define sp <<" "<< #define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl; #define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl; #define DEBUG(x) cout<<#x sp x<<endl; #define carp(x,y) ((x%MOD)*(y%MOD))%MOD #define topla(x,y) ((x%MOD)+(y%MOD))%MOD #define mid (l+r)/2 const int MAXN=2e5+5; const int INF=1e18; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n,k; cin>>n>>k; vi val(n+1); FORE(i,1,n+1) cin>>val[i]; int cev=0; set<int> s; FORE(bas,1,n+1){ FORE(son,bas,n+1){ int len=son-bas+1; if(len%k!=0) continue; int ara=len/k; bool f=true; FOR(i,ara){ int cur=-1; for(int j=bas+i;j<=son;j+=ara){ if(cur==-1) cur=val[j]; else{ if(val[j]!=cur) {f=false;break;} } } } if(f){ cev=ara; FORE(i,bas,son+1) s.insert(val[i]); break; } } if(cev!=0) break; } if(cev!=0) {cout<<cev<<endl;cont(s);} else cout<<-1<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...