Submission #1693120


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>
const int MOD = 1000000007;
int N, a[100001], v[100001], bel[100001], dep[100001], pure[100001], O = 1;
std::vector < int > V[100001];
std::vector < std::vector < int > > cirs;
int main()
{
	scanf("%d", &N);
	for (int i = 1; i <= N; i++)
		scanf("%d", a + i);
	for (int i = 1; i <= N; i++)
		if (!v[i])
		{
			static int way[100001];
			int L = 1;
			v[way[L] = i] = 1;
			while (!v[a[way[L]]])
			{
				v[way[L + 1] = a[way[L]]] = 1;
				L++;
			}
			way[L + 1] = a[way[L]];
			if (v[a[way[L]]] == 2)
				for (int i = L; i; i--)
				{
					bel[way[i]] = bel[way[i + 1]];
					dep[way[i]] = dep[way[i + 1]] + 1;
				}
			else
			{
				int S = std::find(way + 1, way + L + 1, way[L + 1]) - way;
				for (int i = S; i <= L; i++)
				{
					bel[way[i]] = way[i];
					dep[way[i]] = 0;
				}
				for (int i = S - 1; i; i--)
				{
					bel[way[i]] = bel[way[i + 1]];
					dep[way[i]] = dep[way[i + 1]];
				}
				cirs.push_back({ way + S, way + L + 1 });
			}
			for (int i = 1; i <= L; i++)
				v[way[i]] = 2;
		}
	for (int i = 1; i <= N; i++)
		V[bel[i]].push_back(dep[i]);
	for (int i = 1; i <= N; i++)
	{
		std::sort(V[i].begin(), V[i].end());
		int S = V[i].size();
		for (int j = 0; j < S; j++)
			if (V[i][j] != j)
			{
				puts("0");
				return 0;
			}
	}
	for (auto &cir : cirs)
	{
		for (int &i : cir)
			i = V[i].size() - 1;
		if (int(std::count(cir.begin(), cir.end(), 0)) == int(cir.size()))
			pure[cir.size()]++;
		else
		{
			int *A = cir.data(), L = cir.size();
			for (int i = 0; i < L; i++)
				if (A[i])
				{
					for (int j = 1; j < A[i]; j++)
						if (A[(i - j % L + L) % L])
						{
							puts("0");
							return 0;
						}
					if (!A[(i - A[i] % L + L) % L])
						O = (O + O) % MOD;
				}
		}
	}
	for (int i = 1; i <= N; i++)
	{
		static int f[100001];
		f[0] = 1;
		for (int j = 1; j <= pure[i]; j++)
			f[j] = (f[j - 1] * (i > 1 && (i & 1) ? 2 : 1) + (long long)f[j - 2] * (j - 1) * i) % MOD;
		O = (long long)O * f[pure[i]] % MOD;
	}
	printf("%d\n", O);
	return 0;
}

Submission Info

Submission Time
Task E - Next or Nextnext
User NiroBC
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2147 Byte
Status WA
Exec Time 28 ms
Memory 14000 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:12:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 5
AC × 45
WA × 14
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 4352 KB
0_01.txt AC 3 ms 4352 KB
0_02.txt AC 3 ms 4352 KB
0_03.txt AC 3 ms 4352 KB
0_04.txt AC 3 ms 4352 KB
1_00.txt AC 3 ms 4352 KB
1_01.txt AC 28 ms 14000 KB
1_02.txt AC 25 ms 10548 KB
1_03.txt AC 24 ms 9652 KB
1_04.txt AC 21 ms 8192 KB
1_05.txt AC 21 ms 8192 KB
1_06.txt AC 21 ms 8448 KB
1_07.txt AC 21 ms 8064 KB
1_08.txt AC 21 ms 8448 KB
1_09.txt AC 20 ms 8448 KB
1_10.txt AC 21 ms 8448 KB
1_11.txt AC 20 ms 8448 KB
1_12.txt WA 20 ms 6780 KB
1_13.txt WA 20 ms 6780 KB
1_14.txt AC 22 ms 6652 KB
1_15.txt AC 22 ms 7424 KB
1_16.txt AC 22 ms 7424 KB
1_17.txt AC 22 ms 7424 KB
1_18.txt AC 21 ms 8448 KB
1_19.txt AC 21 ms 8448 KB
1_20.txt AC 21 ms 8320 KB
1_21.txt AC 21 ms 8448 KB
1_22.txt WA 21 ms 7168 KB
1_23.txt AC 23 ms 7168 KB
1_24.txt AC 21 ms 7168 KB
1_25.txt WA 21 ms 7168 KB
1_26.txt WA 19 ms 6656 KB
1_27.txt AC 22 ms 6784 KB
1_28.txt AC 21 ms 6784 KB
1_29.txt AC 20 ms 6784 KB
1_30.txt AC 21 ms 8192 KB
1_31.txt AC 21 ms 8064 KB
1_32.txt AC 21 ms 8192 KB
1_33.txt AC 21 ms 8192 KB
1_34.txt WA 21 ms 6912 KB
1_35.txt WA 21 ms 6912 KB
1_36.txt AC 20 ms 6784 KB
1_37.txt AC 21 ms 6912 KB
1_38.txt WA 19 ms 6656 KB
1_39.txt WA 19 ms 6656 KB
1_40.txt AC 19 ms 6656 KB
1_41.txt AC 19 ms 6656 KB
1_42.txt AC 22 ms 8380 KB
1_43.txt AC 22 ms 8508 KB
1_44.txt AC 22 ms 8508 KB
1_45.txt AC 22 ms 8380 KB
1_46.txt WA 21 ms 7356 KB
1_47.txt WA 21 ms 7356 KB
1_48.txt AC 21 ms 7356 KB
1_49.txt AC 21 ms 7356 KB
1_50.txt WA 20 ms 8380 KB
1_51.txt WA 20 ms 8252 KB
1_52.txt AC 21 ms 8380 KB
1_53.txt WA 21 ms 8380 KB