lokiii

摘要： 很有意思的题，~~所以还是截lyddalao的课件~~ cpp include include include using namespace std; const int N=6005; int T,n,f[N],s[N]; long long ans; struct qwe { int u,v, 阅读全文

摘要： 想象成一层一层的染，所以相邻的两个格子连边，边权同色为0异色为1，然后答案就是某个格子到距离它最远得黑格子的最短距离的最小值 注意特判掉不需要染色的情况 cpp include include include include using namespace std; const int N=55,i 阅读全文