Submission #1131181


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN = 1e5+5;
const ll p = 1e9+7;

ll n;
ll x[MAXN];
ll prod = 1;

int main() {
	cin >> n;
	for (int i = 0; i < n; ++i)
		cin >> x[i];
	int ct = 0;
	for (int i = 0; i < n; ++i) {
		if (x[i] <= 2*i-2*ct) {
			prod *= (i+1-ct);
			prod %= p;
			ct++;
		}
	}

	for (int j = n-ct; j >= 1; --j)
		prod = prod*j%p;
	cout << prod << endl;
}

Submission Info

Submission Time
Task A - Robot Racing
User desert97
Language C++14 (GCC 5.4.1)
Score 900
Code Size 439 Byte
Status AC
Exec Time 41 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 500 / 500 400 / 400
Status
AC × 4
AC × 14
AC × 28
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
Subtask 0_00.txt, 0_01.txt, 0_02.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
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt
Case Name Status Exec Time Memory
0_00.txt AC 6 ms 768 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
2_00.txt AC 29 ms 1024 KB
2_01.txt AC 31 ms 1024 KB
2_02.txt AC 41 ms 1024 KB
2_03.txt AC 30 ms 1024 KB
2_04.txt AC 30 ms 1024 KB
2_05.txt AC 32 ms 1024 KB
2_06.txt AC 30 ms 1024 KB
2_07.txt AC 30 ms 1024 KB
2_08.txt AC 30 ms 1024 KB
2_09.txt AC 30 ms 1024 KB
2_10.txt AC 30 ms 1024 KB
2_11.txt AC 40 ms 1024 KB
2_12.txt AC 40 ms 1024 KB