Submission #792195

#	Time	Username	Problem	Language	Result	Execution time	Memory
792195		cig32	Lampice (COCI21_lampice)	C++17	50 / 50	1 ms	324 KiB

Main

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
  int n, k;
  cin >> n >> k;
  int a[n+1];
  for(int i=1; i<=n; i++) cin >> a[i];
  for(int i=1; i<=n; i++) {
    for(int j=i; j<=n; j++) {
      int len = j-i+1;
      if(i + k*len - 1 <= n) {
        bool ok = 1;
        for(int l=0; l<k; l++) {
          for(int m=0; m<len; m++) {
            ok &= (a[i+m+l*len] == a[i+m]);
          }
        }
        if(ok) {
          cout << len << "\n";
          for(int l=i; l<=j; l++) cout << a[l] << " \n"[l==j];
          return;
        }
      }
    }
  }
  cout << "-1\n";
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25