제출 #252725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252725		anubhavdhar	Teams (CEOI11_tea)	C++14	0 / 100	801 ms	25956 KiB

tea

#include<bits/stdc++.h>

#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define F0R(i,n) for(int i=0;i<(n);++i)
#define F0Re(i,n) for(int i=1;i<=(n);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,n) for(int i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first 
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cerr<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()

using namespace std;

const short int __PRECISION = 10;

const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 2e5+5;
const ll ROOTN = 320;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

int main()
{
	/*
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	*/
	int N, sz, tmp;
	cin>>N;
	pair<int, int> A[N];
	F0R(i, N)
	{
		cin>>sz;
		A[i] = mp(sz, i);
	}
	sort(A, A + N, greater<pair<int,int>>());

	vector<vector<int>> Answer;
	
	sz = tmp = 19;

	F0R(i, N)
	{
		if (sz == tmp)
		{
			sz = A[i].ff;
			tmp = 0;
			Answer.resize(Answer.size() + 1);
		}
		++tmp;
		Answer[Answer.size() - 1].pb(A[i].ss);
	}

	reverse(all(Answer));

	cout<<Answer.size()<<'\n';
	F0R(i, (int)Answer.size())
	{
		sort(all(Answer[i]));
		cout<<Answer[i].size()<<' ';
		for(int v : Answer[i])
			cout<<v+1<<' ';
		cout<<endl;
	}

	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10