Submission #1131271
Source Code Expand
#include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<cmath> #include<vector> #include<queue> #include<map> #include<set> #include<stack> #include<cstdlib> #include<string> #include<bitset> #include<iomanip> #include<deque> #include<utility> #define INF 1000000000 #define fi first #define se second #define N 100005 #define P 1000000007 #define debug(x) cerr<<#x<<"="<<x<<endl #define MP(x,y) make_pair(x,y) using namespace std; typedef long long LL; typedef pair<int,int> pii; int main() { int n,ans=1,x,nowx=1,cnt=0; cin>>n; while(n--) { scanf("%d",&x); if(x>=nowx) { nowx+=2; cnt++; } else ans=(LL)ans*(cnt+1)%P; } while(cnt) { ans=(LL)ans*(cnt)%P; cnt--; } cout<<ans<<endl; return 0; } // davidlee1999WTK 2017/ // ios::sync_with_stdio(false); //#pragma comment(linker, "/STACK:102400000,102400000") compiler c++,not g++ /* */
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | davidlee1999wtk |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1035 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&x); ^
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 | 256 KB |
2_01.txt | AC | 11 ms | 256 KB |
2_02.txt | AC | 13 ms | 256 KB |
2_03.txt | AC | 11 ms | 256 KB |
2_04.txt | AC | 11 ms | 256 KB |
2_05.txt | AC | 11 ms | 256 KB |
2_06.txt | AC | 11 ms | 256 KB |
2_07.txt | AC | 11 ms | 256 KB |
2_08.txt | AC | 11 ms | 256 KB |
2_09.txt | AC | 11 ms | 256 KB |
2_10.txt | AC | 11 ms | 256 KB |
2_11.txt | AC | 13 ms | 256 KB |
2_12.txt | AC | 13 ms | 256 KB |