Submission #1519985


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1e9 + 7;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	int cnt = 0;
	ll ans = 1;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		cnt++;
		if (cnt * 2 > x + 1) {
			(ans *= cnt) %= MOD;
			cnt--;
		}
	}

	for (int i = 2; i <= cnt; i++) {
		(ans *= i) %= MOD;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User fine
Language C++14 (GCC 5.4.1)
Score 900
Code Size 448 Byte
Status AC
Exec Time 11 ms
Memory 256 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 1 ms 256 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 9 ms 256 KB
2_01.txt AC 9 ms 256 KB
2_02.txt AC 11 ms 256 KB
2_03.txt AC 9 ms 256 KB
2_04.txt AC 9 ms 256 KB
2_05.txt AC 9 ms 256 KB
2_06.txt AC 9 ms 256 KB
2_07.txt AC 9 ms 256 KB
2_08.txt AC 9 ms 256 KB
2_09.txt AC 9 ms 256 KB
2_10.txt AC 9 ms 256 KB
2_11.txt AC 11 ms 256 KB
2_12.txt AC 11 ms 256 KB