oj.uz

답안 #168921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168921 2019-12-17T06:24:06 Z abil Gift (IZhO18_nicegift) C++14
0 / 100
 675 ms 51520 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long

using namespace std;

const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);

int a[N];
set<pair<int,int > > s;
vector<pair<int,pair<int,int > > > vec;
main()
{
	int n, k, sum = 0;
	scanf("%d%d", &n, &k);
	for(int i = 1;i <= n; i++){
		scanf("%d", &a[i]);
		sum += a[i];
		s.insert({a[i], i});
	}
	if(sum % k != 0){
		cout << -1;
		return 0;
	}
	if((sum / k) % 2 == 1){
		pair<int,int > x, y;
		x = *s.rbegin();
		s.erase(--s.end());
		y = *s.rbegin();
		s.erase(--s.end());
		vec.pb({1, {x.sc, y.sc}});
		if(y.fr - 1 > 0){
			s.insert({y.fr - 1, y.sc});
		}
		if(x.fr - 1 > 0){
			s.insert({x.fr - 1, x.sc});
		}
	}
	while(!s.empty()){
		pair<int,int > x, y;
		x = *s.begin();
		s.erase(s.begin());
		y = *s.rbegin();
		s.erase(--s.end());
		vec.pb({x.fr, {x.sc, y.sc}});
		if(y.fr - x.fr > 0){
			s.insert({y.fr - x.fr, y.sc});
		}
	}
	cout << vec.size() << endl;
	for(auto to : vec){
		printf("%d %d %d\n",to.fr, to.sc.fr, to.sc.sc);
	}
}

Compilation message

nicegift.cpp:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
nicegift.cpp: In function 'int main()':
nicegift.cpp:22: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:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 675 ms 51520 KB Added number should be positive
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -