Submission #1314620

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314620		arman.khachatryan	Gift (IZhO18_nicegift)	C++20	0 / 100	86 ms	13188 KiB

nicegift

#include <bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int a[N];
int main() {
    int n, k;
    cin>>n>>k;
    int s=0;
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    int g;
    for(int i=1; i<=k; i++){
        if(n%i==0 && k%i==0){
            g=i;
        }
    }
    if((n*a[0])%k!=0){
        cout<<-1;
        return 0;
    }
    cout<<n/k-1+(k+n%k)/g<<'\n';
    for(int j=1; j<=n/k-1; j++){
        cout<<a[0]<<" ";
        for(int i=j*k-k+1; i<=j*k; i++){
            cout<<i<<" ";
        }
        cout<<'\n';
    }
    queue<int> q;
    for(int i=(n/k-1)*k+1; i<=n-n%k; i++){
        q.push(i);
    }
    for(int j=0; j<(k+n%k)/g; j++){
        cout<<a[0]*g/k<<" ";
        queue<int> dq=q;
        while(!dq.empty()){
            cout<<dq.front()<<" ";
            dq.pop();
        }
        cout<<'\n';
        int f=g;
        while(f--){
            int t=q.front();
            q.pop();
            if(t+k<=n){
                q.push(t+k);
            }else{
                q.push(t-n%k);
            }
        }
    }
}

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