Complete Tripartite CodeForces - 1228D（三分图染色）
You have a simple undirected graph consisting of nn vertices and mm edges. The graph doesn’t contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnect...
