제출 #963366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963366		MilosMilutinovic	Gift (IZhO18_nicegift)	C++14	30 / 100	55 ms	17820 KiB

nicegift

#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,k;
int a[2000005];

int main(){
	n=readint(); k=readint();
	for(int i=1;i<=n;i++) a[i]=readint();
	set<pii> st;
	for(int i=1;i<=n;i++) if(a[i]>0) st.emplace(a[i],i);
	vector<vector<int>> ans;
	while(!st.empty()){
		if(st.size()<k){
			printf("-1\n");
			return 0;
		}
		ans.pb({});
		for(int i=1;i<=k;i++){
			auto it=prev(st.end());
			ans.back().pb(it->se);
			a[it->se]--;
			st.erase(it);
		}
		for(int i:ans.back()){
			if(a[i]>0) st.emplace(a[i],i);
		}
	}
	printf("%d\n",ans.size());
	for(auto p:ans){
		printf("1 ");
		for(int i=0;i<(int)p.size();i++){
			printf("%d ",p[i]);
		}
		printf("\n");
	}
	return 0;
}

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

nicegift.cpp: In function 'int main()':
nicegift.cpp:36:15: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |   if(st.size()<k){
      |      ~~~~~~~~~^~
nicegift.cpp:51:11: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wformat=]
   51 |  printf("%d\n",ans.size());
      |          ~^    ~~~~~~~~~~
      |           |            |
      |           int          std::vector<std::vector<int> >::size_type {aka long unsigned int}
      |          %ld

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