제출 #137399

#제출 시각아이디문제언어결과실행 시간메모리
137399vardan__02Gift (IZhO18_nicegift)C++14
0 / 100
1657 ms36388 KiB
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
ll n,k,a[1000005],m,i,j,p,q,t,u,v;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]!=a[1])
            t=1;
    }
    if(t==0)
    {
        if(n%k!=0)
            cout<<-1<<endl;
        else
        {
            cout<<n/k<<endl;
            cout<<a[1]<<" ";
            for(i=1;i<=n;i++)
            {
                cout<<i<<" ";
                if(i%k==0)
                {
                    cout<<endl;
                    if(i!=n)
                        cout<<a[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...
#Verdict Execution timeMemoryGrader output
Fetching results...