제출 #659776

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659776		Nanu	Ronald (COCI17_ronald)	C++14	0 / 120	121 ms	5476 KiB

ronald

#include <iostream>
#include <vector>

using namespace std;

///ifstream cin("info.in");
///ofstream cout("info.out");

#define DIM 1000

bool sel[DIM + 1];
int n, m;
vector <int> G[DIM + 1];

static inline void dfs(int nod) {
    sel[nod] = 1;
    for(auto e : G[nod])
        if(!sel[e])
            dfs(e);
}

int main()
{
    cin >> n >> m;
    for(int i = 1, x, y; i <= m; i++) {
        cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    dfs(1);

    int nrcomp = 1;
    for(int i = 1; i <= n; i++)
        if(!sel[i]) {
            sel[i] = 1;
            dfs(i);
        }

    if(nrcomp % 2 == 1)
        cout << "NE";
    else cout << "DA";

    return 0;
}

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