【Codeforces Round #403】Codeforces 781D Axel and Marston in Bitland
来源:互联网 发布:淘宝店哪家衣服质量好 编辑:程序博客网 时间:2024/06/07 12:27
A couple of friends, Axel and Marston are travelling across the
country of Bitland. There are n towns in Bitland, with some pairs of
towns connected by one-directional roads. Each road in Bitland is
either a pedestrian road or a bike road. There can be multiple roads
between any pair of towns, and may even be a road from a town to
itself. However, no pair of roads shares the starting and the
destination towns along with their types simultaneously.The friends are now located in the town 1 and are planning the travel
route. Axel enjoys walking, while Marston prefers biking. In order to
choose a route diverse and equally interesting for both friends, they
have agreed upon the following procedure for choosing the road types
during the travel:The route starts with a pedestrian route.Suppose that a beginning of the route is written in a string s of letters P (pedestrain road) and B (biking road). Then, the string is
appended to s, where stands for the string s with each character
changed to opposite (that is, all pedestrian roads changed to bike
roads, and vice versa).In the first few steps the route will look as follows: P, PB, PBBP,
PBBPBPPB, PBBPBPPBBPPBPBBP, and so on.After that the friends start travelling from the town 1 via Bitlandian
roads, choosing the next road according to the next character of their
route type each time. If it is impossible to choose the next road, the
friends terminate their travel and fly home instead.Help the friends to find the longest possible route that can be
travelled along roads of Bitland according to the road types choosing
procedure described above. If there is such a route with more than
1018 roads in it, print -1 instead. InputThe first line contains two integers n and m (1 ≤ n ≤ 500,
0 ≤ m ≤ 2n2) — the number of towns and roads in Bitland respectively.Next m lines describe the roads. i-th of these lines contains three
integers vi, ui and ti (1 ≤ vi, ui ≤ n, 0 ≤ ti ≤ 1), where vi and ui
denote start and destination towns indices of the i-th road, and ti
decribes the type of i-th road (0 for a pedestrian road, 1 for a bike
road). It is guaranteed that for each pair of distinct indices i, j
such that 1 ≤ i, j ≤ m, either vi ≠ vj, or ui ≠ uj, or ti ≠ tj holds.
OutputIf it is possible to find a route with length strictly greater than
1018, print -1. Otherwise, print the maximum length of a suitable
path.
可以发现这样的规律:如果是从头开始,或者之前只走了超过
这样就可以倍增了,
因为转移是
#include<cstdio>#include<cstring>#include<bitset>#include<algorithm>using namespace std;#define LL long longbitset<510> f[510][65][2],now,tem;int n,m;int main(){ int u,v,x,cur; LL ans=0; scanf("%d%d",&n,&m); for (int i=1;i<=m;i++) { scanf("%d%d%d",&u,&v,&x); u--; v--; f[u][0][x][v]=1; } for (int k=1;k<=60;k++) for (int i=0;i<n;i++) for (int p=0;p<2;p++) for (int j=0;j<n;j++) if (f[i][k-1][p][j]) f[i][k][p]|=f[j][k-1][p^1]; now[0]=1; cur=0; for (int k=60;k>=0;k--) { tem.reset(); for (int i=0;i<n;i++) if (now[i]) tem|=f[i][k][cur]; if (tem.count()) { ans+=1LL<<k; now=tem; cur^=1; } } if (ans>1e18) printf("-1\n"); else printf("%I64d\n",ans);}
- Codeforces Round #403 D. Axel and Marston in Bitland
- 【Codeforces Round #403】Codeforces 781D Axel and Marston in Bitland
- codeforces 781 D. Axel and Marston in Bitland (DP+bitset)
- [Codeforces781D]Axel and Marston in Bitland(DP+bitset)
- D. Dreamoon and Sets(Codeforces Round #272)
- Codeforces Round #290 D. Fox And Jumping
- Codeforces Round #318-(D. Bear and Blocks)
- Codeforces Round #318 D. Bear and Blocks
- Codeforces Round #318 D. Bear and Blocks
- Codeforces Round #324 D Dima and Lisa
- D. Dreamoon and Sets(Codeforces Round #272)
- Codeforces Round 371 D Animals and Puzzle
- CodeForces Round 718D - Andrew and Chemistry
- Codeforces Round #399:D. Jon and Orbs
- Codeforces Round #404 D. Anton and School
- Codeforces Round #404 D. Anton and School
- 【Codeforces Round #403】Codeforces 781A Andryusha and Colored Balloons
- Codeforces Round #447 (Div. 2) D. Ralph And His Tour in Binary Country
- 理解MP算法
- 北京传智播客最后一期Net就业
- PAT-A1090
- another app is currently holding the yum lock;waiting for it to exit
- 313. Super Ugly Number
- 【Codeforces Round #403】Codeforces 781D Axel and Marston in Bitland
- 一些有用的bash命令记录汇总
- Android:控件AutoCompleteTextView 自动提示
- SpringMVC + MyBatis + Mysql + Redis(作为二级缓存) 配置
- vc p2p demo
- 洛谷P1144 最短路计数(spfa)
- 使用Vue框架实现NGA客户端
- 【JZOJ 3623】【SDOI2014】数表
- uva/6-12 572