Submission #1131352


Source Code Expand

#include <iostream>
using namespace std;

long long MOD=1000000007;

int main() {
	// your code goes here
	int n;
	cin >> n;
	long long a,b,c;
	int j;
	c = 0;a = 1;
	cin >> j;
	for(int i = 1;i < n;i++){
		if(j < (i-c)*2-1){
			a *= i-c;
			a %= MOD;
			c++;
		}
		cin >> j;
	}
	for(int i = n-c;i > 0;i--){
		a *= i;
		a %= MOD;
	}
	cout << a << endl;
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User rehu
Language C++14 (GCC 5.4.1)
Score 900
Code Size 390 Byte
Status AC
Exec Time 55 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 38 ms 256 KB
2_01.txt AC 40 ms 256 KB
2_02.txt AC 55 ms 256 KB
2_03.txt AC 39 ms 256 KB
2_04.txt AC 39 ms 256 KB
2_05.txt AC 40 ms 256 KB
2_06.txt AC 40 ms 256 KB
2_07.txt AC 40 ms 256 KB
2_08.txt AC 39 ms 256 KB
2_09.txt AC 40 ms 256 KB
2_10.txt AC 39 ms 256 KB
2_11.txt AC 54 ms 256 KB
2_12.txt AC 54 ms 256 KB