Submission #1131204


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <map>
#include <deque>
#define SIZE 100005
#define MOD 1000000007

using namespace std;
typedef long long int ll;

int pos[SIZE];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++) scanf("%d",&pos[i]);
	int to=0;
	ll ret=1;
	for(int i=0;i<n;i++)
	{
		while(to<n&&pos[to]>=2*(to-i+1)-1) to++;
		ret=ret*(ll) (min(n,to+1)-i)%MOD;
		//printf("%d\n",to);
	}
	printf("%lld\n",ret);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:23:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) scanf("%d",&pos[i]);
                                          ^

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