ujn20161222的博客

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49372 Accepted: 15184DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to roo...

注意边界https://vjudge.net/problem/UVA-1018#include<iostream>#include<cstdio>#include<cstring>#include<vector>#include<algorithm>#include<fstream> using namespace...

#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N=105;char map[N][N];struct AA{ int x,y; AA(int xx=-1,int yy=-1):x(xx),y(yy){} inline bool...

https://vjudge.net/problem/UVA-793#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N=5e5+10;int set[N];int set_find(int x){ if(set[x]==-1)retu...

Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 38587 Accepted: 18391DescriptionThere are so many different religions in the world today that it is difficult to keep trac...

https://vjudge.net/problem/UVA-10158#include<cstring> #include <iostream> #include<algorithm> #include<string> #include<sstream> #include<vector>#inclu...

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 33197 Accepted: 13801DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set ...

https://vjudge.net/problem/UVA-10608#include<cstring> #include <iostream> #include<algorithm> #include<string> #include<sstream> #include<vector>using ...

#include<iostream>#include<cstdio>#include<algorithm>#include<string>#include<cstring>#include<vector>#include<map>#include<list> const

作为根的，flag是0，别的根据这一点确定The court of King Xeon 2.4 is plagued with intrigue and conspiracy. A document recently discovered by the King's Secret Service is thought to be part of some mischievous sc...