题目描述 给定一个 NN 个点,MM 条有向边的带非负权图,请你计算从 SS 出发,到每个点的距离. 数据保证你能从 SS 出发到任意点. 输入格式 第一行为三个正整数 N, M, SN,M,S. 第二行起 MM 行,每行三个非负整数 u_i, v_i, w_iu i ,v i ,w i ,表示从 u_iu i 到 v_iv i 有一条权值为 w_iw i 的边. 输出格式 输出一行 NN 个空格分隔的非负整数,表示 SS 到每个点的距离. 输入输出样例 输入 #1 复制…
题目描述 Farmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has been able to narrow down the list of features shared by his cows to a list of only K different features (1 ≤ K ≤ 30). For example, cows exhibiting feature #1 might h…
P2326 AKN’s PPAP 题目描述 “I have a pen,I have an apple.Eh,Apple-Pen!. I have a pen,I have pineapple.En,Pineapple-Pen! Apple-Pen,Pineapple-Pen.Eh,Pen-Pineapple-Apple-Pen!” Akn最近中毒于一首音乐,于是他买来了一堆苹果来学习这首音乐.Akn发现,只要边唱这首歌,边做把两个完整的苹果碰在一起的动作,两个苹果就会融合成一个新的大苹果,但是…