Submission #1229962
Source Code Expand
#include <cstdio> typedef long long int64; static const int MAXN = 1e5 + 4; static const int MODULUS = 1e9 + 7; #define _ % MODULUS #define __ %= MODULUS int n; int x[MAXN]; int main() { scanf("%d", &n); for (int i = 0; i < n; ++i) scanf("%d", &x[i]); int64 ans = 1; int s = 0; for (int i = 0, j; i < n; i = j + 1) { for (j = i; j < n; ++j) if (x[j] >= 2 * s + 1) ++s; else { (ans *= (s + 1))__; break; } } for (int i = 1; i <= s; ++i) (ans *= i)__; printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | cyand1317 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 586 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:14:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < n; ++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 | 11 ms | 512 KB |
2_02.txt | AC | 13 ms | 512 KB |
2_03.txt | AC | 11 ms | 512 KB |
2_04.txt | AC | 11 ms | 512 KB |
2_05.txt | AC | 10 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 |