Submission #1368801

#TimeUsernameProblemLanguageResultExecution timeMemory
1368801JelaByteEngineerSubset Mex (EGOI22_subsetmex)C++20
22 / 100
138 ms344 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t; cin>>t;
	bool f=true;
	while (t--)
	{
		int n; cin>>n;
		vector <ll> niz(n);
		priority_queue <int, vector <int>, greater<int>> kju;
		for (int i=0; i<n; i++)
		{
			cin>>niz[i];
			if (niz[i]>1) f=false;
			if (niz[i]==0) kju.push(i);
		}
		if (!f)
		{
			int cnt=0;
			while (!kju.empty())
			{
				int top=kju.top();
				kju.pop();
				niz[top]++;
				for (int i=0; i<top; i++)
				{
					niz[i]--;
					if (niz[i]==0) kju.push(i);
				}
				cnt++;
			}
			cout<<cnt+1<<endl;
		}
		else
		{
			int cnt0=0, cnt1=0;
			for (int i=0; i<n; i++)
			{
				if (niz[i]==0) cnt0++;
				else cnt1++;
			}
			cout<<1LL*cnt0*cnt1<<endl;
		}
	}
	return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...