QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#627799#9353. Interesting PermutationeleanorschWA 64ms4392kbC++20883b2024-10-10 17:12:122024-10-10 17:12:12

Judging History

你现在查看的是最新测评结果

  • [2024-10-10 17:12:12]
  • 评测
  • 测评结果:WA
  • 用时:64ms
  • 内存:4392kb
  • [2024-10-10 17:12:12]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;

ll qsm(ll a, ll b) {
	ll tem = 1 ;
	while (b) {
		if (b & 1)
			tem = tem * a % mod ;
		a = a * a % mod;
		b >>= 1 ;
	}
	return tem ;
}

void Solve() {
	int n ;
	ll ans = 1, cnt = 1, tem = 0 ;
	cin >> n ;
	vector<ll> a(n);

	for (int i = 0 ; i < n ; i++)
		cin >> a[i];

	if (a[0] != 0 || a[n - 1] != n - 1) {
		cout << 0 << '\n';
		return ;
	}

	for (int i = 1 ; i < n ; i++ ) {
		if (a[i] < tem || a[i] < i) {
			cout << 0 << '\n';
			return ;
		}
		if (a[i] != tem) {
			ans = ans * (ll)2 % mod ;
			tem = a[i];
			cnt = 1 ;
		} else {
			ans = ans * cnt % mod ;
			cnt++;
		}
	}

	cout << ans % mod << '\n';
}

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

	int T = 1 ;
	cin >> T ;

	while (T--)
		Solve();

	return 0 ;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3600kb

input:

3
3
0 2 2
3
0 1 2
3
0 2 3

output:

2
4
0

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 64ms
memory: 4392kb

input:

10039
14
5 6 7 8 9 10 11 12 13 13 13 13 13 13
14
0 5 6 7 8 9 10 11 12 13 14 14 14 14
1
1
14
0 5 4 8 9 10 11 12 13 13 13 13 13 13
45
0 1 1 2 2 3 5 5 6 6 8 9 11 13 15 17 18 18 20 22 22 24 26 26 26 26 27 27 27 28 30 32 32 33 34 34 34 36 36 38 38 38 39 39 44
24
0 2 3 5 7 9 9 10 11 12 13 14 14 14 14 15 1...

output:

0
0
0
0
0
0
8192
0
0
0
0
0
607312884
0
8388608
8
158428766
2048
2
0
284823005
0
0
2
0
0
0
0
245760
0
0
16384
16
0
768
0
0
0
475286298
0
2
0
0
0
0
2
0
2
901145185
0
0
0
0
4
0
0
0
50331648
0
0
0
0
0
0
0
0
0
0
0
0
0
2
0
0
0
0
192
0
0
3072
0
0
2
8
0
0
603979776
0
0
240487527
128
0
0
24576
0
0
4194304
0
...

result:

wrong answer 7th lines differ - expected: '24576', found: '8192'