Submission #1131249
Source Code Expand
#include <algorithm> #include <cassert> #include <iostream> #include <vector> #include <cstdio> #include <complex> #include <cstring> using namespace std; const int N = 100000 + 5; const int MOD = 1000000000 + 7; int n; int x[N]; void solve() { cin >> n; for(int i = 0; i < n; ++ i) { scanf("%d", x + i); } long long ans = 1; int cur = 1; int cnt = 1; for(int i = 0; i < n; ++ i) { if (x[i] >= cur) { cnt ++; cur += 2; continue; } ans = ans * cnt % MOD; } for(int i = 1; i <= cnt - 1; ++ i) { ans = ans * i % MOD; } cout << ans << endl; } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | AngryBacon |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 750 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:21:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 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 | 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 | 11 ms | 640 KB |
2_01.txt | AC | 11 ms | 640 KB |
2_02.txt | AC | 13 ms | 640 KB |
2_03.txt | AC | 11 ms | 640 KB |
2_04.txt | AC | 11 ms | 640 KB |
2_05.txt | AC | 11 ms | 640 KB |
2_06.txt | AC | 11 ms | 640 KB |
2_07.txt | AC | 11 ms | 640 KB |
2_08.txt | AC | 11 ms | 640 KB |
2_09.txt | AC | 11 ms | 640 KB |
2_10.txt | AC | 11 ms | 640 KB |
2_11.txt | AC | 13 ms | 640 KB |
2_12.txt | AC | 13 ms | 640 KB |