제출 #495041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495041		vinnipuh01	Gift (IZhO18_nicegift)	C++17	7 / 100	67 ms	12588 KiB

nicegift

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>

using namespace std;

const long long oo = 1000000000000000000;

long long int  sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;


    freopen ( "sum.in", "r", stdin )
*/

vector <pair<int, int> > v;
vector <pair<int, pair<int, int> > > vv;

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	int n, m;
	cin >> n >> m;
	int a[ n + 1 ];
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ];
	}
	if( m == 2 ) {
		for ( int i = 1; i <= n; i ++ ) {
			sum += a[ i ];
			v.push_back( { a[ i ], i } );
		}
		if ( sum % 2 ) {
			cout << "-1";
			return 0;
		}
		sort( v.begin(), v.end() );
		num = n - 2;
		sum = n - 1;
		while ( true ) {
			while ( num > 0 && !v[ num ].first ) {
				num --;
			}
			while ( sum > 0 && !v[ sum ].first )
				sum --;
			if ( sum == num ) {
				num --;
				while ( num > 0 && !v[ num ].first )
					num --;
			}
			vv.push_back( make_pair( min( v[ num ].first, v[ sum ].first ), make_pair( v[ num ].second, v[ sum ].second ) ) );
			if ( v[ num ].first < v[ sum ].first ) {
				v[ sum ].first -= v[ num ].first;
				v[ num ].first = 0;
			}
			else {
				v[ num ].first -= v[ sum ].first;
				v[ sum ].first = 0;
			}
			if ( num == 0 && !v[ num ].first )	
				break;
		}
		cout << vv.size() << "\n";
		for ( auto i : vv )
			cout << i.first << " " << i.second.first << " " << i.second.second << "\n";
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 51