Submission #378936

#	Time	Username	Problem	Language	Result	Execution time	Memory
378936		hhhhaura	Gift (IZhO18_nicegift)	C++14	0 / 100	321 ms	22124 KiB

nicegift

#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
#define MAXN 1000005

#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

using namespace std;
#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {
	while(L < R) cerr << *L << " \n"[next(L) == R], ++ L;
}
void kout() {cerr << endl;}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) {
	cerr << a << " ", kout(e...);
}
#else 
#define print(...) 0
#define vprint(...) 0
#endif
struct AC {
	int n, k;
	vector<int> a;
	vector<vector<int>> ans;
	void init_(int _n, int _k) {
		n = _n, k = _k;
		a.assign(n + 1, 0);
	}
	void solve() {
		priority_queue<pii, vector<pii>, greater<pii>> pq;
		rep(i, 1, n) {
			pq.push({a[i], i});
		}
		while(pq.size()) {
			if(pq.size() < k) {
				cout << "-1\n";
				return;
			}
			int x = pq.top().first;
			vector<pii> temp;
			ans.push_back(vector<int>(k + 1, 0));
			ans[ans.size() - 1][0] = x;
			rep(i, 1, k) {
				pii cur = pq.top(); pq.pop();
				ans[ans.size() - 1][i] = cur.second;
				cur.first -= x;
				temp.push_back(cur);
			}
			for(auto i : temp) {
				if(i.first) pq.push(i);
			}
		}
		cout << ans.size() << "\n";
		for(auto i : ans) {
			rep(j, 0, k) {
				cout << i[j] << " \n"[j == k];
			}
		}
	}

};
struct sb4 {
	int n, k;
	vector<int> a;
	void init_(int _n, int _k) {
		n = _n, k = _k;
		a.assign(n + 1, 0);
		return;
	}
	void solve() {	
		if(n % k != 0) {
			assert(0);
			cout << "-1\n";
			return;
		}
		cout << n / k << "\n";
		rep(i, 1, n / k) {
			cout << a[1];
			rep(j, (i - 1) * k + 1, i * k) {
				cout << " " << j;
			}
			cout << "\n";
		}
		return;
	}

} ac;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, k; cin >> n >> k;
	ac.init_(n, k);
	rep(i, 1, n) cin >> ac.a[i];
	ac.solve();
	
	return 0;
}

Compilation message (stderr)

nicegift.cpp:4: warning: ignoring #pragma loop  [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
nicegift.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts'
   24 | void vprint(auto L, auto R) {
      |             ^~~~
nicegift.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts'
   24 | void vprint(auto L, auto R) {
      |                     ^~~~
nicegift.cpp: In member function 'void AC::solve()':
nicegift.cpp:49:17: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   49 |    if(pq.size() < k) {
      |       ~~~~~~~~~~^~~

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