結果
問題 | No.43 野球の試合 |
ユーザー |
![]() |
提出日時 | 2017-01-29 03:36:39 |
言語 | Fortran (gFortran 14.2.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,812 bytes |
コンパイル時間 | 547 ms |
コンパイル使用メモリ | 36,384 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-23 22:40:57 |
合計ジャッジ時間 | 1,643 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 RE * 2 |
other | AC * 3 WA * 3 RE * 1 |
ソースコード
program mainimplicit noneinteger::N,i,j,tmp,winnum,num,minnumcharacter::ccharacter*6::S(6)integer*8,allocatable::games(:,:)integer*8,parameter::win=2,lose=0,self=9, none=1type gameinteger::a,bend type gametype(game)::yet(10)yet(:)%a=0yet(:)%b=0read *,Nallocate(games(1:N,1:N))read *,S(1:N)(1:N)do i=1,Ngames(i,i) = selfdo j=i+1,Nc = S(i)(j:j)if(c.eq.'o') thengames(i,j) = wingames(j,i) = loseelse if(c.eq.'x') thengames(i,j) = losegames(j,i) = winelsegames(i,j) = nonegames(j,i) = noneend ifend doend dodo j=2, Nif(games(1,j).eq.none) thengames(1,j) = wingames(j,1) = loseend ifend dowinnum = COUNT(games(1,:).eq.win)do i=2, Ntmp = COUNT(games(i,:).eq.win)if(winnum.gt.tmp) thendo j=3, Nif(games(i,j).eq.none) thengames(i,j) = wingames(j,i) = loseend ifend doend ifend donum = 0do i=1, Ndo j=i+1, Nif(games(i,j).eq.none) thennum = num + 1yet(num)%a = iyet(num)%b = jend ifend doend dominnum = Ndo i=0, 2**num-1do j=0, num-1if(btest(i, j).eqv..true.) thengames(yet(j)%a,yet(j)%b) = wingames(yet(j)%b,yet(j)%a) = loseend ifend dominnum = MIN(minnum, get_grade())end doprint '(i0)', minnumcontainsfunction get_grade() result(w)integer::i,j,winteger::totalwin(num)do i=1,Ntotalwin(i) = COUNT(games(i,:).eq.win)end dow = COUNT(totalwin(2:N).gt.totalwin(1)) + 1end function get_gradeend program main