Submission #495278

#	Time	Username	Problem	Language	Result	Execution time	Memory
495278		Ierus	Gift (IZhO18_nicegift)	C++17	0 / 100	2070 ms	173936 KiB

nicegift

#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define int long long
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 1e5+777;
const int MOD = 1e9+7;
int n, m;
pair<int,int> a[E];
set<pair<int,int>> st;
vector<vector<int>> res;
signed main(){auto solve=[&](){
	cin >> n >> m;
	for(int i = 1; i <= n; ++i){
		cin >> a[i].F, a[i].S = i;
		if(a[i].F > 0){
			st.insert(a[i]);	
		}
	}
//	cerr << "ST\n";
//	for(auto it : st){
//		cerr << it.F << ' ' << it.S << '\n';
//	}
//	cerr << '\n';
	while(sz(st) > 1){
		auto[val1, pos1] = *(--st.end());
		auto[val2, pos2] = *--(--st.end());
		st.erase({val1,pos1});
		st.erase({val2,pos2});
//		cerr << "v1: " << val1 << " p1: " << pos1 << " v2: " << val2 << " p2: " << pos2 << '\n';
		val1--,val2--;
		if(val1 > 0) st.insert({val1,pos1});
		if(val2 > 0) st.insert({val2,pos2});
		vector<int>e = {pos1,pos2};
		res.pb(e);
	}
	if(sz(st) == 1){
		cout << -1;
	}else{
		cerr << sz(res) << '\n';
		for(auto v : res){
			cout << 1 << ' ';
			for(auto it : v)
				cout << it << ' ';
			cout << '\n';
		}
	}
};NFS;solve();}

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