Submission #1156138
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> #include <functional> #include <tuple> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <array> #include <utility> #include <valarray> using namespace std; constexpr int mod = 1000000007; inline int modMultiple(int a, int b){return (static_cast<long long>(a) * b) % mod;} int main() { int N; scanf("%d\n", &N); int result = 1; int k = 0; for (int i = 0; i < N; ++i){ int Xi; scanf("%d", &Xi); getchar(); while (Xi < k * 2 + 1){ result = modMultiple(result, k + 1); --k; } ++k; } for (; k > 0; --k){ result = modMultiple(result, k); } printf("%d\n", result); }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | painfulness |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 809 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:24:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n", &N); ^ ./Main.cpp:29:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &Xi); getchar(); ^
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 | 0 ms | 128 KB |
0_01.txt | AC | 0 ms | 128 KB |
0_02.txt | AC | 0 ms | 128 KB |
0_03.txt | AC | 0 ms | 128 KB |
1_00.txt | AC | 0 ms | 128 KB |
1_01.txt | AC | 0 ms | 128 KB |
1_02.txt | AC | 0 ms | 128 KB |
1_03.txt | AC | 0 ms | 128 KB |
1_04.txt | AC | 0 ms | 128 KB |
1_05.txt | AC | 0 ms | 128 KB |
1_06.txt | AC | 0 ms | 128 KB |
1_07.txt | AC | 0 ms | 128 KB |
1_08.txt | AC | 0 ms | 128 KB |
1_09.txt | AC | 0 ms | 128 KB |
1_10.txt | AC | 0 ms | 128 KB |
2_00.txt | AC | 11 ms | 128 KB |
2_01.txt | AC | 12 ms | 128 KB |
2_02.txt | AC | 14 ms | 128 KB |
2_03.txt | AC | 12 ms | 128 KB |
2_04.txt | AC | 11 ms | 128 KB |
2_05.txt | AC | 12 ms | 128 KB |
2_06.txt | AC | 12 ms | 128 KB |
2_07.txt | AC | 12 ms | 128 KB |
2_08.txt | AC | 11 ms | 128 KB |
2_09.txt | AC | 11 ms | 128 KB |
2_10.txt | AC | 11 ms | 128 KB |
2_11.txt | AC | 13 ms | 128 KB |
2_12.txt | AC | 13 ms | 128 KB |