Submission #1131171
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; #define forn(i, a, n) for (int i = a; i < n; ++i) #define ford(i, a, n) for (int i = n - 1; i >= a; --i) #define fore(i, a, n) for (int i = a; i <= n; ++i) #define all(a) (a).begin(), (a).end() #define fs first #define sn second #define trace(a)\ for (auto i : a) cerr << i << ' ';\ cerr << '\n' #define eb emplace_back #ifndef M_PI const ld M_PI = acos(-1.0); #endif const ld eps = 1e-9; const int INF = 2000000000; const ll LINF = 1ll * INF * INF; const ll MOD = 1000000007; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int cnt = 0; ll ans = 1; while (n--) { int x; cin >> x; if (x >= 2 * cnt + 1) ++cnt; else ans = ans * (cnt + 1) % MOD; } fore(i, 1, cnt) ans = ans * i % MOD; cout << ans << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | khadaev |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 981 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 892 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 | 6 ms | 892 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 | 9 ms | 256 KB |
2_01.txt | AC | 9 ms | 256 KB |
2_02.txt | AC | 11 ms | 256 KB |
2_03.txt | AC | 9 ms | 256 KB |
2_04.txt | AC | 9 ms | 256 KB |
2_05.txt | AC | 9 ms | 256 KB |
2_06.txt | AC | 9 ms | 256 KB |
2_07.txt | AC | 9 ms | 256 KB |
2_08.txt | AC | 9 ms | 256 KB |
2_09.txt | AC | 9 ms | 256 KB |
2_10.txt | AC | 9 ms | 256 KB |
2_11.txt | AC | 11 ms | 256 KB |
2_12.txt | AC | 11 ms | 256 KB |