给定n个点, m条单向边 n<=1000, m <= 100000 有k个询问，询问x出去的所有边及其权值，如果有多条边，终点编号小的先输出，具体见样例 输入格式(Format Input) 第一行输入两个整数n和m，表示有n个点和m条边。 接下来输入m行，每行三个整数x y z，表示x到y有一条权值为z的单向边。…
题目描述(Description) You have probably heard of the game "Rock, Paper, Scissors". The cows like to play a similar game they call "Hoof, Paper, Scissors". The rules of "Hoof, Pape…