oj.uz

Submission #363826

# Submission time Handle Problem Language Result Execution time Memory
363826 2021-02-07T10:38:48 Z silverfish Teams (CEOI11_tea) C++14
0 / 100
 533 ms 85884 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][2];
int sz[2], cur=0, cnt_teams=1, n;
ar<int,2> a[N];
bool state = 0;

bool check(int x){
	for(int i = 0; i < sz[state]; ++i) teams[i][state].clear();
	debug() << exp(x);
	cur = 0;
	int mx = x;

	int i = n-1;
	for(; i >= n-x; --i){
		teams[cur][state].pb(a[i][1]);	
	}
	debug() << exp(teams[cur][state]);
	cur++;
	debug() << exp(cur) exp(i);

	while(i >= 0){
		int cursz = a[i][0];
		debug() << exp(i) exp(cursz);

		if(cursz > i+1){
			while(i >= 0){
				teams[cur][state].pb(a[i][1]);
				i--;
			}
			mx = max(mx, (int)teams[cur][state].size());
			break;
		}

		int j = i;
		for(; j > i-cursz; --j){
			teams[cur][state].pb(a[j][1]);
		}
		cur++;
		i = j;
	}
	sz[state] = cur;

	return (mx == x && sz[state]==cnt_teams);
}

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);

	int cursz = 0, curmx=1;
	for(int i = 0; i < n - a[n-1][0]; ++i){
		if(cursz < curmx){
			++cursz;	
			curmx = a[i][0];
		}
		if(curmx <= cursz){
			++cnt_teams;
			cursz=0;
			curmx=1;
		}
	}
	debug() << exp(cnt_teams);

	bool x = check(3);
	debug() << exp(x);
	int lo = a[n-1][0], hi = n;

	while(hi-lo > 0){
		int m = lo + (hi - lo) / 2;

		state = !state;
		if(check(m)) hi = m;
		else lo = m+1;
	}

	cout << sz[state] << '\n';

	for(int i = 0; i < sz[state]; ++i){
		cout << teams[i][state].size() << ' ';
		for(int i : teams[i][state]){
			cout << i+1 << ' ';
		}
		cout << '\n';
	}


	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 47340 KB Integer parameter [name=s_i] equals to 3, violates the range [1, 1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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