Submission #1131287


Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=1;i<=(n);++i)
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
int ind[100001];
int main()
{
	int n;
	scanf("%d",&n);
	rep(i,n)scanf("%d",&ind[i]);
	sort(ind+1,ind+n+1);
	int tct=0;
	long long result=1;
	rep(i,n)
	{
		++tct;
		if(tct-1>=(ind[i]+1)/2)
		{
			result=result*tct%1000000007;
			tct--;
		}
	}
	while(tct>0)
	{
		result=result*tct%1000000007;
		--tct;
	}
	cout<<result;
	
}

Submission Info

Submission Time
Task A - Robot Racing
User carra
Language C++14 (GCC 5.4.1)
Score 900
Code Size 577 Byte
Status AC
Exec Time 14 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i,n)scanf("%d",&ind[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 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 12 ms 640 KB
2_01.txt AC 12 ms 640 KB
2_02.txt AC 14 ms 640 KB
2_03.txt AC 12 ms 640 KB
2_04.txt AC 12 ms 640 KB
2_05.txt AC 12 ms 640 KB
2_06.txt AC 12 ms 640 KB
2_07.txt AC 12 ms 640 KB
2_08.txt AC 12 ms 640 KB
2_09.txt AC 12 ms 640 KB
2_10.txt AC 12 ms 640 KB
2_11.txt AC 14 ms 640 KB
2_12.txt AC 14 ms 640 KB