Submission #530925

#	Time	Username	Problem	Language	Result	Execution time	Memory
530925		Slavita	Lampice (COCI21_lampice)	C++14	50 / 50	1 ms	204 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e5 + 228;
const int big = 1e9;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, a[N], k;

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int l = 1; l <= n; l++){
        for (int len = 1; len <= n / k; len++){
            int kol = 0;
            for (int i = l; i <= n; i += len){
                bool ok = 1;
                if (i + len - 1 > n) {break;}
                for (int j = i; j <= i + len - 1; j++){
                    if (a[l + (j - i)] != a[j]) ok = 0;
                }
                if (ok) kol++;
                else break;
            }
            if (kol == k) {
                cout << len << en;
                for (int i = l; i <= l + len - 1; i++) cout << a[i] << ' ';
                exit(0);
            }
        }
    }
    cout << -1;
    return 0;
}
/*
12 2
1 5 1 3 5 3 1 5 1 3 5 3
12 2
1 5 1 3 5 3 1 5 1 3 5 2
12 2
1 5 1 3 5 3 1 5 3 1 5 1
*/

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