oj.uz

답안 #495341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495341 2021-12-18T13:39:23 Z mansur Gift (IZhO18_nicegift) C++17
0 / 100
 152 ms 31776 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e9, N = 1e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, k;
	cin >> n >> k;
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	int sum = 0, mx = 0;
	for (int i = 1; i <= n; i++) sum += a[i], mx = max(mx, a[i]);
	if (sum % k || mx > sum / k) cout << -1, E;
	vector<vector<pii>> s;
	vector<pii> cur;
	int sm = 0;
	sum /= k;
	for (int i = 1; i <= n; i++) {
		if (sm + a[i] <= sum) {
			cur.pb({a[i], i});
			sm += a[i];	
		}else {
			cur.pb({sum - sm, i});
			s.pb(cur);
			cur.clear();
			a[i] -= sum - sm;
			sm = 0;
			i--;
		}
		if (sm == sum) {
			s.pb(cur);
			cur.clear();
			sm = 0;
		}
	}
	vector<pair<int, vector<int>>> ans;
	while (sz(s[0])) {
		vector<int> h;
		int mn = inf;
		for (auto &e: s) {
			mn = min(mn, e.back().ff);
		}
		if (mn == inf) break;
		for (auto &e: s) {
			e.back().ff -= mn;
			h.pb(e.back().ss);
			if (!e.back().ff) {
				e.popb;
			}
		}
		ans.pb({mn, h});
	}
	for (auto e: ans) {
		cout << e.ff << ' ';
		for (auto x: e.ss) cout << x << ' ';
		cout << nl;
	}
}

Compilation message

nicegift.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
nicegift.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main() {
      | ^~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 152 ms 31776 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -