oj.uz

Submission #363515

# Submission time Handle Problem Language Result Execution time Memory
363515 2021-02-06T10:27:08 Z silverfish Teams (CEOI11_tea) C++14
30 / 100
 744 ms 118892 KB 
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 1e6+100;

vector<int> teams[N];
set<ar<int,2>> ids;
int sz, cur=0, mxcur = 0, mx=0, n;
ar<int,2> a[N];

int main(void)
{
	FAST;
	cin >> n;
	for(int i = 0; i < n; ++i){
		cin >> a[i][0];
		a[i][1] = i;
	}
	sort(a, a+n);

	mx = a[n-1][0];
	int i = n-1;

	while(i >= 0){	
		mxcur = a[i][0];
		if(i+1 < mxcur) break;

		teams[cur].pb(a[i][1]);
		for(int j = 1; j < mxcur; ++j){
			teams[cur].pb(a[i-j][1]);	
		}

		ids.insert({mxcur, cur++});
		i -= mxcur;
	}
	sz = cur;

	/*
	debug() << exp(i);
	for(int i = 0; i < cur; ++i){
		debug() << exp(teams[i]);
	}
	*/

	while(i >= 0 && (*ids.begin())[0] < mx){
		auto it = ids.begin();
//		debug() << exp(*it);
		cur = (*it)[1];
		for(int j = 0; i >= 0 && j < mx-(*it)[0]; --i, ++j){
			teams[cur].pb(a[i][1]);	
		}
		ids.erase(it);
		ids.insert({(int)teams[cur].size(), cur});
	}

	for(; i >= 0; --i){
		auto it = ids.begin();
		cur = (*it)[1];
		teams[cur].pb(a[i][1]);
		ids.erase(it);
		ids.insert({(int)teams[cur].size(), cur});
	}

	int mx2 = 0, mn2 = INF;
	cout << sz << '\n';
	for(auto it : ids){
		cout << it[0];
		mx2 = max(it[0], mx2);
		mn2 = min(it[0], mn2);
		for(int i : teams[it[1]]) cout << ' ' <<  i+1;
		cout << '\n';
	}

	if(mx2 > mx){
		assert(mx2 - mn2 <= 1);
	}


	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 16 ms 23788 KB Output is correct
4 Correct 23 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Incorrect 16 ms 23788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 23916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23916 KB Output is correct
2 Correct 19 ms 23916 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 25452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 25580 KB Output is correct
2 Correct 40 ms 25580 KB Output is correct
3 Correct 44 ms 25580 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 260 ms 38636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 42644 KB Output is correct
2 Correct 744 ms 118892 KB Output is correct
3 Incorrect 345 ms 45676 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 42724 KB Output is correct
2 Correct 300 ms 42588 KB Output is correct
3 Incorrect 334 ms 43372 KB Output isn't correct
4 Halted 0 ms 0 KB -