Submission #2042361


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(register int i(a);i <= b;i++)
#define ll long long
using namespace std;
int main()
{
	//freopen("robot.in","r",stdin);
	//freopen("robot.out","w",stdout);
	int n,x,k(0);ll ans(1);
	cin>>n;
	rep(i,1,n)
	{
		scanf("%d",&x);
		++k;
		if(x < (k << 1) - 1) ans *= k,ans %= 1000000007,--k;
	}
	while(k != 1) ans *= k,ans %= 1000000007,--k;
	printf("%lld",ans);
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User vjudge5
Language C++14 (Clang 3.8.0)
Score 900
Code Size 487 Byte
Status AC
Exec Time 13 ms
Memory 256 KB

Compile Error

./Main.cpp:15:2: warning: 'register' storage class specifier is deprecated and incompatible with C++1z [-Wdeprecated-register]
        rep(i,1,n)
        ^
./Main.cpp:6:24: note: expanded from macro 'rep'
#define rep(i,a,b) for(register int i(a);i <= b;i++)
                       ^
1 warning generated.

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 11 ms 256 KB
2_01.txt AC 12 ms 256 KB
2_02.txt AC 13 ms 256 KB
2_03.txt AC 12 ms 256 KB
2_04.txt AC 11 ms 256 KB
2_05.txt AC 12 ms 256 KB
2_06.txt AC 12 ms 256 KB
2_07.txt AC 12 ms 256 KB
2_08.txt AC 11 ms 256 KB
2_09.txt AC 11 ms 256 KB
2_10.txt AC 12 ms 256 KB
2_11.txt AC 13 ms 256 KB
2_12.txt AC 13 ms 256 KB