oj.uz

답안 #633999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633999 2022-08-23T16:04:48 Z drkarlicio2107 Gift (IZhO18_nicegift) C++14
30 / 100
 96 ms 15464 KB 
#include <bits/stdc++.h>
using namespace std;
vector < pair <int, pair<int, int> > > s;
set <int> m;
int a [100010];
vector <int> ans [300010];
int main(){
	int n, k; cin >> n >> k; long long int gr=0; long long int sum=0;
	for (int i=0; i<n; i++){
		long long int x; cin >> x; a[i]=x; sum+=a[i];
	}
	for (int i=0; i<n; i++){
		int x=a[i];
		s.push_back ({(gr)%(sum/k), {i, 0}});	gr+=x;
		//cout << gr << endl;
		if (gr%(sum/k)==0) s.push_back ({sum/k, {i, 1}});
		else s.push_back ({(gr)%(sum/k), {i, 1}});
		if ((gr-x)%(sum/k)>gr%(sum/k) && gr%(sum/k)!=0){
			s.push_back ({0, {i, 0}});
			s.push_back ({sum/k, {i, 1}});
		}
	}
	if (gr%k!=0){
		cout << -1; return 0;
	}
	int ind=0;
	for (int i=0; i<n; i++) if (a[i]>gr/k) {cout << -1; return 0;};
	sort (s.begin(), s.end()); int pr=0;
	for (int i=0; i<s.size(); i++){
		int x=s [i].first; int y=s[i].second.first; int t=s[i].second.second;
		//cout << x << " " << y << " " << t << endl;
		if (t==0){
			if (x-pr!=0){
				ans [ind].push_back (x-pr);
				for (auto e:m){
					ans [ind].push_back (e+1);
				}
				ind++;
			}
			m.insert (y);
		}
		else{
			if (x-pr!=0){
				ans [ind].push_back (x-pr);
				for (auto e:m){
					ans [ind].push_back (e+1);
				}
				ind++;
			}
			m.erase (y);
		}
		pr=x;
	}
	cout << ind << endl;
	for (int i=0; i<ind; i++){
		for (int j=0; j<ans [i].size(); j++) cout << ans [i][j] << " ";
		cout << endl;
	}
	return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:29:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i=0; i<s.size(); i++){
      |                ~^~~~~~~~~
nicegift.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for (int j=0; j<ans [i].size(); j++) cout << ans [i][j] << " ";
      |                 ~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7252 KB n=4
2 Correct 4 ms 7252 KB n=3
3 Correct 4 ms 7352 KB n=3
4 Correct 4 ms 7252 KB n=4
5 Correct 4 ms 7252 KB n=4
6 Correct 4 ms 7252 KB n=2
7 Correct 4 ms 7252 KB n=5
8 Correct 4 ms 7352 KB n=8
9 Correct 4 ms 7252 KB n=14
10 Correct 4 ms 7252 KB n=11
11 Correct 96 ms 10680 KB n=50000
12 Correct 92 ms 10624 KB n=50000
13 Correct 4 ms 7252 KB n=10
14 Correct 6 ms 7352 KB n=685
15 Correct 6 ms 7356 KB n=623
16 Correct 6 ms 7380 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7252 KB n=4
2 Correct 4 ms 7252 KB n=3
3 Correct 4 ms 7352 KB n=3
4 Correct 4 ms 7252 KB n=4
5 Correct 4 ms 7252 KB n=4
6 Correct 4 ms 7252 KB n=2
7 Correct 4 ms 7252 KB n=5
8 Correct 4 ms 7352 KB n=8
9 Correct 4 ms 7252 KB n=14
10 Correct 4 ms 7252 KB n=11
11 Correct 96 ms 10680 KB n=50000
12 Correct 92 ms 10624 KB n=50000
13 Correct 4 ms 7252 KB n=10
14 Correct 6 ms 7352 KB n=685
15 Correct 6 ms 7356 KB n=623
16 Correct 6 ms 7380 KB n=973
17 Correct 6 ms 7380 KB n=989
18 Correct 5 ms 7352 KB n=563
19 Correct 7 ms 7508 KB n=592
20 Correct 7 ms 7508 KB n=938
21 Correct 6 ms 7380 KB n=747
22 Correct 7 ms 7508 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 57 ms 15464 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7252 KB n=4
2 Correct 4 ms 7252 KB n=3
3 Correct 4 ms 7352 KB n=3
4 Correct 4 ms 7252 KB n=4
5 Correct 4 ms 7252 KB n=4
6 Correct 4 ms 7252 KB n=2
7 Correct 4 ms 7252 KB n=5
8 Correct 4 ms 7352 KB n=8
9 Correct 4 ms 7252 KB n=14
10 Correct 4 ms 7252 KB n=11
11 Correct 96 ms 10680 KB n=50000
12 Correct 92 ms 10624 KB n=50000
13 Correct 4 ms 7252 KB n=10
14 Correct 6 ms 7352 KB n=685
15 Correct 6 ms 7356 KB n=623
16 Correct 6 ms 7380 KB n=973
17 Correct 6 ms 7380 KB n=989
18 Correct 5 ms 7352 KB n=563
19 Correct 7 ms 7508 KB n=592
20 Correct 7 ms 7508 KB n=938
21 Correct 6 ms 7380 KB n=747
22 Correct 7 ms 7508 KB n=991
23 Runtime error 57 ms 15464 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -