| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 530923 | ivls | Lampice (COCI21_lampice) | C++14 | 1 ms | 320 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
const int inf = 2e9;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, k;
    cin >> n >> k;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int l = 0; l < n; l++)
        for (int r = l; r < n; r++)
            if ((r - l + 1) % k == 0)
            {
                set<vector<int>> p;
                vector<int> cur;
                for (int i = l; i <= r; i++)
                {
                    cur.push_back(a[i]);
                    if (cur.size() == (r - l + 1) / k)
                    {
                        p.insert(cur);
                        cur.clear();
                    }
                }
                if (p.size() == 1)
                {
                    cout << (*p.begin()).size() << "\n";
                    for (auto u : *p.begin()) cout << u << " ";
                    return 0;
                }
            }
    cout << -1;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
