Submission #1383092


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll MOD = 1e9+7;
//LLONG_MIN

ll f(ll n){
	if(n==1)return 1;
	return n*f(n-1)%MOD;
}

int main(void){
	ll N,x,k=0,ans=1,robot=0;
	stack<ll> S;
	cin>>N;
	rep(i,N){
		cin>>x;
		k++;
		if(x>=k*2-1){
			robot++;
		}else{
			ans=ans*k%MOD;
			// cout<<ans<<endl;
			k--;
		}
	}
	if(robot>0)ans=ans*f(robot)%MOD;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User RMQ
Language C++14 (GCC 5.4.1)
Score 900
Code Size 895 Byte
Status AC
Exec Time 43 ms
Memory 1792 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 31 ms 1024 KB
2_01.txt AC 32 ms 1792 KB
2_02.txt AC 43 ms 1792 KB
2_03.txt AC 32 ms 1408 KB
2_04.txt AC 33 ms 1536 KB
2_05.txt AC 32 ms 1664 KB
2_06.txt AC 32 ms 1792 KB
2_07.txt AC 32 ms 1792 KB
2_08.txt AC 32 ms 1792 KB
2_09.txt AC 32 ms 1792 KB
2_10.txt AC 33 ms 1792 KB
2_11.txt AC 41 ms 1792 KB
2_12.txt AC 42 ms 1792 KB