# coding: utf-8
# inputの代わり(テストコード)
from paiza import ImportCase
p = ImportCase.auto_input("amidatest.txt")
# initialize the vector of amidakuji
input_lines = p.__next__()
input_lines = list(map(int, input_lines.split(" ")))
amida_list = [["0" for i in range(input_lines[0] + 1)]
for j in range(input_lines[1])]
lengthOfline = input_lines[0]
numOfvline = input_lines[1]
numOfhline = input_lines[2]
# あみだくじ作成
for i in range(numOfhline):
input_lines = p.__next__()
input_lines = list(map(int, input_lines.split(" ")))
row = input_lines[0] - 1
col = input_lines[1]
val = input_lines[2]
amida_list[row][col] = val
amida_list[row + 1][val] = -col
# search for the answer
for p in range(numOfvline):
row_p = p
col_p = 1
from paiza import ImportCase
from collections import OrderedDict
p = ImportCase.auto_input("PlanWeather.txt")
def arrange_line(line):
return list(map(int, line.split(" ")))
input_lines = arrange_line(p.__next__())
numHoliday = input_lines[0]
numTrip = input_lines[1]
ProbDict = OrderedDict()
numloop = numHoliday - numTrip + 1
for i in range(numHoliday):
input_lines = arrange_line(p.__next__())
ProbDict[input_lines[0]] = input_lines[1]
Prob_i = min(ProbDict.keys())
ans = Prob_i
max_sum = numTrip * 100
for i in range(numloop):
Prosum = 0
for ii in range(Prob_i, Prob_i + numTrip):
Prosum += ProbDict[ii]
if max_sum > Prosum:
max_sum = Prosum
ans = Prob_i
# coding: utf-8
# inputの代わり(テストコード)
from paiza import ImportCase
p = ImportCase.auto_input("amidatest.txt")
# initialize the vector of amidakuji
input_lines = p.__next__()
input_lines = list(map(int, input_lines.split(" ")))
amida_list = [["0" for i in range(input_lines[0]+1)] for j in range(input_lines[1])]
lengthOfline = input_lines[0]
numOfvline = input_lines[1]
numOfhline = input_lines[2]
# あみだくじ作成
for i in range(numOfhline):
input_lines = p.__next__()
input_lines = list(map(int, input_lines.split(" ")))
row = input_lines[0] - 1
col = input_lines[1]
val = input_lines[2]
amida_list[row][col] = val
amida_list[row+1][val] = -col
# search for the answer
for p in range(numOfvline):
row_p = p
col_p = 1
# とりあえずクラスを用いて実装すべきでした。
# inputの代わり(テストコード)
from paiza import ImportCase
p = ImportCase.auto_input("otimono2.txt")
input_lines = p.__next__()
input_lines = list(map(int, input_lines.split(" ")))
fields = []
for y in range(input_lines[0]):
fields.append(["." for x in range(input_lines[1])])
numRow = input_lines[0]
numCol = input_lines[1]
numLoop = input_lines[2]
def searchRow(StartPos, Putpos):
# 行の走査
while StartPos < numRow - 1:
if fields[StartPos][putPos] == "#":
StartPos -= 1
break
StartPos += 1
for x in range(colPos):
if fields[StartPos][putPos + x] == "#":
searchRow(StartPos)
return StartPos
from paiza import ImportCase
from collections import OrderedDict
p = ImportCase.auto_input("PlanWeather.txt")
def arrange_line(line):
return list(map(int, line.split(" ")))
input_lines = arrange_line(p.__next__())
numHoliday = input_lines[0]
numTrip = input_lines[1]
ProbDict = OrderedDict()
numloop = numHoliday - numTrip + 1
for i in range(numHoliday):
input_lines = arrange_line(p.__next__())
ProbDict[input_lines[0]] = input_lines[1]
Prob_i = min(ProbDict.keys())
ans = Prob_i
max_sum = numTrip * 100
for i in range(numloop):
Prosum = 0
for ii in range(Prob_i, Prob_i + numTrip):
Prosum += ProbDict[ii]
if max_sum > Prosum:
max_sum = Prosum
ans = Prob_i
