#1026816 (Fortran) No.2953 Maximum Right Triangle

• 問題: No.2953 Maximum Right Triangle
• ユーザー: osada-yum
• 提出日時: 2024-11-16 00:09:47
• 言語: Fortran (gFortran 14.2.0)
• 結果: WA
• 実行時間: -
• コード長: 3,225 bytes
• コンパイル時間: 1,414 ms
• コンパイル使用メモリ: 31,804 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-16 00:09:49
• 合計ジャッジ時間: 919 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 2 WA * 4

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
!> This file was processed by `fypp`.
!> Today's fortune: "Bad WA", really OK?
!> ランダムウォーク猿「'因数分解' で はっぴー.」
program f902953
  use, intrinsic :: iso_fortran_env
  !> auto use module
  implicit none
  integer(int32) :: t
  integer(int32) :: i
  read(input_unit, *) t
  do i = 1, t
     call solve()
  end do
contains
  impure subroutine solve()
    integer(int64) :: d, x, y
    integer(int64) :: g, nx, ny
    read(input_unit, *) d, x, y
    if (x == 0) then
       write(output_unit, '(i0)') y * d
       return
    else if (y == 0) then
       write(output_unit, '(i0)') x * d
       return
    end if
    !> (nx, ny) == (y, -x) /g ベクトルは (x, y) ベクトルに垂直.
    g = gcd(x, y)
    nx =   y / g
    ny = - x / g
    if (nx < 0) then
       nx = - nx
       ny = - ny
    end if
    block
      !> (x, y)
      !> nx >= 0.
      !> x + t * nx <= d.
      integer(int64) :: ans
      integer(int64) :: bx, by
      ans = 0_int64
      associate(t => (d - x) / nx)
        !> x + t * nx <= d
        if (t > 0) then
           bx = x + t * nx
           by = y + t * ny
           if (0 <= by .and. by <= d) then
              ans = max(ans, t * (x ** 2 + y ** 2))
           end if
        end if
      end associate
      associate(t => x / nx)
        !> x - t * nx >= 0
        if (t > 0) then
           bx = x - t * nx
           by = y - t * ny
           if (0 <= by .and. by <= d) then
              ans = max(ans, t * (x ** 2 + y ** 2))
           end if
        end if
      end associate
      associate(t => (d - y) / abs(ny))
        if (ny > 0) then
           !> y + t * ny <= d
           if (t > 0) then
              bx = x + t * nx
              by = y + t * ny
              if (0 <= bx .and. bx <= d) then
                 ans = max(ans, t * (x ** 2 + y ** 2))
              end if
           end if
        else
           !> y + t * abs(ny) <= d
           if (t > 0) then
              bx = x - t * nx
              by = y + t * abs(ny)
              if (0 <= bx .and. bx <= d) then
                 ans = max(ans, t * (x ** 2 + y ** 2))
              end if
           end if
        end if
      end associate
      associate(t => y / abs(ny))
        if (ny > 0) then
           !> y - t * ny >= 0
           if (t > 0) then
              bx = x - t * nx
              by = y - t * ny
              if (0 <= bx .and. bx <= d) then
                 ans = max(ans, t * (x ** 2 + y ** 2))
              end if
           end if
        else
           !> y - t * abs(ny) >= d
           if (t > 0) then
              bx = x + t * nx
              by = y - t * abs(ny)
              if (0 <= bx .and. bx <= d) then
                 ans = max(ans, t * (x ** 2 + y ** 2))
              end if
           end if
        end if
      end associate
      write(output_unit, '(i0)') ans
    end block
  end subroutine solve
  pure integer(int64) function gcd(a, b) result(res)
    integer(int64), intent(in) :: a, b
    integer(int64) :: arr(1:2)
    arr(1:2) = [max(abs(a), abs(b)), min(abs(a), abs(b))]
    do while (arr(2) /= 0)
       arr(1:2) = [arr(2), mod(arr(1), arr(2))]
    end do
    res = arr(1)
  end function gcd
end program f902953
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX