Submission #945546


Source Code Expand

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <unordered_set>
using namespace std;
#define N 610000
#define P 1000000007

int n, p[N], b[N], empty_a, empty, tot, sum[N], prod[N], inv[N];
int used[N];
int ans;

int calc(int x) {
	int ans = 0;
	for (; x; x -= x & -x)
		ans += b[x];
	return ans;
}

void upd(int x) {
	for (; x <= n; x += x & -x)
		b[x] += 1;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &p[i]);
	for (int i = 1; i <= n; i++)
		used[p[i]] = 1;
	for (int i = 1; i <= n; i++)
		sum[i] = sum[i - 1] + used[i];
	empty = n - sum[n];
	prod[0] = 1;
	for (int i = 1; i <= n; i++)
		prod[i] = 1LL * i * prod[i - 1] % P;
	inv[1] = 1;
	for (int i = 2; i <= n; i++)
		inv[i] = (-1LL * inv[P % i] * (P / i) % P + P) % P;

	empty_a = 0;
	tot = 0;
	for (int i = n; i; i--) {
		if (!p[i]) {
			ans = (ans + 1LL * prod[n - i] * tot % P * prod[empty - 1]) % P;
			ans = (ans + 1LL * prod[n - i] * prod[empty] % P * empty_a % P * inv[2]) % P;
			empty_a += 1;
		}else {
			ans = (ans + 1LL * prod[n - i] * calc(p[i]) % P * prod[empty]) % P;
			if (empty) {
				ans = (ans + 1LL * prod[n - i] * (p[i] - sum[p[i]]) % P * prod[empty - 1] % P * empty_a % P) % P;
			}
			upd(p[i]);
			tot += (n - p[i]) - (sum[n] - sum[p[i]]);
			tot %= P;
		}
	}
	ans = (ans + prod[empty]) % P;
	printf("%d\n", ans);
}

Submission Info

Submission Time
Task E - Encyclopedia of Permutations
User xyz111
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 1573 Byte
Status AC
Exec Time 112 ms
Memory 12032 KB

Compile Error

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

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 500 / 500 700 / 700
Status
AC × 5
AC × 33
AC × 58
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt, 2_051.txt, 2_052.txt, 2_053.txt, 2_054.txt, 2_055.txt, 2_056.txt, 2_057.txt
Case Name Status Exec Time Memory
0_000.txt AC 3 ms 256 KB
0_001.txt AC 3 ms 256 KB
0_002.txt AC 3 ms 256 KB
0_003.txt AC 3 ms 256 KB
0_004.txt AC 3 ms 256 KB
1_005.txt AC 3 ms 256 KB
1_006.txt AC 3 ms 256 KB
1_007.txt AC 3 ms 256 KB
1_008.txt AC 3 ms 384 KB
1_009.txt AC 3 ms 256 KB
1_010.txt AC 3 ms 384 KB
1_011.txt AC 3 ms 256 KB
1_012.txt AC 3 ms 384 KB
1_013.txt AC 3 ms 256 KB
1_014.txt AC 3 ms 384 KB
1_015.txt AC 3 ms 256 KB
1_016.txt AC 3 ms 384 KB
1_017.txt AC 3 ms 256 KB
1_018.txt AC 3 ms 384 KB
1_019.txt AC 3 ms 256 KB
1_020.txt AC 3 ms 384 KB
1_021.txt AC 3 ms 256 KB
1_022.txt AC 3 ms 384 KB
1_023.txt AC 3 ms 256 KB
1_024.txt AC 3 ms 384 KB
1_025.txt AC 3 ms 256 KB
1_026.txt AC 3 ms 384 KB
1_027.txt AC 3 ms 256 KB
1_028.txt AC 3 ms 384 KB
1_029.txt AC 3 ms 384 KB
1_030.txt AC 3 ms 384 KB
1_031.txt AC 3 ms 384 KB
1_032.txt AC 3 ms 384 KB
2_033.txt AC 62 ms 8064 KB
2_034.txt AC 32 ms 4224 KB
2_035.txt AC 74 ms 12032 KB
2_036.txt AC 70 ms 11008 KB
2_037.txt AC 81 ms 12032 KB
2_038.txt AC 70 ms 10496 KB
2_039.txt AC 87 ms 12032 KB
2_040.txt AC 43 ms 6144 KB
2_041.txt AC 93 ms 12032 KB
2_042.txt AC 19 ms 2432 KB
2_043.txt AC 101 ms 12032 KB
2_044.txt AC 63 ms 7936 KB
2_045.txt AC 100 ms 12032 KB
2_046.txt AC 98 ms 11520 KB
2_047.txt AC 104 ms 12032 KB
2_048.txt AC 45 ms 5376 KB
2_049.txt AC 106 ms 12032 KB
2_050.txt AC 70 ms 7936 KB
2_051.txt AC 101 ms 12032 KB
2_052.txt AC 91 ms 10880 KB
2_053.txt AC 62 ms 8064 KB
2_054.txt AC 112 ms 12032 KB
2_055.txt AC 89 ms 12032 KB
2_056.txt AC 89 ms 12032 KB
2_057.txt AC 82 ms 12032 KB