Submission #1303262
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; const ll mod = 1000*1000*1000+7; int N; vector<int> X; int main() { scanf("%d", &N); X.resize(N); for(int i = 0; i < N; i++) { scanf("%d", &X[i]); } ll ans = 1; int cnt = 1; for(int i = 0; i < N - 1; i++) { if(X[i] >= 2*cnt - 1) cnt++; else { ans *= cnt; ans %= mod; } } for(int i = 1; i <= cnt; i++) { ans *= i; ans %= mod; } printf("%lld", ans); }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | choikiwon |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 564 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:13: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 |