QAQ! 的博客

参考博客 1354E - Graph Coloring[dpdpdp][01染色] 题意 总共有 nnn 个点，mmm 条边 要使得任意边 (u,v)(u, v)(u,v) 中 abs(cnt[u]−cnt[v])=1abs(cnt[u] - cnt[v]) = 1abs(cnt[u]−cnt[v])=1, cnt[i]cnt[i]cnt[i] 表示 iii 点的编号 每个点的编号为 1,2,31, 2, 31,2,3 其中一个 保证边没有重边且没有自环 且 111 的个数为 n1n1n1，222 的..

1325F - Ehab’s Last Theorem[思维+dfsdfsdfs树] time limit per test memory limit per test input output 1 seconds 256 megabytes standard input standard output Description: It’s the year 5555. Yo...

1325C - Ehab and Path-etic MEXs[最小环] time limit per test memory limit per test input output 1 seconds 256 megabytes standard input standard output Description: You are given a tree consis...

1325E - Ehab’s REAL Number Theory Problem[最小环] time limit per test memory limit per test input output 3 seconds 256 megabytes standard input standard output Description: You are given an a...