제출 #1287023

#제출 시각아이디문제언어결과실행 시간메모리
1287023riamuLampice (COCI19_lampice)C++17
0 / 110
1 ms572 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 55;

int n, k;
int p[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> k;
    for (int i = 0; i < n; ++i) cin >> p[i];

    for (int l = 0; l < n; ++l) {
        for (int r = l; r < n; ++r) {
            int ok = 1, d = r - l + 1;
            for (int i = 1; i < k && ok; ++i) {
                for (int j = l; j <= r; ++j) {
                    if (j + i * d >= n || p[j + i * d] != p[j]) {
                        ok = 0;
                        break;
                    }
                }
            }
            if (ok) {
                cout << (r - l + 1) << "\n";
                for (int i = l; i <= r; ++i) cout << p[i] << " ";
                return 0;
            }
        }
    }

    cout << -1;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...