結果
| 問題 | No.2427 Tree Distance Two |
| ユーザー |
 osada-yum
|
| 提出日時 | 2023-08-18 23:17:54 |
| 言語 | Fortran (gFortran 13.2.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 13,749 bytes |
| コンパイル時間 | 1,751 ms |
| コンパイル使用メモリ | 38,016 KB |
| 実行使用メモリ | 40,588 KB |
| 最終ジャッジ日時 | 2024-05-06 05:57:59 |
| 合計ジャッジ時間 | 7,544 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
10,752 KB |
| testcase_01 | AC | 1 ms
5,376 KB |
| testcase_02 | AC | 1 ms
5,376 KB |
| testcase_03 | AC | 594 ms
34,432 KB |
| testcase_04 | AC | 1 ms
5,376 KB |
| testcase_05 | AC | 588 ms
34,304 KB |
| testcase_06 | AC | 1 ms
5,376 KB |
| testcase_07 | TLE | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
ソースコード
module unwrapped_vector_m
use, intrinsic :: iso_fortran_env
implicit none
private
public :: unwrapped_vector_int32
type :: unwrapped_vector_int32
private
integer(int32), allocatable, public :: arr_(:)
integer(int32) :: size_ = 0, capa_ = 0
contains
procedure, pass :: init => init_unwrapped_vector_int32
procedure, pass :: push_back_unwrapped_vector_int32, push_back_array_unwrapped_vector_int32
generic :: push_back => push_back_unwrapped_vector_int32, push_back_array_unwrapped_vector_int32
procedure, pass :: pop_back => pop_back_unwrapped_vector_int32
procedure, pass :: back => back_unwrapped_vector_int32
procedure, pass :: size => size_unwrapped_vector_int32
procedure, pass :: resize => resize_unwrapped_vector_int32
procedure, pass :: lower_bound => lower_bound_unwrapped_vector_int32
end type unwrapped_vector_int32
interface unwrapped_vector_int32
module procedure :: construct_unwrapped_vector_int32_by_size, &
construct_unwrapped_vector_int32_by_arr, &
construct_unwrapped_vector_int32_by_init_val
end interface unwrapped_vector_int32
public :: unwrapped_vector_int64
type :: unwrapped_vector_int64
private
integer(int64), allocatable, public :: arr_(:)
integer(int32) :: size_ = 0, capa_ = 0
contains
procedure, pass :: init => init_unwrapped_vector_int64
procedure, pass :: push_back_unwrapped_vector_int64, push_back_array_unwrapped_vector_int64
generic :: push_back => push_back_unwrapped_vector_int64, push_back_array_unwrapped_vector_int64
procedure, pass :: pop_back => pop_back_unwrapped_vector_int64
procedure, pass :: back => back_unwrapped_vector_int64
procedure, pass :: size => size_unwrapped_vector_int64
procedure, pass :: resize => resize_unwrapped_vector_int64
procedure, pass :: lower_bound => lower_bound_unwrapped_vector_int64
end type unwrapped_vector_int64
interface unwrapped_vector_int64
module procedure :: construct_unwrapped_vector_int64_by_size, &
construct_unwrapped_vector_int64_by_arr, &
construct_unwrapped_vector_int64_by_init_val
end interface unwrapped_vector_int64
contains
!> construct_unwrapped_vector_int32_by_size: Construct unwrapped_vector_int32 by the size, the initial values is unknown.
impure function construct_unwrapped_vector_int32_by_size(size) result(res)
type(unwrapped_vector_int32) :: res
integer(int32), intent(in) :: size
call res%init(size)
end function construct_unwrapped_vector_int32_by_size
!> construct_unwrapped_vector_int32_by_arr: Construct unwrapped_vector_int32 by the array of integer(int32).
impure function construct_unwrapped_vector_int32_by_arr(arr) result(res)
type(unwrapped_vector_int32) :: res
integer(int32), intent(in) :: arr(:)
integer(int32) :: n
n = size(arr)
call res%init(n)
res%arr_(1:n) = arr(1:n)
end function construct_unwrapped_vector_int32_by_arr
!> construct_unwrapped_vector_int32_by_init_val: Construct unwrapped_vector_int32 by size and the initial values.
impure function construct_unwrapped_vector_int32_by_init_val(size, val) result(res)
type(unwrapped_vector_int32) :: res
integer(int32), intent(in) :: size
integer(int32), intent(in) :: val
call res%init(size)
res%arr_(1:size) = val
end function construct_unwrapped_vector_int32_by_init_val
!> init_unwrapped_vector_int32: Initialize the unwrapped_vector_int32 by size.
subroutine init_unwrapped_vector_int32(this, n)
class(unwrapped_vector_int32), intent(inout) :: this
integer(int32), intent(in) :: n
if (.not. allocated(this%arr_)) then
allocate(this%arr_(n))
this%size_ = n
this%capa_ = n
end if
end subroutine init_unwrapped_vector_int32
!> push_back_unwrapped_vector_int32: Insert value to the tail of elements of the unwrapped_vector_int32.
subroutine push_back_unwrapped_vector_int32(this, val)
class(unwrapped_vector_int32), intent(inout) :: this
integer(int32), intent(in) :: val
if (.not. allocated(this%arr_)) call this%resize(0)
if (this%size_ == this%capa_) then
call this%resize(2*this%capa_)
end if
this%size_ = this%size_ + 1
this%arr_(this%size_) = val
end subroutine push_back_unwrapped_vector_int32
!> push_back_array_unwrapped_vector_int32: Insert elemeents of array to the tail of elements of the unwrapped_vector_int32.
subroutine push_back_array_unwrapped_vector_int32(this, arr)
class(unwrapped_vector_int32), intent(inout) :: this
integer(int32), intent(in) :: arr(:)
integer(int32) :: s
s = size(arr)
if (.not. allocated(this%arr_)) call this%init(s)
if (this%size_ + s > this%capa_) then
call this%resize(this%size_ + s)
end if
this%arr_(this%size_+1:this%size_+s) = arr(:)
this%size_ = this%size_ + s
end subroutine push_back_array_unwrapped_vector_int32
!> pop_back_unwrapped_vector_int32: Delete the value in the end of arr_(:) of the unwrapped_vector_int32 and return it.
integer(int32) function pop_back_unwrapped_vector_int32(this)
class(unwrapped_vector_int32), intent(inout) :: this
pop_back_unwrapped_vector_int32 = this%arr_(this%size_)
this%size_ = this%size_ - 1
end function pop_back_unwrapped_vector_int32
!> back_unwrapped_vector_int32: Delete the value in the end of arr_(:) of the unwrapped_vector_int32 and return it.
integer(int32) function back_unwrapped_vector_int32(this)
class(unwrapped_vector_int32), intent(inout) :: this
back_unwrapped_vector_int32 = this%arr_(this%size_)
end function back_unwrapped_vector_int32
!> size_vector_int32: Return current size of the unwrapped_vector_int32.
pure integer(int32) function size_unwrapped_vector_int32(this)
class(unwrapped_vector_int32), intent(in) :: this
size_unwrapped_vector_int32 = this%size_
end function size_unwrapped_vector_int32
!> resize_unwrapped_vector_int32: Shrink or expand arr_(:) of the unwrapped_vector_int32.
subroutine resize_unwrapped_vector_int32(this, resize)
class(unwrapped_vector_int32), intent(inout) :: this
integer(int32), intent(in) :: resize
integer(int32), allocatable :: tmp(:)
if (resize < 1) then
this%size_ = 0
allocate(tmp(1))
call move_alloc(from = tmp, to = this%arr_)
this%capa_ = 1
else
if (this%capa_ == resize) return
allocate(tmp(resize))
this%size_ = min(this%size_, resize)
tmp(1:this%size_) = this%arr_(1:this%size_)
call move_alloc(from = tmp, to = this%arr_)
this%capa_ = resize
end if
end subroutine resize_unwrapped_vector_int32
!> lower_bound_vector_int32: Return the minimum index that is higher than or equal to .
integer(int32) function lower_bound_unwrapped_vector_int32(this, val)
class(unwrapped_vector_int32), intent(in) :: this
integer(int32), intent(in) :: val
integer(int32) :: p, q, r
p = 1
r = this%size_
if (this%arr_(r) < val) then
lower_bound_unwrapped_vector_int32 = r + 1
return
end if
do
q = (p+r)/2
if (p + 1 > r) exit
if (this%arr_(q) >= val) then
r = q
else
p = q+1
end if
end do
lower_bound_unwrapped_vector_int32 = q
end function lower_bound_unwrapped_vector_int32
!> construct_unwrapped_vector_int64_by_size: Construct unwrapped_vector_int64 by the size, the initial values is unknown.
impure function construct_unwrapped_vector_int64_by_size(size) result(res)
type(unwrapped_vector_int64) :: res
integer(int32), intent(in) :: size
call res%init(size)
end function construct_unwrapped_vector_int64_by_size
!> construct_unwrapped_vector_int64_by_arr: Construct unwrapped_vector_int64 by the array of integer(int64).
impure function construct_unwrapped_vector_int64_by_arr(arr) result(res)
type(unwrapped_vector_int64) :: res
integer(int64), intent(in) :: arr(:)
integer(int32) :: n
n = size(arr)
call res%init(n)
res%arr_(1:n) = arr(1:n)
end function construct_unwrapped_vector_int64_by_arr
!> construct_unwrapped_vector_int64_by_init_val: Construct unwrapped_vector_int64 by size and the initial values.
impure function construct_unwrapped_vector_int64_by_init_val(size, val) result(res)
type(unwrapped_vector_int64) :: res
integer(int32), intent(in) :: size
integer(int64), intent(in) :: val
call res%init(size)
res%arr_(1:size) = val
end function construct_unwrapped_vector_int64_by_init_val
!> init_unwrapped_vector_int64: Initialize the unwrapped_vector_int64 by size.
subroutine init_unwrapped_vector_int64(this, n)
class(unwrapped_vector_int64), intent(inout) :: this
integer(int32), intent(in) :: n
if (.not. allocated(this%arr_)) then
allocate(this%arr_(n))
this%size_ = n
this%capa_ = n
end if
end subroutine init_unwrapped_vector_int64
!> push_back_unwrapped_vector_int64: Insert value to the tail of elements of the unwrapped_vector_int64.
subroutine push_back_unwrapped_vector_int64(this, val)
class(unwrapped_vector_int64), intent(inout) :: this
integer(int64), intent(in) :: val
if (.not. allocated(this%arr_)) call this%resize(0)
if (this%size_ == this%capa_) then
call this%resize(2*this%capa_)
end if
this%size_ = this%size_ + 1
this%arr_(this%size_) = val
end subroutine push_back_unwrapped_vector_int64
!> push_back_array_unwrapped_vector_int64: Insert elemeents of array to the tail of elements of the unwrapped_vector_int64.
subroutine push_back_array_unwrapped_vector_int64(this, arr)
class(unwrapped_vector_int64), intent(inout) :: this
integer(int64), intent(in) :: arr(:)
integer(int32) :: s
s = size(arr)
if (.not. allocated(this%arr_)) call this%init(s)
if (this%size_ + s > this%capa_) then
call this%resize(this%size_ + s)
end if
this%arr_(this%size_+1:this%size_+s) = arr(:)
this%size_ = this%size_ + s
end subroutine push_back_array_unwrapped_vector_int64
!> pop_back_unwrapped_vector_int64: Delete the value in the end of arr_(:) of the unwrapped_vector_int64 and return it.
integer(int64) function pop_back_unwrapped_vector_int64(this)
class(unwrapped_vector_int64), intent(inout) :: this
pop_back_unwrapped_vector_int64 = this%arr_(this%size_)
this%size_ = this%size_ - 1
end function pop_back_unwrapped_vector_int64
!> back_unwrapped_vector_int64: Delete the value in the end of arr_(:) of the unwrapped_vector_int64 and return it.
integer(int64) function back_unwrapped_vector_int64(this)
class(unwrapped_vector_int64), intent(inout) :: this
back_unwrapped_vector_int64 = this%arr_(this%size_)
end function back_unwrapped_vector_int64
!> size_vector_int64: Return current size of the unwrapped_vector_int64.
pure integer(int32) function size_unwrapped_vector_int64(this)
class(unwrapped_vector_int64), intent(in) :: this
size_unwrapped_vector_int64 = this%size_
end function size_unwrapped_vector_int64
!> resize_unwrapped_vector_int64: Shrink or expand arr_(:) of the unwrapped_vector_int64.
subroutine resize_unwrapped_vector_int64(this, resize)
class(unwrapped_vector_int64), intent(inout) :: this
integer(int32), intent(in) :: resize
integer(int64), allocatable :: tmp(:)
if (resize < 1) then
this%size_ = 0
allocate(tmp(1))
call move_alloc(from = tmp, to = this%arr_)
this%capa_ = 1
else
if (this%capa_ == resize) return
allocate(tmp(resize))
this%size_ = min(this%size_, resize)
tmp(1:this%size_) = this%arr_(1:this%size_)
call move_alloc(from = tmp, to = this%arr_)
this%capa_ = resize
end if
end subroutine resize_unwrapped_vector_int64
!> lower_bound_vector_int64: Return the minimum index that is higher than or equal to .
integer(int32) function lower_bound_unwrapped_vector_int64(this, val)
class(unwrapped_vector_int64), intent(in) :: this
integer(int64), intent(in) :: val
integer(int32) :: p, q, r
p = 1
r = this%size_
if (this%arr_(r) < val) then
lower_bound_unwrapped_vector_int64 = r + 1
return
end if
do
q = (p+r)/2
if (p + 1 > r) exit
if (this%arr_(q) >= val) then
r = q
else
p = q+1
end if
end do
lower_bound_unwrapped_vector_int64 = q
end function lower_bound_unwrapped_vector_int64
end module unwrapped_vector_m
program yukicoder_2427
use, intrinsic :: iso_fortran_env
use unwrapped_vector_m, only: &
vec_i32 => unwrapped_vector_int32
implicit none
integer(int32) :: n, u, v, cnts
type(vec_i32), allocatable :: g(:)
logical, allocatable :: visited(:)
integer(int32) :: i
read(input_unit, *) n
allocate(g(n))
do i = 1, n - 1
read(input_unit, *) u, v
call g(u)%push_back(v)
call g(v)%push_back(u)
end do
allocate(visited(n), source = .false.)
do v = 1, n
cnts = 0_int32
call dfs(v, 0, visited, cnts)
write(output_unit, '(i0)') cnts
end do
contains
pure recursive subroutine dfs(v, dist, visited, cnts)
integer(int32), intent(in) :: v, dist
logical, intent(inout) :: visited(:)
integer(int32), intent(inout) :: cnts
integer(int32) :: i, next_v
if (dist == 2) then
cnts = cnts + 1
return
end if
if (visited(v)) return
visited(v) = .true.
do i = 1, g(v)%size()
next_v = g(v)%arr_(i)
if (visited(next_v)) cycle
call dfs(next_v, dist + 1, visited, cnts)
end do
visited(v) = .false.
end subroutine dfs
end program yukicoder_2427