Submission #1474303
Source Code Expand
#include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <iostream> #include <queue> using namespace std; const int INF = 0x7fffffff; const int maxn = 1e5+10; const int MOD = 1e9 + 7; const int M = 1e9+10; long long a[maxn]; void init() { a[0]=1; for(int i=1;i<=maxn;i++){ a[i]=(a[i-1]*i)%MOD; } } int n; int pos[maxn]; int main() { // freopen("acm.txt","r",stdin); init(); while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++) scanf("%d",&pos[i]); int k=1; int cnt = 0; long long ans = 1; for(int i=0;i<n;i++){ // cout << "cnt: " << cnt<<" " << "k: " << k <<" " << pos[i] << endl; if(k <= pos[i] && i!=n-1){ k+=2; cnt++; }else if(k <= pos[i] && i==n-1){ ans = ans * a[cnt + 1] % MOD; // cout << "ans1: " << ans << endl; }else if(i!=n-1){ ans = ans * (cnt + 1) % MOD; // cout << "ans2: " << ans << endl; }else{ ans = (ans * a[cnt+1] ) % MOD; // cout << "ans3: " << ans << endl; } } printf("%I64d\n",ans); } }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1255 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 1408 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:51:29: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=] printf("%I64d\n",ans); ^ ./Main.cpp:31:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&pos[i]); ^ ./Main.cpp: In function ‘void init()’: ./Main.cpp:20:29: warning: iteration 100009u invokes undefined behavior [-Waggressive-loop-optimizations] a[i]=(a[i-1]*i)%MOD; ^ ./Main.cpp:19:18: note: containing loop for(int i=1;i<=maxn;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 | 2 ms | 1024 KB |
0_01.txt | AC | 2 ms | 1024 KB |
0_02.txt | AC | 2 ms | 1024 KB |
0_03.txt | AC | 2 ms | 1024 KB |
1_00.txt | AC | 2 ms | 1024 KB |
1_01.txt | AC | 2 ms | 1024 KB |
1_02.txt | AC | 2 ms | 1024 KB |
1_03.txt | AC | 2 ms | 1024 KB |
1_04.txt | AC | 2 ms | 1024 KB |
1_05.txt | AC | 2 ms | 1024 KB |
1_06.txt | AC | 2 ms | 1024 KB |
1_07.txt | AC | 2 ms | 1024 KB |
1_08.txt | AC | 2 ms | 1024 KB |
1_09.txt | AC | 2 ms | 1024 KB |
1_10.txt | AC | 2 ms | 1024 KB |
2_00.txt | AC | 11 ms | 1408 KB |
2_01.txt | AC | 12 ms | 1408 KB |
2_02.txt | AC | 13 ms | 1408 KB |
2_03.txt | AC | 12 ms | 1408 KB |
2_04.txt | AC | 11 ms | 1408 KB |
2_05.txt | AC | 11 ms | 1408 KB |
2_06.txt | AC | 11 ms | 1408 KB |
2_07.txt | AC | 12 ms | 1408 KB |
2_08.txt | AC | 11 ms | 1408 KB |
2_09.txt | AC | 11 ms | 1408 KB |
2_10.txt | AC | 11 ms | 1408 KB |
2_11.txt | AC | 13 ms | 1408 KB |
2_12.txt | AC | 13 ms | 1408 KB |