Haipai1998的博客

E. Strictly Positive Matrixtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have matrix a of size n × n. Let's number the rows of the matrix fro...

B. Strongly Connected Citytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputImagine a city with n horizontal streets crossing m vertical streets, fo...

C. Checkposts time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Your city has n junctions. There are m one-wa

E. Reachability from the Capital题意:一张有向图,现在要求从S出发能到所有点,问至少加几条边思路:强联通缩点后,判断入度为0的块有几个,S除外#include<bits/stdc++.h> #define PI acos(-1.0) #define pb push_back #define F first #define S second using n...

E. We Need More Bosses 题意: 求一个无向图缩点后,求直径长度 注意无向图强连通和有向图强连通是有区别的，主要是无向图强连通不能回头，要求在tarjan算法里记录father #include<bits/stdc++.h> #define PI acos(-1.0) #define pb push_back #define F first #define ...