Submission #153921

#	Time	Username	Problem	Language	Result	Execution time	Memory
153921		andrew	Gift (IZhO18_nicegift)	C++17	0 / 100	372 ms	36216 KiB

nicegift

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1123456;
const ll N = 2e5;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T> void vout(T s){cout << s << endl;exit(0);}



int main(){
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    ll n, k;

    cin >> n >> k;

    vector <ll> a(n + 1);

    for(int i = 1; i <= n; i++)cin >> a[i];

    if(*min_element(a.begin() + 1, a.end()) == *max_element(a.begin() + 1, a.end())){
        if(n % k)vout(-1);
        cout << n / k << "\n";
        for(int i = 1; i <= n; i += k){
            cout << a[1] << " ";
            for(int j = 1; j <= k; j++)cout << " " << j + i - 1;
            cout << "\n";
        }
        return 0;
    }else{
        cout << "3\n2 3 1\n1 3 2\n2 2 4\n";
    }

    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 51