제출 #965992

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965992		12345678	Ronald (COCI17_ronald)	C++17	120 / 120	38 ms	9544 KiB

ronald

#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;

int n, edg, m[nx][nx], u, v, vs[nx], cnt;
vector<int> d[nx], c[nx], hd;

void dfs(int u, int p, int h)
{
    c[h].push_back(u);
    vs[u]=1;
    for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u, h);
}

bool complete(int x)
{
    for (auto y:c[x]) for (auto z:c[x]) if (y!=z&&!m[y][z]) return 0;
    return 1;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>edg;
    for (int i=1; i<=edg; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u), m[u][v]=m[v][u]=1;
    for (int i=1; i<=n; i++) if (!vs[i]) cnt++, dfs(i, i, i), hd.push_back(i);
    if (cnt==1&&complete(hd[0])) cout<<"DA";
    else if (cnt==2&&complete(hd[0])&&complete(hd[1])) cout<<"DA";
    else cout<<"NE";
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 15 / 15
• Subtask 7: 15 / 15
• Subtask 8: 15 / 15