220872026-01-14 16:51:23PappMatyasNegáló rendezés (55 pont)cpp17Accepted 55/5514ms1272 KiB
#include <iostream>
#include <vector>

using namespace std;

const int modularValue = 1000000007;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<int> count(100001, 0);

	int x;
	int minim = 100001;
	int maxim = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> x;
		count[x]++;
		minim = min(x, minim);
		maxim = max(x + 1, maxim);
	}

	long long mult = 1;
	for (int i = minim + 1; i < maxim; i++)
	{
		mult = (mult * (count[i] + 1)) % modularValue;
	}
	cout << mult;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms1016 KiB
2Accepted0/013ms880 KiB
3Accepted2/21ms820 KiB
4Accepted2/22ms564 KiB
5Accepted2/22ms820 KiB
6Accepted2/22ms820 KiB
7Accepted3/32ms820 KiB
8Accepted2/22ms820 KiB
9Accepted3/32ms820 KiB
10Accepted3/310ms820 KiB
11Accepted3/313ms572 KiB
12Accepted3/312ms984 KiB
13Accepted3/313ms1032 KiB
14Accepted3/313ms820 KiB
15Accepted3/313ms1076 KiB
16Accepted3/313ms836 KiB
17Accepted3/312ms1012 KiB
18Accepted3/314ms820 KiB
19Accepted3/314ms1272 KiB
20Accepted3/313ms820 KiB
21Accepted3/312ms820 KiB
22Accepted3/313ms820 KiB