oj.uz

답안 #386861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386861 2021-04-07T14:04:43 Z vanic Gift (IZhO18_nicegift) C++14
30 / 100
 2000 ms 123472 KB 
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <set>
 
using namespace std;
typedef long long ll;
 
const int maxn=1e6+5;
 
ll a[maxn];
int ind[maxn];
ll sum;
pair < ll, int > v[maxn*3];
set < int > cur;

bool cmp(int a1, int b1){
	return a[a1]>a[b1];
}

int main(){
	int n, k;
	scanf("%d%d", &n, &k);
	for(int i=0; i<n; ++i){
		scanf("%lld", a+i);
		sum+=a[i];
		ind[i]=i;
	}
	if(sum%k){
		printf("-1\n");
		return 0;
	}
	sum/=k;
	for(int i=0; i<n; ++i){
		if(a[i]>sum){
			printf("-1\n");
			return 0;
		}
	}
	sort(ind, ind+n, cmp);
	int pos=0;
	int iduc;
	int br=0;
	for(int i=0; i<n; ++i){
		iduc=pos+a[ind[i]];
		if(iduc>sum){
			v[br]={pos, ind[i]+1};
			++br;
			iduc-=sum;
			pos=0;
		}
		v[br]={pos, ind[i]+1};
		++br;
		if(iduc!=sum){
			v[br]={iduc, -ind[i]-1};
			++br;
		}
		else{
			iduc=0;
		}
		pos=iduc;
	}
	v[br]={sum, 0};
	++br;
	sort(v, v+br);
	int sol=0;
	for(int i=0; i<br-1; ++i){
		if(v[i].first!=v[i+1].first){
			++sol;
		}
	}
	printf("%d\n", sol);
	for(int i=0; i<br-1; ++i){
		if(v[i].second>0){
			cur.insert(v[i].second);
		}
		else{
			cur.erase(-v[i].second);
		}
		if(v[i].first==v[i+1].first){
			continue;
		}
		printf("%lld ", v[i+1].first-v[i].first);
		for(int x : cur){
			printf("%d ", x);
		}
		printf("\n");
	}
	return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:23:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
nicegift.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |   scanf("%lld", a+i);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 2 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 2 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Correct 1 ms 364 KB n=14
10 Correct 1 ms 364 KB n=11
11 Correct 43 ms 3180 KB n=50000
12 Correct 45 ms 3180 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 2 ms 384 KB n=685
15 Correct 1 ms 364 KB n=623
16 Correct 2 ms 364 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 2 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Correct 1 ms 364 KB n=14
10 Correct 1 ms 364 KB n=11
11 Correct 43 ms 3180 KB n=50000
12 Correct 45 ms 3180 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 2 ms 384 KB n=685
15 Correct 1 ms 364 KB n=623
16 Correct 2 ms 364 KB n=973
17 Correct 3 ms 364 KB n=989
18 Correct 2 ms 364 KB n=563
19 Correct 3 ms 364 KB n=592
20 Correct 3 ms 364 KB n=938
21 Correct 3 ms 364 KB n=747
22 Correct 3 ms 364 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2080 ms 123472 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 2 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Correct 1 ms 364 KB n=14
10 Correct 1 ms 364 KB n=11
11 Correct 43 ms 3180 KB n=50000
12 Correct 45 ms 3180 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 2 ms 384 KB n=685
15 Correct 1 ms 364 KB n=623
16 Correct 2 ms 364 KB n=973
17 Correct 3 ms 364 KB n=989
18 Correct 2 ms 364 KB n=563
19 Correct 3 ms 364 KB n=592
20 Correct 3 ms 364 KB n=938
21 Correct 3 ms 364 KB n=747
22 Correct 3 ms 364 KB n=991
23 Execution timed out 2080 ms 123472 KB Time limit exceeded
24 Halted 0 ms 0 KB -