oj.uz

Submission #48540

# Submission time Handle Problem Language Result Execution time Memory
48540 2018-05-15T14:17:38 Z Pajaraja Gift (IZhO18_nicegift) C++17
30 / 100
 943 ms 47700 KB 
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b)
{
	if(a==0) return b;
	return gcd(b%a,a);
}
int main()
{
	int n,k,cnt=0;
	long long t,sum=0;
	scanf("%d%d",&n,&k);
	priority_queue<pair<long long,int> > pq,pq1;
	for(int i=0;i<n;i++) {scanf("%lld",&t); pq.push(make_pair(t,i+1)); pq1.push(make_pair(t,i+1)); sum+=t;}
	if(sum<=100000)
	{
	while(pq.size()>=k)
	{
		stack<pair<int,int> > st;
		for(int i=0;i<k;i++) {st.push(pq.top()); pq.pop();}
		for(int i=0;i<k;i++) {st.top().first--; if(st.top().first!=0) pq.push(st.top()); st.pop();}
		cnt++;
	}
	if(!pq.empty()) {printf("-1"); return 0;}
	printf("%d\n",cnt);
	while(pq1.size()>=k)
	{
		stack<pair<int,int> > st;
		printf("1 ");
		for(int i=0;i<k;i++) {st.push(pq1.top()); pq1.pop();}
		for(int i=0;i<k;i++) {st.top().first--; if(st.top().first!=0) pq1.push(st.top()); printf("%d ",st.top().second); st.pop();}
		printf("\n");
	}
	}
	else
	{
	if(pq.top().first%(k/gcd(n,k))!=0) {printf("-1"); return 0;}
	long long f=pq.top().first/(k/gcd(n,k));
	while(pq.size()>=k)
	{
		stack<pair<int,int> > st;
		for(int i=0;i<k;i++) {st.push(pq.top()); pq.pop();}
		for(int i=0;i<k;i++) {st.top().first-=f; if(st.top().first!=0) pq.push(st.top()); st.pop();}
		cnt++;
	}
	if(!pq.empty()) {printf("-1"); return 0;}
	printf("%d\n",cnt);
	while(pq1.size()>=k)
	{
		stack<pair<int,int> > st;
		for(int i=0;i<k;i++) {st.push(pq1.top()); pq1.pop();}
		printf("%lld ",f);
		for(int i=0;i<k;i++) {st.top().first-=f; if(st.top().first!=0) pq1.push(st.top()); printf("%d ",st.top().second); st.pop();}
		printf("\n");
	}
	}
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:17:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(pq.size()>=k)
        ~~~~~~~~~^~~
nicegift.cpp:26:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(pq1.size()>=k)
        ~~~~~~~~~~^~~
nicegift.cpp:39:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(pq.size()>=k)
        ~~~~~~~~~^~~
nicegift.cpp:48:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(pq1.size()>=k)
        ~~~~~~~~~~^~~
nicegift.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
nicegift.cpp:14:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) {scanf("%lld",&t); pq.push(make_pair(t,i+1)); pq1.push(make_pair(t,i+1)); sum+=t;}
                        ~~~~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 2 ms 360 KB n=3
3 Correct 2 ms 436 KB n=3
4 Correct 3 ms 436 KB n=4
5 Correct 2 ms 452 KB n=4
6 Correct 2 ms 484 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 2 ms 360 KB n=3
3 Correct 2 ms 436 KB n=3
4 Correct 3 ms 436 KB n=4
5 Correct 2 ms 452 KB n=4
6 Correct 2 ms 484 KB n=2
7 Correct 2 ms 484 KB n=5
8 Correct 3 ms 484 KB n=8
9 Correct 12 ms 672 KB n=14
10 Correct 8 ms 672 KB n=11
11 Correct 68 ms 3056 KB n=50000
12 Correct 66 ms 3212 KB n=50000
13 Correct 38 ms 3212 KB n=10
14 Correct 49 ms 3212 KB n=685
15 Correct 51 ms 3212 KB n=623
16 Correct 31 ms 3212 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 2 ms 360 KB n=3
3 Correct 2 ms 436 KB n=3
4 Correct 3 ms 436 KB n=4
5 Correct 2 ms 452 KB n=4
6 Correct 2 ms 484 KB n=2
7 Correct 2 ms 484 KB n=5
8 Correct 3 ms 484 KB n=8
9 Correct 12 ms 672 KB n=14
10 Correct 8 ms 672 KB n=11
11 Correct 68 ms 3056 KB n=50000
12 Correct 66 ms 3212 KB n=50000
13 Correct 38 ms 3212 KB n=10
14 Correct 49 ms 3212 KB n=685
15 Correct 51 ms 3212 KB n=623
16 Correct 31 ms 3212 KB n=973
17 Correct 48 ms 3212 KB n=989
18 Correct 24 ms 3212 KB n=563
19 Correct 36 ms 3212 KB n=592
20 Correct 37 ms 3212 KB n=938
21 Correct 27 ms 3212 KB n=747
22 Correct 31 ms 3212 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 943 ms 47700 KB n=1000000
2 Correct 589 ms 47700 KB n=666666
3 Correct 321 ms 47700 KB n=400000
4 Incorrect 446 ms 47700 KB Jury has the answer but participant has not
5 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 2 ms 360 KB n=3
3 Correct 2 ms 436 KB n=3
4 Correct 3 ms 436 KB n=4
5 Correct 2 ms 452 KB n=4
6 Correct 2 ms 484 KB n=2
7 Correct 2 ms 484 KB n=5
8 Correct 3 ms 484 KB n=8
9 Correct 12 ms 672 KB n=14
10 Correct 8 ms 672 KB n=11
11 Correct 68 ms 3056 KB n=50000
12 Correct 66 ms 3212 KB n=50000
13 Correct 38 ms 3212 KB n=10
14 Correct 49 ms 3212 KB n=685
15 Correct 51 ms 3212 KB n=623
16 Correct 31 ms 3212 KB n=973
17 Correct 48 ms 3212 KB n=989
18 Correct 24 ms 3212 KB n=563
19 Correct 36 ms 3212 KB n=592
20 Correct 37 ms 3212 KB n=938
21 Correct 27 ms 3212 KB n=747
22 Correct 31 ms 3212 KB n=991
23 Correct 943 ms 47700 KB n=1000000
24 Correct 589 ms 47700 KB n=666666
25 Correct 321 ms 47700 KB n=400000
26 Incorrect 446 ms 47700 KB Jury has the answer but participant has not
27 Halted 0 ms 0 KB -