推广网站最有效方法_页面效果设计_网络推广平台代理_开网站怎么开

题一、移动（100）

# 3 2
# 1 1 ffrrbbll
# 3 3 frbln, k = map(int, input().split())dirs = {'f':[0,1], 'b':[0,-1], 'l':[-1,0], 'r':[1,0]}
def move(x, y, opt):dx, dy = dirs[opt]if 1 <= x+dx <= n:x = x+dxif 1 <= y+dy <= n:y = y+dyreturn x, yfor _ in range(k):split_strs = input().split()x, y = int(split_strs[0]), int(split_strs[1])opts = split_strs[2]for opt in opts:x, y = move(x, y, opt)print(x, y)

题二、梦境巡查（100）

# 3
# 5 5 5 5
# 0 100 0# 5 5 -95 5# -5 -5 95 -5n = int(input())
a_arr = list(map(int, input().split()))
b_arr = list(map(int, input().split()))b_arr.insert(0, 0)
n += 1
line_arr = []acc = 0
for i in range(n):cur_delta = b_arr[i] - a_arr[i]acc += cur_deltaline_arr.append(acc)left_min, right_min = [0]*n, [0]*n
left_min[0], right_min[-1] = line_arr[0], line_arr[-1]
for i in range(1, n):j = n-1-ileft_min[i] = min(left_min[i-1], line_arr[i])right_min[j] = min(right_min[j+1], line_arr[j])ans = []
for i in range(1, n):ans.append(-min(left_min[i-1], right_min[i] - b_arr[i]))print(" ".join(map(str, ans)))

题三、缓存模拟（100）

# 4 8 8
# 0 0
# 0 1
# 1 2
# 0 1
# 1 0
# 0 32
# 1 33
# 0 34class ListNode:def __init__(self, val, next=None, pre=None, changed=False):self.val, self.next, self.pre, self.changed = val, next, pre, changedclass LRU:def __init__(self, max_size):self.nodes_map = {}self.head, self.tail = ListNode(-1), ListNode(-1)self.head.next = self.tailself.tail.pre = self.headself.max_size = max_sizeself.cur_size = 0def remove(self, node: ListNode):node_pre, node_next = node.pre, node.nextnode_pre.next = node_nextnode_next.pre = node_predef insert_to_head(self, node: ListNode):node_pre, node_next = self.head, self.head.nextnode_pre.next = nodenode.pre = node_prenode_next.pre = nodenode.next = node_nextdef move_to_head(self, node: ListNode):self.remove(node)self.insert_to_head(node)def remove_last(self):res = []node = self.tail.premem_idx = node.valself.nodes_map.pop(mem_idx)self.remove(node)self.cur_size -= 1if node.changed:res.append([1, mem_idx])return resdef create_one(self, mem_idx: int):res = []node = ListNode(mem_idx)self.nodes_map[mem_idx] = nodeself.insert_to_head(node)self.cur_size += 1if self.cur_size > self.max_size:res.extend(self.remove_last())res.append([0, mem_idx])return resdef read(self, mem_idx):if mem_idx in self.nodes_map:node = self.nodes_map[mem_idx]self.move_to_head(node)return []else:return self.create_one(mem_idx)def write(self, mem_idx):res = []if mem_idx not in self.nodes_map:res.extend(self.create_one(mem_idx))else:self.move_to_head(self.nodes_map[mem_idx])self.nodes_map[mem_idx].changed = Truereturn resn, N, q = map(int, input().split())
caches = [LRU(n) for _ in range(N)]ans = []
for _ in range(q):opt, mem_idx = map(int, input().split())group_idx = (mem_idx // n) % Ncache = caches[group_idx]if opt == 0:res = cache.read(mem_idx)for r in res:ans.append(f"{r[0]} {r[1]}")else:res = cache.write(mem_idx)for r in res:ans.append(f"{r[0]} {r[1]}")print("\n".join(ans))

题四、跳房子（0）

from math import inf
from typing import Setn = int(input())
a_arr = list(map(int, input().split()))
k_arr = list(map(int, input().split()))# 5
# 0 1 2 3 0
# 3 4 4 10 15# 10
# 0 1 1 1 1 3 1 0 3 0
# 2 4 5 4 1 4 1 3 5 3left, right = 0, n - 1def dfs(pos, visited: Set, remain: int) -> bool:if remain == 0 or pos == n-1:return pos == n-1visited.add(pos)next_range = k_arr[pos]for d_pos in range(1, next_range + 1):x = pos+d_posnext_pos = x - a_arr[x]if next_pos not in visited and dfs(next_pos, visited, remain-1):return Truereturn Falseif dfs(0, set(), left):print(left)
else:while left<right:mid = (left+right+1) // 2if dfs(0, set(), mid):right = mid-1else:left = midif left == n-1:print(-1)else:print(left+1)

题五、梦魔（30）

from copy import deepcopy# 6
# 4 9 3 1 7 7
# 4 2 1 3 1 4
# 2
# 2
# 3 8 1
# 5 4 3
# 0n = int(input())
a_arr_origin = list(map(int, input().split()))
b_arr_origin = list(map(int, input().split()))q = int(input())
for _ in range(q):a_arr = deepcopy(a_arr_origin)b_arr = deepcopy(b_arr_origin)k = int(input())for _ in range(k):i, new_a, new_b = map(int, input().split())i -= 1a_arr[i] = new_ab_arr[i] = new_bleft_max, right_max = [0]*n, [0]*nleft_max[0] = a_arr[0]right_max[-1] = a_arr[-1]for j in range(1,n):j_ = n-1-jleft_max[j] = max(left_max[j-1], a_arr[j])right_max[j_] = max(right_max[j_+1], a_arr[j])p_ans = 0p_list = []for i in range(1,n):l, r = i-1, icur_val = 0p = 0while l>=0 or r<n:if (l<0 or cur_val>=left_max[l]) and (r>=n or cur_val>=right_max[r]):breakif l<0 or r>=n:if l<0:p = max(p, a_arr[r] - cur_val)cur_val += b_arr[r]r += 1else:p = max(p, a_arr[l] - cur_val)cur_val += b_arr[l]l -= 1else:if a_arr[l]<=a_arr[r]:p = max(p, a_arr[l] - cur_val)cur_val += b_arr[l]l -= 1else:p = max(p, a_arr[r] - cur_val)cur_val += b_arr[r]r += 1p_list.append(p)p_ans ^= pprint(p_ans)# print(p_list)