Submission #1521296


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000
#define MOD 1000000007
#define DD 100000

long dp[2][2505][DD+5];
long acc[DD+5];

int main(){
  long n,k,x;
  cin>>n>>k>>x;
  vector<long> s(k);
  rep(i,k) cin>>s[i];

  fill(dp[0][0], dp[2][0], 0);

  // dp[same?][left-value][length]

  dp[1][x][1] = 1;

  for(int vl=x-1; vl>=0; vl--){
    for(int bl=0; bl<=1; bl++){
      acc[0] = 0;
      for(int d=0; d<=DD; d++) acc[d+1] = acc[d] + dp[!bl][vl+!bl][d];
      for(int d=1; d<=DD; d++){
        if((d+!bl)/2+vl <= x) dp[bl][vl][d]=1;
        // prev[max(d-2*(x-vl),1) ... d-1]
        dp[bl][vl][d] += acc[d] - acc[max<int>(1, d-2*(x-vl))];
        dp[bl][vl][d] %= MOD;
      }
    }
  }

  long ans = 1;
  rep(i,k-1){
    ans *= dp[0][i][s[i+1]-s[i]];
    ans %= MOD;
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task E - Enormous Atcoder Railroad
User tossy
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1751 Byte
Status RE
Exec Time 0 ms
Memory 128 KB

Judge Result

Set Name Subtask1 Subtask2 Subtask3 Subtask4 Subtask5
Score / Max Score 0 / 120 0 / 90 0 / 260 0 / 160 0 / 370
Status
RE × 3
RE × 6
RE × 9
RE × 12
RE × 15
Set Name Test Cases
Subtask1 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt
Subtask2 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Subtask3 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt
Subtask4 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt
Subtask5 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt, sub5_in1.txt, sub5_in2.txt, sub5_in3.txt
Case Name Status Exec Time Memory
sub1_in1.txt RE 0 ms 128 KB
sub1_in2.txt RE 0 ms 128 KB
sub1_in3.txt RE 0 ms 128 KB
sub2_in1.txt RE 0 ms 128 KB
sub2_in2.txt RE 0 ms 128 KB
sub2_in3.txt RE 0 ms 128 KB
sub3_in1.txt RE 0 ms 128 KB
sub3_in2.txt RE 0 ms 128 KB
sub3_in3.txt RE 0 ms 128 KB
sub4_in1.txt RE 0 ms 128 KB
sub4_in2.txt RE 0 ms 128 KB
sub4_in3.txt RE 0 ms 128 KB
sub5_in1.txt RE 0 ms 128 KB
sub5_in2.txt RE 0 ms 128 KB
sub5_in3.txt RE 0 ms 128 KB