제출 #246126

#제출 시각아이디문제언어결과실행 시간메모리
246126VEGAnnRonald (COCI17_ronald)C++14
120 / 120
55 ms1408 KiB
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int oo = 2e9;
const int N = 1010;
const int md = 998244353;
const int PW = 233;
const int B = 700;
int n, m, mrk[N];
bool in[N][N];

void BAD(){
    cout << "NE";
    exit(0);
}

void dfs(int v, int tp){
    if (mrk[v]){
        if (mrk[v] != tp)
            BAD();
        return;
    }

    mrk[v] = tp;

    for (int u = 0; u < n; u++) {
        if (u == v) continue;

        if (in[v][u])
            dfs(u, tp);
        else dfs(u, 3 - tp);
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAl

    cin >> n >> m;

    for (int i = 0; i < m; i++){
        int x, y; cin >> x >> y;
        x--; y--;

        in[x][y] = in[y][x] = 1;
    }

    dfs(0, 1);

    cout << "DA";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...