제출 #659813

#제출 시각아이디문제언어결과실행 시간메모리
659813NanuRonald (COCI17_ronald)C++14
120 / 120
102 ms1268 KiB
#include <iostream> #include <vector> using namespace std; ///ifstream cin("info.in"); ///ofstream cout("info.out"); #define DIM 1000 int n, m; bool g[DIM + 5][DIM + 5]; static inline void Modif(int c) { for(int j = 1; j <= n; j++) { if(g[j][c] == 1) g[j][c] = 0; else g[j][c] = 1; if(g[c][j] == 1) g[c][j] = 0; else g[c][j] = 1; } } static inline bool Check() { for(int i = 1; i <= n; i++) if(!g[i][1]) Modif(i); for(int i = 1; i <= n; i++) for(int j = i + 1; j <= n; j++) if(!g[i][j]) return 0; return 1; } int main() { cin >> n >> m; for(int i = 1, x, y; i <= m; i++) { cin >> x >> y; g[x][y] = g[y][x] = 1; } cout << (Check() == 0 ? "NE" : "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...