oj.uz

답안 #386712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386712 2021-04-07T08:35:05 Z vanic Gift (IZhO18_nicegift) C++14
30 / 100
 2000 ms 108952 KB 
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <set>
#include <bitset>

using namespace std;
typedef long long ll;

const int maxn=1e6+5;

ll a[maxn];
ll sum;
ll v[maxn*4];
int ind[maxn*4];
bitset < maxn*4 > stanje;
int poz[maxn*4];
set < int > cur;

void scan(ll &a){
	a=0;
	char c=getchar();
	while(c>='0' && c<='9'){
		a*=10;
		a+=c-'0';
		c=getchar();
	}
}

bool cmp(int a1, int b1){
	return v[a1]<v[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];
	}
	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;
		}
	}
	int pos=0;
	int iduc;
	int br=0;
	for(int i=0; i<n; i++){
		iduc=pos+a[i];
		if(iduc>sum){
			v[br]=pos;
			ind[br]=br;
			poz[br]=i+1;
			stanje[br]=1;
			br++;
			v[br]=sum;
			ind[br]=br;
			poz[br]=i+1;
			stanje[br]=0;
			br++;
			iduc-=sum;
			pos=0;
		}
		v[br]=pos;
		ind[br]=br;
		poz[br]=i+1;
		stanje[br]=1;
		br++;
		v[br]=iduc;
		ind[br]=br;
		poz[br]=i+1;
		stanje[br]=0;
		br++;
		if(iduc==sum){
			iduc=0;
		}
		pos=iduc;
	}
	sort(ind, ind+br, cmp);
	int sol=0;
	for(int i=0; i<br-1; i++){
		if(v[ind[i]]!=v[ind[i+1]]){
			sol++;
		}
	}
	printf("%d\n", sol);
	for(int i=0; i<br-1; i++){
		if(stanje[ind[i]]){
			cur.insert(poz[ind[i]]);
		}
		else{
			cur.erase(poz[ind[i]]);
		}
		if(v[ind[i]]==v[ind[i+1]]){
			continue;
		}
		printf("%lld ", v[ind[i+1]]-v[ind[i]]);
		for(set < int >::iterator it=cur.begin(); it!=cur.end(); it++){
			printf("%d ", *it);
		}
		printf("\n");
	}
	return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
nicegift.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |   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 1 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 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 2 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 57 ms 2924 KB n=50000
12 Correct 38 ms 2924 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 1 ms 364 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 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 2 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 57 ms 2924 KB n=50000
12 Correct 38 ms 2924 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 1 ms 364 KB n=685
15 Correct 1 ms 364 KB n=623
16 Correct 2 ms 364 KB n=973
17 Correct 3 ms 384 KB n=989
18 Correct 2 ms 364 KB n=563
19 Correct 3 ms 364 KB n=592
20 Correct 3 ms 492 KB n=938
21 Correct 2 ms 364 KB n=747
22 Correct 3 ms 640 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2073 ms 108952 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 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 2 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 57 ms 2924 KB n=50000
12 Correct 38 ms 2924 KB n=50000
13 Correct 1 ms 364 KB n=10
14 Correct 1 ms 364 KB n=685
15 Correct 1 ms 364 KB n=623
16 Correct 2 ms 364 KB n=973
17 Correct 3 ms 384 KB n=989
18 Correct 2 ms 364 KB n=563
19 Correct 3 ms 364 KB n=592
20 Correct 3 ms 492 KB n=938
21 Correct 2 ms 364 KB n=747
22 Correct 3 ms 640 KB n=991
23 Execution timed out 2073 ms 108952 KB Time limit exceeded
24 Halted 0 ms 0 KB -