結果

問題 No.2623 Room Allocation
ユーザー katonyonkokatonyonko
提出日時 2024-02-09 22:13:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 345 ms / 2,000 ms
コード長 1,592 bytes
コンパイル時間 334 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 131,816 KB
最終ジャッジ日時 2024-09-28 15:29:09
合計ジャッジ時間 5,036 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
6 1 2
1 A
2 B
3 B
3 A
2 B
1 A
9 100 0
1 B
2 B
3 B
4 B
5 B
6 B
7 B
8 B
9 B
8 2 2
1 B
9 A
7 A
7 B
5 A
8 B
4 B
8 A
"""
def input():
return sys.stdin.readline()[:-1]
def solve(test):
N,X,Y=map(int, input().split())
score=[[0]*3 for _ in range(X+Y)]
for i in range(N):
P,c=input().split()
P=int(P)
if c=='A':
score[i%(X+Y)][0]+=P
score[i%(X+Y)][1]+=P
else:
score[i%(X+Y)][0]-=P
score[i%(X+Y)][2]+=P
score.sort(key=lambda x: -x[0])
ans=0
for i in range(X+Y):
if i<X:
ans+=score[i][1]
else:
ans+=score[i][2]
print(ans)
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:1:2:
main(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0