Submission #628601

#	Time	Username	Problem	Language	Result	Execution time	Memory
628601		vovamr	Lampice (COCI21_lampice)	C++17	50 / 50	1 ms	328 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, k;
	cin >> n >> k;
	ve<int> a(n);
	for (auto &i : a) cin >> i;

	int ans = iinf, L = 0, R = n - 1;
	for (int l = 0; l < n; ++l) {
		for (int r = l + k - 1; r < n; r += k) {
			bool ok = 1;
			int d = (r - l + 1) / k;
			for (int i = l + d; i <= r; ++i) ok &= (a[i] == a[i - d]);
			if (ok) {
				L = l, R = l + d - 1;
				ans = R - L + 1;
			}
		}
	}
	if (ans == iinf) return void(cout << -1);

	cout << ans << '\n';
	for (int i = L; i <= R; ++i) cout << a[i] << " ";
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

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