L2-023 图着色问题

合集 - 模拟(54)

1.G. Vlad and Trouble at MIT2024-02-20 2.P2899 [USACO08JAN] Cell Phone Network G2024-02-20 3.Watering an Array2024-02-23 4.P2055 [ZJOI2009] 假期的宿舍2024-03-08 5.T432579 大西洋船王2024-03-08 6.T432580 星云 hard ver.2024-03-08 7.P7072 [CSP-J2020] 直播获奖2024-03-09 8.E - Insert or Erase2024-03-10 9.D - String Bags2024-03-10 10.P2671 [NOIP2015 普及组] 求和2024-03-10 11.P1884 [USACO12FEB] Overplanting S2024-03-10 12.F. Microcycle2024-03-12 13.E. Increasing Subsequences__22024-03-13 14.G. Path Prefixes2024-03-14 15.F. Rudolf and Imbalance2024-03-14 16.P1355 神秘大三角2024-03-20 17.[ARC172A] Chocolate2024-03-25 18.F. 0, 1, 2, Tree!2024-03-29 19.E. Nearly Shortest Repeating Substring2024-03-29 20.P1354 房间最短路问题2024-03-29 21.P3258 [JLOI2014] 松鼠的新家2024-04-02 22.P3052 [USACO12MAR] Cows in a Skyscraper G2024-04-05 23.P1337 [JSOI2004] 平衡点 / 吊打XXX2024-04-07 24.P3745 [六省联考 2017] 期末考试2024-04-08 25.D. Inaccurate Subsequence Search2024-04-09 26.E. Long Inversions2024-04-09 27.C. Deep Down Below2024-04-09 28.C. Rings2024-04-09 29.F. Unfair Game2024-04-10 30.C. Inversion Graph2024-04-10 31.D. Cross Coloring2024-04-12 32.D2. Set To Max (Hard Version)2024-04-12 33.C. Array Game2024-04-12 34.F. Alex's whims2024-04-12 35.Queue Sort2024-04-12 36.P10252 线性变换2024-04-16 37.P10288 [GESP样题八级] 区间2024-04-16 38.P2161 [SHOI2009] 会场预约2024-04-17 39.L2-001 紧急救援2024-04-18 40.L2-002 链表去重2024-04-18 41.L2-013 红色警报2024-04-18 42.L2-014 列车调度2024-04-19 43.L2-022 重排链表2024-04-19

44.L2-023 图着色问题2024-04-19

45.L2-039 清点代码库2024-04-19 46.L2-034 口罩发放2024-04-19 47.L3-037 夺宝大赛2024-04-23 48.仓库规划2024-04-23 49.因子化简2024-04-23 50.C. Torn Lucky Ticket2024-04-27 51.俄罗斯方块2024-05-14 52.F. Cutting Game2024-05-21 53.D. Prefix Permutation Sums2024-06-17 54.P3304 [SDOI2013] 直径2024-07-15

原题链接

题解

说用k种颜色，没说用少于k种

code

#include<bits/stdc++.h>
using namespace std;
vector<int> G[505];
int vis[505]={0};
int color[505]={0};
int v,e,k,n;
int solve()
{
    for(int i=1;i<=v;i++)
    {
        for(auto next:G[i])
        {
            if(color[i]==color[next]) return 0;
        }
    }
    return 1;
}
int main()
{
    cin>>v>>e>>k;
    for(int i=1;i<=e;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    cin>>n;

    while(n--)
    {
        set<int> q;
        int maxs=0,mins=v+1;
        for(int i=1;i<=v;i++)
        {
            cin>>color[i];
            q.insert(color[i]);
            maxs=max(maxs,color[i]);
            mins=min(mins,color[i]);
        }
        if(mins>0&&maxs<=v&&q.size()==k&&solve()) puts("Yes");
        else puts("No");
    }
    return 0;
}