제출 #860855

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860855		alexdd	Gift (IZhO18_nicegift)	C++17	30 / 100	267 ms	38316 KiB

nicegift

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,k;
int a[1000005];
priority_queue<pair<int,int>> pq;
vector<vector<int>> af;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        sum += a[i];
        pq.push({a[i],i});
    }
    if(sum%k!=0)
    {
        cout<<-1;
        return 0;
    }
    if(sum<=1000000)
    {
        while(!pq.empty())
        {
            if((int)pq.size()<k)
            {
                cout<<-1;
                return 0;
            }
            vector<int> sc;
            //cout<<1<<" ";
            for(int i=0;i<k;i++)
            {
                sc.push_back(pq.top().second);
                a[sc.back()]--;
                //cout<<sc.back()<<" ";
                pq.pop();
            }
            //cout<<"\n";
            for(auto x:sc)
                if(a[x]>0)
                    pq.push({a[x],x});
            af.push_back(sc);
        }
        cout<<af.size()<<"\n";
        for(int i=0;i<(int)af.size();i++)
        {
            cout<<1<<" ";
            for(int j=0;j<af[i].size();j++)
                cout<<af[i][j]<<" ";
            cout<<"\n";
        }
    }
    else
    {
        if(n%k==0)
        {
            cout<<n/k<<"\n";
            for(int i=1;i<=n;i+=k)
            {
                cout<<a[1]<<" ";
                for(int j=i;j<i+k;j++)
                    cout<<j<<" ";
                cout<<"\n";
            }
        }
        else
        {
            cout<<-1;
        }
    }
    return 0;
}
/**
4 2
2 3 3 2
*/

컴파일 시 표준 에러 (stderr) 메시지

nicegift.cpp: In function 'int main()':
nicegift.cpp:52:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |             for(int j=0;j<af[i].size();j++)
      |                         ~^~~~~~~~~~~~~

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