結果
問題 | No.5011 Better Mo's Algorithm is Needed!! (Weighted) |
ユーザー | titia |
提出日時 | 2022-12-17 04:00:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,928 ms / 5,000 ms |
コード長 | 2,091 bytes |
コンパイル時間 | 1,217 ms |
実行使用メモリ | 270,124 KB |
スコア | 35,882,947,933 |
最終ジャッジ日時 | 2022-12-17 04:10:46 |
合計ジャッジ時間 | 634,653 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4,895 ms
264,444 KB |
testcase_01 | AC | 4,856 ms
262,060 KB |
testcase_02 | AC | 4,862 ms
263,764 KB |
testcase_03 | AC | 4,863 ms
264,964 KB |
testcase_04 | AC | 4,869 ms
261,152 KB |
testcase_05 | AC | 4,858 ms
258,572 KB |
testcase_06 | AC | 4,861 ms
263,176 KB |
testcase_07 | AC | 4,866 ms
258,896 KB |
testcase_08 | AC | 4,861 ms
263,144 KB |
testcase_09 | AC | 4,870 ms
264,532 KB |
testcase_10 | AC | 4,867 ms
262,332 KB |
testcase_11 | AC | 4,858 ms
263,760 KB |
testcase_12 | AC | 4,861 ms
262,084 KB |
testcase_13 | AC | 4,860 ms
259,412 KB |
testcase_14 | AC | 4,858 ms
261,024 KB |
testcase_15 | AC | 4,860 ms
264,616 KB |
testcase_16 | AC | 4,855 ms
263,552 KB |
testcase_17 | AC | 4,857 ms
264,072 KB |
testcase_18 | AC | 4,869 ms
261,344 KB |
testcase_19 | AC | 4,865 ms
261,456 KB |
testcase_20 | AC | 4,871 ms
259,788 KB |
testcase_21 | AC | 4,862 ms
265,520 KB |
testcase_22 | AC | 4,859 ms
262,472 KB |
testcase_23 | AC | 4,859 ms
265,180 KB |
testcase_24 | AC | 4,857 ms
265,932 KB |
testcase_25 | AC | 4,869 ms
264,768 KB |
testcase_26 | AC | 4,888 ms
260,588 KB |
testcase_27 | AC | 4,855 ms
263,836 KB |
testcase_28 | AC | 4,859 ms
260,696 KB |
testcase_29 | AC | 4,856 ms
265,064 KB |
testcase_30 | AC | 4,859 ms
265,264 KB |
testcase_31 | AC | 4,881 ms
264,308 KB |
testcase_32 | AC | 4,848 ms
264,048 KB |
testcase_33 | AC | 4,846 ms
264,752 KB |
testcase_34 | AC | 4,850 ms
264,716 KB |
testcase_35 | AC | 4,849 ms
264,536 KB |
testcase_36 | AC | 4,846 ms
266,076 KB |
testcase_37 | AC | 4,852 ms
263,820 KB |
testcase_38 | AC | 4,849 ms
264,720 KB |
testcase_39 | AC | 4,848 ms
266,836 KB |
testcase_40 | AC | 4,846 ms
263,416 KB |
testcase_41 | AC | 4,849 ms
267,432 KB |
testcase_42 | AC | 4,852 ms
265,112 KB |
testcase_43 | AC | 4,850 ms
262,468 KB |
testcase_44 | AC | 4,845 ms
260,160 KB |
testcase_45 | AC | 4,846 ms
266,872 KB |
testcase_46 | AC | 4,842 ms
264,584 KB |
testcase_47 | AC | 4,850 ms
265,220 KB |
testcase_48 | AC | 4,848 ms
265,476 KB |
testcase_49 | AC | 4,860 ms
263,312 KB |
testcase_50 | AC | 4,855 ms
264,600 KB |
testcase_51 | AC | 4,850 ms
263,796 KB |
testcase_52 | AC | 4,842 ms
265,108 KB |
testcase_53 | AC | 4,850 ms
266,304 KB |
testcase_54 | AC | 4,844 ms
269,620 KB |
testcase_55 | AC | 4,852 ms
263,248 KB |
testcase_56 | AC | 4,928 ms
270,124 KB |
testcase_57 | AC | 4,857 ms
266,688 KB |
testcase_58 | AC | 4,849 ms
265,192 KB |
testcase_59 | AC | 4,850 ms
265,568 KB |
testcase_60 | AC | 4,844 ms
266,964 KB |
testcase_61 | AC | 4,851 ms
263,256 KB |
testcase_62 | AC | 4,854 ms
268,060 KB |
testcase_63 | AC | 4,844 ms
264,704 KB |
testcase_64 | AC | 4,858 ms
265,860 KB |
testcase_65 | AC | 4,850 ms
267,512 KB |
testcase_66 | AC | 4,845 ms
266,088 KB |
testcase_67 | AC | 4,853 ms
266,036 KB |
testcase_68 | AC | 4,850 ms
264,744 KB |
testcase_69 | AC | 4,862 ms
263,436 KB |
testcase_70 | AC | 4,862 ms
266,860 KB |
testcase_71 | AC | 4,855 ms
266,964 KB |
testcase_72 | AC | 4,849 ms
267,080 KB |
testcase_73 | AC | 4,851 ms
264,472 KB |
testcase_74 | AC | 4,857 ms
263,612 KB |
testcase_75 | AC | 4,853 ms
266,484 KB |
testcase_76 | AC | 4,841 ms
265,668 KB |
testcase_77 | AC | 4,853 ms
263,388 KB |
testcase_78 | AC | 4,853 ms
268,844 KB |
testcase_79 | AC | 4,846 ms
264,396 KB |
testcase_80 | AC | 4,848 ms
266,112 KB |
testcase_81 | AC | 4,861 ms
263,708 KB |
testcase_82 | AC | 4,852 ms
264,564 KB |
testcase_83 | AC | 4,843 ms
264,860 KB |
testcase_84 | AC | 4,845 ms
265,424 KB |
testcase_85 | AC | 4,845 ms
266,520 KB |
testcase_86 | AC | 4,842 ms
265,788 KB |
testcase_87 | AC | 4,852 ms
265,796 KB |
testcase_88 | AC | 4,862 ms
264,816 KB |
testcase_89 | AC | 4,856 ms
265,608 KB |
testcase_90 | AC | 4,856 ms
265,164 KB |
testcase_91 | AC | 4,845 ms
265,628 KB |
testcase_92 | AC | 4,849 ms
263,996 KB |
testcase_93 | AC | 4,845 ms
265,080 KB |
testcase_94 | AC | 4,857 ms
262,092 KB |
testcase_95 | AC | 4,845 ms
262,920 KB |
testcase_96 | AC | 4,859 ms
264,560 KB |
testcase_97 | AC | 4,845 ms
263,700 KB |
testcase_98 | AC | 4,846 ms
264,932 KB |
testcase_99 | AC | 4,846 ms
267,488 KB |
testcase_100 | AC | 4,846 ms
265,160 KB |
testcase_101 | AC | 4,852 ms
265,336 KB |
testcase_102 | AC | 4,847 ms
263,480 KB |
testcase_103 | AC | 4,854 ms
263,936 KB |
testcase_104 | AC | 4,854 ms
263,636 KB |
testcase_105 | AC | 4,845 ms
265,996 KB |
testcase_106 | AC | 4,854 ms
263,764 KB |
testcase_107 | AC | 4,846 ms
262,728 KB |
testcase_108 | AC | 4,858 ms
264,268 KB |
testcase_109 | AC | 4,854 ms
262,844 KB |
testcase_110 | AC | 4,853 ms
265,772 KB |
testcase_111 | AC | 4,847 ms
264,436 KB |
testcase_112 | AC | 4,856 ms
263,044 KB |
testcase_113 | AC | 4,847 ms
264,592 KB |
testcase_114 | AC | 4,847 ms
265,404 KB |
testcase_115 | AC | 4,855 ms
264,180 KB |
testcase_116 | AC | 4,856 ms
264,204 KB |
testcase_117 | AC | 4,854 ms
267,376 KB |
testcase_118 | AC | 4,856 ms
264,012 KB |
testcase_119 | AC | 4,842 ms
261,776 KB |
ソースコード
import sys input = sys.stdin.readline from operator import itemgetter import time from random import randint time0=time.time() def score(x,y): if x==-1: a,b,_=LR[y-1] return SUM[b]-SUM[a-1] else: a,b,_=LR[y-1] c,d,_=LR[x-1] a2,b2=min(a,c),max(a,c) c2,d2=min(b,d),max(b,d) return SUM[b2-1]-SUM[a2-1]+SUM[d2]-SUM[c2] def score_reverse(x,y): sc=0 if x==0: a=ANS[x] b=ANS[y] c=ANS[y+1] sc-=score(-1,a)+score(a,b)+score(b,c) sc+=score(-1,b)+score(b,a)+score(a,c) return sc if y==len(ANS)-1: a=ANS[x-1] b=ANS[x] c=ANS[y] sc-=score(a,b)+score(b,c) sc+=score(a,c)+score(c,b) return sc a=ANS[x-1] b=ANS[x] c=ANS[y] d=ANS[y+1] sc-=score(a,b)+score(b,c)+score(c,d) sc+=score(a,c)+score(c,b)+score(b,d) return sc def last_score(ANS): sc=0 for i in range(len(ANS)): if i==0: sc+=score(-1,ANS[0]) else: sc+=score(ANS[i-1],ANS[i]) return sc N,Q,WT,ST=map(int,input().split()) W=list(map(int,input().split())) LR=[list(map(int,input().split()))+[i+1] for i in range(Q)] LR2=sorted(LR,key=itemgetter(0)) SUM=[0] for w in W: SUM.append(SUM[-1]+w) def initial_ans(interval): LIST=[[] for i in range(1000)] for x,y,ind in LR2: LIST[x//interval].append((y,ind)) ANS=[] count=0 for i in range(1000): if LIST[i]==[]: continue if count%2==0: LIST[i].sort(key=itemgetter(0)) else: LIST[i].sort(key=itemgetter(0),reverse=True) for _,ind in LIST[i]: ANS.append(ind) count+=1 return ANS MIN=1<<60 MININD=0 LANS=[] for i in range(520,570,5): ANS=initial_ans(i) x=last_score(ANS) if x<MIN: MIN=x LANS=ANS MININD=i ANS=LANS while time.time()-time0<4.7: k=randint(0,len(ANS)-2) if score_reverse(k,k+1)<0: ANS[k],ANS[k+1]=ANS[k+1],ANS[k] print(*ANS)