Submission #3473872
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
ll MOD = 1000000007;
struct mint {
ll x;
mint(): x(0) { }
mint(ll y) : x(y>=0 ? y%MOD : y%MOD+MOD) {}
ll get() const { return x; }
// e乗
mint pow(ll e) {
ll a = 1, p = x;
while(e > 0) {
if(e%2 == 0) {p = (p*p) % MOD; e /= 2;}
else {a = (a*p) % MOD; e--;}
}
return mint(a);
}
// Comparators
bool operator <(mint b) { return x < b.x; }
bool operator >(mint b) { return x > b.x; }
bool operator<=(mint b) { return x <= b.x; }
bool operator>=(mint b) { return x >= b.x; }
bool operator!=(mint b) { return x != b.x; }
bool operator==(mint b) { return x == b.x; }
// increment, decrement
mint operator++() { x++; return *this; }
mint operator++(signed) { mint t = *this; x++; return t; }
mint operator--() { x--; return *this; }
mint operator--(signed) { mint t = *this; x--; return t; }
// Basic Operations
mint &operator+=(mint that) {
x += that.x;
if(x >= MOD) x -= MOD;
return *this;
}
mint &operator-=(mint that) {
x -= that.x;
if(x < 0) x += MOD;
return *this;
}
mint &operator*=(mint that) {
x = (ll)x * that.x % MOD;
return *this;
}
mint &operator/=(mint that) {
x = (ll)x * that.pow(MOD-2).x % MOD;
return *this;
}
mint &operator%=(mint that) {
x = (ll)x % that.x;
return *this;
}
mint operator+(mint that) const { return mint(*this) += that; }
mint operator-(mint that) const { return mint(*this) -= that; }
mint operator*(mint that) const { return mint(*this) *= that; }
mint operator/(mint that) const { return mint(*this) /= that; }
mint operator%(mint that) const { return mint(*this) %= that; }
};
// Input/Output
ostream &operator<<(ostream& os, mint a) { return os << a.x; }
istream &operator>>(istream& is, mint &a) { return is >> a.x; }
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> x(n);
cin >> x;
mint ret = 1;
ll used = 0;
REP(i, n) {
if(x[i]%2 && x[i]+1==x[i+1]) continue;
ll tmp = ((x[i]-1)/2 + 1) * 2;
if(tmp/2 < i+1-used) {
// cout << i << " " << x[i] << " " << tmp << endl;
ret *= i+1-used;
used++;
}
}
REP(i, n-used) ret *= i+1;
cout << ret << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Robot Racing |
User |
ferin_tech |
Language |
C++14 (GCC 5.4.1) |
Score |
900 |
Code Size |
3846 Byte |
Status |
AC |
Exec Time |
13 ms |
Memory |
1024 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 |
11 ms |
1024 KB |
2_01.txt |
AC |
11 ms |
1024 KB |
2_02.txt |
AC |
13 ms |
1024 KB |
2_03.txt |
AC |
11 ms |
1024 KB |
2_04.txt |
AC |
11 ms |
1024 KB |
2_05.txt |
AC |
12 ms |
1024 KB |
2_06.txt |
AC |
11 ms |
1024 KB |
2_07.txt |
AC |
12 ms |
1024 KB |
2_08.txt |
AC |
12 ms |
1024 KB |
2_09.txt |
AC |
11 ms |
1024 KB |
2_10.txt |
AC |
12 ms |
1024 KB |
2_11.txt |
AC |
13 ms |
1024 KB |
2_12.txt |
AC |
13 ms |
1024 KB |