Submission #993634


Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  int n,m;
  cin >> n,m;

  if(n > m){
    println(0);
    return 0;
  }

  vector<vector<vector<long long>>> dp(n+1, vector<vector<long long>>(n+1, vector<long long>(2, 0)));
  dp[1][0][1] = 1;
  for(int i=0; i<m; i++){
    vector<vector<vector<long long>>> dp_(n+1, vector<vector<long long>>(n+1, vector<long long>(2, 0)));
    for(int x=1; x<=i+1; x++){
      for(int y=0; x+y<=n; y++){
        int z = n-(x+y);
        for(int k=0; k<=1; k++){
          if(dp[x][y][k] == 0) continue;
          auto& now = dp[x][y][k];
          if(k==0){
            (dp_[x][y][k] += dp[x][y][k] * y) %= mod;
            if(z) (dp_[x][y+1][k] += dp[x][y][k] * z) %= mod;
            (dp_[x+y][0][1] += dp[x][y][k] * x) %= mod;
          }else{
            (dp_[x][y][k] += dp[x][y][k] * x) %= mod;
            (dp_[x][1][0] += dp[x][y][k] * z) %= mod;
          }
        }
      }
    }

    swap(dp, dp_);
  }

  println( dp[n][0][1] );



  return 0;
}

Submission Info

Submission Time
Task F - Road of the King
User koyumeishi
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 4393 Byte
Status AC
Exec Time 1447 ms
Memory 10240 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 13
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
all sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
Case Name Status Exec Time Memory
01-01.txt AC 3 ms 256 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 5 ms 256 KB
01-06.txt AC 154 ms 1152 KB
01-07.txt AC 1360 ms 9600 KB
01-08.txt AC 1434 ms 10112 KB
01-09.txt AC 1443 ms 10112 KB
01-10.txt AC 1447 ms 10240 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 410 ms 2816 KB
sample-03.txt AC 3 ms 256 KB