Submission #1817128
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
before_main_function() {
#ifdef int
#undef INF
#define INF INFLL
#define stoi stoll
#endif
cin.tie(0);ios::sync_with_stdio(false);
cout<<setprecision(15)<<fixed;
#define endl "\n"
}
} before_main_function;
//------------------8<------------------------------------8<--------------------
const int MOD=1e9+7;
const int MAX_N=200005;
long long fact[MAX_N];
long long fact_inv[MAX_N];
long long bin_pow_mod(long long x,long long y) {
if(x==0) return 0;
long long prod=1;
while(y>0) {
if(y&1) {
prod=(prod*x)%MOD;
}
x=(x*x)%MOD;
y>>=1;
}
return prod%MOD;
}
struct init_fact {
init_fact() {
fact[0]=1, fact_inv[0]=1;
for(int i=1;i<MAX_N;++i) {
fact[i]=(fact[i-1]*i)%MOD;
fact_inv[i]=bin_pow_mod(fact[i],MOD-2);
}
}
} init_fact;
long long combination(int n,int r) {
return ((fact[n]*fact_inv[n-r])%MOD*fact_inv[r])%MOD;
}
signed main() {
int N;
cin>>N;
vector<int> a(N);
cin>>a;
int ans=1;
int last=0;
int cnt=0;
REP(i,N) {
if(a[i]==-1) {
cnt++;
}
else {
int t=(a[i]-last);
ans*=combination(t+cnt,cnt);
ans%=MOD;
cnt=0;
last=a[i];
}
}
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - タコヤ木 |
User |
algon |
Language |
C++14 (GCC 5.4.1) |
Score |
80 |
Code Size |
2742 Byte |
Status |
RE |
Exec Time |
130 ms |
Memory |
3456 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
Score / Max Score |
0 / 0 |
50 / 50 |
30 / 30 |
0 / 20 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 |
sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt |
Subtask2 |
sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Subtask3 |
sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
33 ms |
3328 KB |
sample_02.txt |
AC |
33 ms |
3328 KB |
sample_03.txt |
RE |
130 ms |
3328 KB |
subtask1_01.txt |
AC |
33 ms |
3328 KB |
subtask1_02.txt |
AC |
33 ms |
3328 KB |
subtask1_03.txt |
AC |
33 ms |
3328 KB |
subtask1_04.txt |
AC |
33 ms |
3328 KB |
subtask1_05.txt |
AC |
33 ms |
3328 KB |
subtask1_06.txt |
AC |
33 ms |
3328 KB |
subtask1_07.txt |
AC |
33 ms |
3328 KB |
subtask1_08.txt |
AC |
33 ms |
3328 KB |
subtask1_09.txt |
AC |
33 ms |
3328 KB |
subtask1_10.txt |
AC |
33 ms |
3328 KB |
subtask1_11.txt |
AC |
33 ms |
3328 KB |
subtask1_12.txt |
AC |
33 ms |
3328 KB |
subtask2_01.txt |
AC |
33 ms |
3328 KB |
subtask2_02.txt |
AC |
33 ms |
3328 KB |
subtask2_03.txt |
AC |
33 ms |
3328 KB |
subtask2_04.txt |
AC |
33 ms |
3328 KB |
subtask2_05.txt |
AC |
33 ms |
3456 KB |
subtask2_06.txt |
AC |
33 ms |
3456 KB |
subtask2_07.txt |
AC |
33 ms |
3456 KB |
subtask2_08.txt |
AC |
33 ms |
3456 KB |
subtask2_09.txt |
AC |
33 ms |
3456 KB |
subtask2_10.txt |
AC |
33 ms |
3456 KB |
subtask2_11.txt |
AC |
33 ms |
3456 KB |
subtask2_12.txt |
AC |
33 ms |
3456 KB |
subtask3_01.txt |
RE |
128 ms |
3328 KB |
subtask3_02.txt |
RE |
128 ms |
3328 KB |
subtask3_03.txt |
RE |
128 ms |
3328 KB |
subtask3_04.txt |
RE |
130 ms |
3456 KB |
subtask3_05.txt |
RE |
130 ms |
3328 KB |
subtask3_06.txt |
RE |
129 ms |
3456 KB |
subtask3_07.txt |
RE |
128 ms |
3456 KB |
subtask3_08.txt |
RE |
129 ms |
3456 KB |
subtask3_09.txt |
RE |
128 ms |
3456 KB |
subtask3_10.txt |
RE |
129 ms |
3456 KB |
subtask3_11.txt |
RE |
128 ms |
3456 KB |
subtask3_12.txt |
RE |
128 ms |
3456 KB |