摘要："洛咕" 题意:给你一张$r c$的地图，有’S’,’X’,’.’三种地形，所有判定相邻与行走都是四连通的.我们设’X’为陆地，一个’X’连通块为一个岛屿，’S’为浅水，’.’为深水。刚开始你可以降落在任一一块陆地上，在陆地上可以行走，在浅水里可以游泳。并且陆地和浅水之间可以相互通行.但无论如何都不 阅读全文

摘要："洛咕" 给定一张$n$个点$m$条边的无向图,求两对点($s_1,t_1,s_2,t_2$)间最短路的最长公共路径.$nv$的有向边,$bj[i]$标记第i条边是否在最短路的公共路径上. cpp include include include include include include inc 阅读全文

摘要：洛咕 题意:小A的工作不仅繁琐，更有苛刻的规定，要求小A每天早上在$6：00$之前到达公司，否则这个月工资清零.可是小A偏偏又有赖床的坏毛病。于是为了保住自己的工资，小A买了一个十分牛B的空间跑路器，每秒钟可以跑$2^k$千米（$k$是任意自然数）.当然，这个机器是用$longint$存的，所以总跑 阅读全文

摘要："洛咕" 题意:ESQMS森林间有N个小树丛，M条小径，每条小径都是单向的，连接两个小树丛，上面都有一定数量的蘑菇.小胖和ZYR经过某条小径一次，可以采走这条路上所有的蘑菇.由于ESQMS森林是一片神奇的沃土，所以一条路上的蘑菇被采过后，又会长出一些新的蘑菇，数量为原来蘑菇的数量乘上这条路的“恢复系 阅读全文

摘要："POJ" "洛咕" 题意:给出一张$m(m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1 阅读全文

摘要："洛咕" 题意:农民约翰的农场有一套老旧的管网，管网由M条管道(1 include include include include include include include define ll long long using namespace std; inline int read(){ 阅读全文

摘要："洛咕" 题意:有$n$个城市,$m$条花费为0的单向路,$k$条给定花费的单向路(如果当前手头没有这么多钱,可以用以后赚到的钱来支付),在每个城市可获得$val$的利润(往返次数没有限制,下次再走到这个城市,仍可以获得val的利润).给定起点$S$,可以选择在任何时候，在任何城市结算利润,求最大可 阅读全文

摘要："POJ" 题意:给定n个点m条边的无向图,求最小环并输出方案.最小环:至少包含3个节点,环上的节点不重复且长度之和最小.$n include include include include include include include define ll long long using name 阅读全文

摘要："洛咕" 题意:有n个点,m条无向边(权值非负),k条有向边(权值可能为负数),给定起点s,求出s点到每个点的最短路径长度.$n include include include include include include include define ll long long using nam 阅读全文

摘要："洛咕" 题意:给定n个点m条边(有些单向,有些双向)的图,每个节点都有一个权值$w[i]$,找出一条从1到n的路径,使得路径上能够找出两个点$p,q$(先经过p再经过q),并且"节点q的权值减去节点p的权值"最大. 分析:在正向图上从1开始跑$spfa$,求出$dis1[i]$表示从节点1到节点i 阅读全文

摘要："洛咕" 题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char ch 阅读全文

摘要："洛咕" 给定n个点和m条有向边,$n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;ch 阅读全文

摘要："洛咕" 一句话题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char 阅读全文

摘要："洛咕" 题意:$N(N include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char ch=g 阅读全文

摘要："洛咕" 题意:如图一个$n m(n,m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;c 阅读全文

摘要："洛咕" 题意:Siruseri 城中的道路都是单向的。$M$条道路由$N(N,M include include include include include include include define ll long long using namespace std; inline int 阅读全文

摘要："洛咕" 题意:约翰有n块草场，编号1到n，这些草场由m条单行道相连.贝西总是从1号草场出发，最后回到1号草场.她想经过尽可能多的草场，贝西在通一个草场只吃一次草，所以一个草场可以经过多次.因为草场是单行道连接，这给贝西的品鉴工作带来了很大的不便，贝西想偷偷逆向行走一次，但最多只能有一次逆行.问，贝 阅读全文

该文被密码保护。

该文被密码保护。