Submission #364234

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
364234	2021-02-08T13:09:53 Z	silverfish	Teams (CEOI11_tea)	C++14	50 / 100	2500 ms	12036 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;

ar<int,2> dp[N];
int mxsz[N];
ar<int,2> a[N];
int n;


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

	dp[0][0] = 0;
	dp[0][1] = -1;
	mxsz[0] = 0;

	for(int i = 1; i <= n; ++i){
		int cursz = a[i][0];
		int actualsz = cursz;
		dp[i] = {0, -1};

		/*
		int r = 0, l = INF;
		for(int j = i-cursz+1; j > 0; --j){
			if(dp[j-1][0]+1 < dp[i][0]) break;
			r = max(r, j);
			l = min(l, j);
			if(dp[j-1][0]+1 > dp[i][0]){
				dp[i] = {dp[j-1][0]+1, (dp[j-1][1]==-1 ? 0 : j-1)};
				actualsz = i - dp[i][1];
			}else if(dp[j-1][0]+1 == dp[i][0]){
				ar<int,2> perm = {dp[j-1][0]+1, (dp[j-1][1]==-1 ? 0 : j-1)};
				if(max(mxsz[j-1], i-perm[1]) < max(mxsz[dp[i][1]], actualsz)){
					dp[i] = perm;
					actualsz = i - perm[1];
				}
			}
		}
		debug() <<  exp(l) exp(r);
		*/

		if(i-cursz+1 > 0){
			int r = i-cursz;

			dp[i] = {dp[r][0]+1, (~dp[r][1] ? r : 0)};
			actualsz = i - dp[i][1];

			int l = r;
			for(int k = 22; k >= 0; --k){
				if(l-(1<<k) >= 0 && dp[l-(1<<k)][0] == dp[r][0]) l-=(1<<k);
			}

			for(int j = r-1; j >= l; --j){
				//assert(dp[j][0]+1 == dp[i][0]);

				ar<int,2> perm = {dp[j][0]+1, (~dp[j][1] ? j : 0)};

				if(max(mxsz[j], i-perm[1]) < max(mxsz[dp[i][1]], actualsz)){
					dp[i] = perm;
					actualsz = i - perm[1];
				}
			}
		}

		if(dp[i][1] == -1) continue;
		mxsz[i] = max(mxsz[dp[i][1]], actualsz);
	}

	cout << dp[n][0] << '\n';

	deque<int> teams;
	int i = n;
	while(~dp[i][1]){
		teams.push_front(i - dp[i][1]);
		i = dp[i][1];
	}

	i = 1;
	while(teams.size()){
		int cur = teams.front();
		teams.pop_front();
		cout << cur << ' ';
		for(int j = i; j < i+cur; ++j){
			cout << a[j][1] << ' ';
		}
		cout << '\n';
		i += cur;
	}

	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	492 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	5 ms	524 KB	Output is correct
2	Correct	8 ms	492 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	918 ms	2412 KB	Output is correct
2	Correct	35 ms	2412 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	828 ms	2668 KB	Output is correct
2	Correct	30 ms	2284 KB	Output is correct
3	Correct	692 ms	2924 KB	Output is correct

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2598 ms	12036 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2564 ms	9748 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2600 ms	12012 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #364234

Compilation message