19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"CodeViewer"] 1b:T60c,#include #include #include void colorSet(std::vector&, std::vector>&, std::vector&, int); int main(int argc, char* argv[]){ int T; scanf("%d", &T); for(int i = 0; i < T; i++){ int vertexCount, edgeCount; scanf("%d %d", &vertexCount, &edgeCount); std::vector> edge(vertexCount); std::vector vertex(vertexCount, false); for(int i = 0; i < edgeCount; i++){ int vertex[2]; scanf("%d %d", &vertex[0], &vertex[1]); vertex[0]--; vertex[1]--; edge[vertex[0]].emplace_back(vertex[1]); edge[vertex[1]].emplace_back(vertex[0]); } std::vector visited(vertexCount, false); for(int i = 0; i < vertexCount; i++){ if(!visited[i]){ colorSet(vertex, edge, visited, i); } } bool result = true; for(int i = 0; i < vertexCount; i++){ for(int v : edge[i]){ if(vertex[i] == vertex[v]){ result = false; break; } } } printf(result ? "YES" : "NO"); printf("\n"); } return 0; } void colorSet(std::vector& vertex, std::vector>& edge, std::vector& visited, int startVectex){ std::queue buffer; buffer.push(startVectex); while(!buffer.empty()){ int u = buffe

코드 #1050