Submission #7342782


Source Code Expand

program road_of_the_king
  implicit none
  integer(8), parameter :: md = 1000000007_8
  integer(8) :: dp(0:300,301,300) = 0_8
  integer :: n, m, i, j, k
  read(*,*) n, m
  dp(0,1,1) = 1_8
  do i = 0, m-1
    do j = 1, n
      do k = 1, n
        dp(i+1,j+1,k) = mod(dp(i+1,j+1,k)+dp(i,j,k)*int(n-j,8),md)
        dp(i+1,j,k) = mod(dp(i+1,j,k)+dp(i,j,k)*int(j-k,8),md)
        dp(i+1,j,j) = mod(dp(i+1,j,j)+dp(i,j,k)*int(k,8),md)
      end do
    end do
  end do
  write(*,'(i0)') dp(m,n,n)
end program road_of_the_king

Submission Info

Submission Time
Task F - Road of the King
User ue1221
Language Fortran (gfortran v4.8.4)
Score 1000
Code Size 535 Byte
Status AC
Exec Time 455 ms
Memory 212608 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 16
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, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 46 ms 212608 KB
01-05.txt AC 2 ms 6400 KB
01-06.txt AC 46 ms 62336 KB
01-07.txt AC 418 ms 206976 KB
01-08.txt AC 455 ms 211200 KB
01-09.txt AC 438 ms 211968 KB
01-10.txt AC 452 ms 212608 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 110 ms 105728 KB
sample-03.txt AC 243 ms 212608 KB