# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
126673 | 2019-07-08T09:04:37 Z | abacaba | Ronald (COCI17_ronald) | C++14 | 1000 ms | 1372 KB |
#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; return true; } int main() { 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 380 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 4 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 504 KB | Output is correct |
2 | Correct | 325 ms | 888 KB | Output is correct |
3 | Correct | 63 ms | 764 KB | Output is correct |
4 | Correct | 5 ms | 764 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 10 ms | 760 KB | Output is correct |
3 | Correct | 34 ms | 1372 KB | Output is correct |
4 | Execution timed out | 1068 ms | 1364 KB | Time limit exceeded |