Submission #1734761
Source Code Expand
#include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<deque> #include<string> #include<string.h> #include<vector> #include<set> #include<map> #include<stdlib.h> using namespace std; const long long mod=1000000007; const long long inf=mod*mod; int x[110000]; int main(){ int a;scanf("%d",&a); for(int i=0;i<a;i++)scanf("%d",x+i); long long ret=1; int at=0; for(int i=0;i<a;i++){ while(at<a&&x[i]<i*2+1-at*2){ ret=(ret*(i+1-at))%mod; at++; } } while(at<a){ ret=(ret*(a-at))%mod; at++; } printf("%lld\n",ret); }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | tozangezan |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 589 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int a;scanf("%d",&a); ^ ./Main.cpp:18:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0;i<a;i++)scanf("%d",x+i); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 400 / 400 | ||||||
Status |
|
|
|
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 | 10 ms | 512 KB |
2_02.txt | AC | 12 ms | 512 KB |
2_03.txt | AC | 11 ms | 512 KB |
2_04.txt | AC | 10 ms | 512 KB |
2_05.txt | AC | 11 ms | 512 KB |
2_06.txt | AC | 10 ms | 512 KB |
2_07.txt | AC | 11 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 |