Submission #1131270
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define all(c) c.begin(),c.end() #define pb push_back #define fs first #define sc second #define show(x) cout << #x << " = " << x << endl #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) using namespace std; template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";} template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;} int N; int x[100000]; typedef long long ll; ll mod=1e9+7; int main(){ cin>>N; rep(i,N) cin>>x[i]; ll ans=1; int j=0; rep(i,N){ while(j<N&&x[j]>2*(j-i)) j++; ans*=(min(N,j+1)-i); ans%=mod; // show(j+1-i); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | sigma425 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 870 Byte |
Status | AC |
Exec Time | 55 ms |
Memory | 640 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 | 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 | 38 ms | 640 KB |
2_01.txt | AC | 41 ms | 640 KB |
2_02.txt | AC | 55 ms | 640 KB |
2_03.txt | AC | 40 ms | 640 KB |
2_04.txt | AC | 39 ms | 640 KB |
2_05.txt | AC | 40 ms | 640 KB |
2_06.txt | AC | 39 ms | 640 KB |
2_07.txt | AC | 40 ms | 640 KB |
2_08.txt | AC | 40 ms | 640 KB |
2_09.txt | AC | 39 ms | 640 KB |
2_10.txt | AC | 40 ms | 640 KB |
2_11.txt | AC | 53 ms | 640 KB |
2_12.txt | AC | 55 ms | 640 KB |