一开始开了个超大的图bool G[10010][10010]结果内存超限了。
后面把它改成了vector<vector > G;发现最后两个点超时:
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
vector<vector<bool> > G;
unordered_map<int,vector<int> > colorToV;
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0;i < n;i++){
vector<bool> temp;
G.push_back(temp);
for(int j = 0;j < n;j++)
G[i].push_back(false);
}
for(int i = 0;i < m;i++){
int u,v;
scanf("%d%d",&u,&v);
G[u][v] = G[v][u] = true;
}
int k;
scanf("%d",&k);
for(int i = 0;i < k;i++){
colorToV.clear();
for(int j = 0;j < n;j++){
int color;
scanf("%d",&color);
colorToV[color].push_back(j);
}
bool kColor = true;
unordered_map<int,vector<int> >::iterator it = colorToV.begin();
while(kColor == true && it != colorToV.end()){
if(it->second.size() != 1){
for(int j = 0;j < it->second.size() - 1;j++){
for(int t = j + 1;t < it->second.size();t++){
if(G[it->second[t]][it->second[j]] == true){
kColor = false;
break;
}
}
if(kColor == false)
break;
}
if(kColor == false)
break;
}
it++;
}
if(kColor == true)
printf("%d-coloring\n",colorToV.size());
else
printf("No\n");
}
system("pause");
return 0;
}
之后看了别人的,发现可以枚举每个边,看每个边两边的点颜色是否相同,死了呀,我这么菜复试可咋办。
下面是AC代码:
#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
struct Edge{
int u,v;
Edge(int a,int b){
u = a;
v = b;
}
Edge(){}
};
int color[10010];
vector<Edge> edges;
unordered_set<int> colors;
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0;i < m;i++){
int u,v;
scanf("%d%d",&u,&v);
edges.push_back(Edge(u,v));
}
int k;
scanf("%d",&k);
for(int i = 0;i < k;i++){
colors.clear();
for(int j = 0;j < n;j++){
int c;
scanf("%d",&c);
colors.insert(c);
color[j] = c;
}
bool kColor = true;
for(int j = 0;j < m;j++){
int u,v;
u = edges[j].u;
v = edges[j].v;
if(color[u] == color[v]){
kColor = false;
break;
}
}
if(kColor == true)
printf("%d-coloring\n",colors.size());
else
printf("No\n");
}
system("pause");
return 0;
}