# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126669 | abacaba | Ronald (COCI17_ronald) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const int N = 1e3 + 15;
int n, m, cur[N];
bool g[N][N], used[N];
bool dfs(int v, bool rev) {
used[v] = true;
if(rev)
for(int i = 1; i <= n; ++i) {
g[i][v] ^= 1;
g[v][i] ^= 1;
}
for(int i = 1; i <= n; ++i)
if(i != v && !g[i][v])
if(used[i] || !dfs(i, 1))
return false;
used[v] = false;
return true;
}
int main() {
freopen("input.txt", "r", stdin);
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
g[u][v] = g[v][u] = true;
}
for(int i = 1; i <= n; ++i) {
memset(used, 0, sizeof(used));
cur[i] = 0;
bool flag1 = dfs(i, 0);
memset(used, 0, sizeof(used));
cur[i] = 1;
bool flag2 = dfs(i, 1);
if(!flag1 && !flag2) {
puts("NE");
return 0;
}
}
puts("DA");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |