Submission #1131198
Source Code Expand
#include <sstream> #include <vector> #include <algorithm> #include <cstring> #include <cstdlib> #include <iostream> #include <string> #include <cassert> #include <ctime> #include <map> #include <math.h> #include <cstdio> #include <set> #include <deque> #include <memory.h> #include <queue> #pragma comment(linker, "/STACK:64000000") typedef long long ll; using namespace std; const int MAXN = 1 << 18; const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2e9; const double PI = acos(-1.0); int main() { #ifdef _MSC_VER freopen("input.txt", "r", stdin); #endif int n; while (cin >> n) { vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int cur = 0; int ans = 1; for (int i = 0; i < n; i++) { if (a[i] < (i - cur) * 2 + 1) { ans = 1LL * ans * (i - cur + 1) % MOD; cur++; } else { continue; } } while (cur < n) ans = 1LL * ans * (n - cur++) % MOD; cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | izban |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 997 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 640 KB |
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 | 29 ms | 640 KB |
2_01.txt | AC | 31 ms | 640 KB |
2_02.txt | AC | 41 ms | 640 KB |
2_03.txt | AC | 32 ms | 640 KB |
2_04.txt | AC | 30 ms | 640 KB |
2_05.txt | AC | 31 ms | 640 KB |
2_06.txt | AC | 31 ms | 640 KB |
2_07.txt | AC | 31 ms | 640 KB |
2_08.txt | AC | 30 ms | 640 KB |
2_09.txt | AC | 30 ms | 640 KB |
2_10.txt | AC | 31 ms | 640 KB |
2_11.txt | AC | 40 ms | 640 KB |
2_12.txt | AC | 41 ms | 640 KB |