Submission #1132542


Source Code Expand

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define fe(i,a,b) for(int i=be[a];i;i=b[i].ne)
using namespace std;
char rch;
void readd(int &x){
	while ((rch=getchar())<'0');
	x=rch-'0';
	while ((rch=getchar())>='0') x=x*10+rch-'0';
}
const int p=1e9+7;
int n,t,x;
long long ans;
int main(){
	ans=1;
	scanf("%d",&n);
	t=1;//!!!
	fo(i,1,n-1){
		scanf("%d",&x);
		if (x<2*t-1){
			ans=ans*t%p;
			continue;
		}
		t++;
	}
	//t++;
	fo(i,2,t) ans=ans*i%p;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User qinghaili
Language C++14 (GCC 5.4.1)
Score 900
Code Size 642 Byte
Status AC
Exec Time 12 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

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 0 ms 128 KB
0_01.txt AC 0 ms 128 KB
0_02.txt AC 0 ms 128 KB
0_03.txt AC 0 ms 128 KB
1_00.txt AC 0 ms 128 KB
1_01.txt AC 0 ms 128 KB
1_02.txt AC 0 ms 128 KB
1_03.txt AC 0 ms 128 KB
1_04.txt AC 0 ms 128 KB
1_05.txt AC 0 ms 128 KB
1_06.txt AC 0 ms 128 KB
1_07.txt AC 0 ms 128 KB
1_08.txt AC 0 ms 128 KB
1_09.txt AC 0 ms 128 KB
1_10.txt AC 0 ms 128 KB
2_00.txt AC 10 ms 128 KB
2_01.txt AC 10 ms 128 KB
2_02.txt AC 12 ms 128 KB
2_03.txt AC 10 ms 128 KB
2_04.txt AC 10 ms 128 KB
2_05.txt AC 10 ms 128 KB
2_06.txt AC 10 ms 128 KB
2_07.txt AC 10 ms 128 KB
2_08.txt AC 10 ms 128 KB
2_09.txt AC 10 ms 128 KB
2_10.txt AC 10 ms 128 KB
2_11.txt AC 12 ms 128 KB
2_12.txt AC 12 ms 128 KB