結果
問題 | No.583 鉄道同好会 |
ユーザー |
![]() |
提出日時 | 2017-10-28 00:19:14 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,450 bytes |
コンパイル時間 | 619 ms |
コンパイル使用メモリ | 77,048 KB |
実行使用メモリ | 11,648 KB |
最終ジャッジ日時 | 2024-11-22 00:02:56 |
合計ジャッジ時間 | 1,508 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 WA * 1 |
ソースコード
#include <iostream>#include <vector>#include <string.h>#include <stack>#include <queue>#include <algorithm>#include <climits>#include <cmath>#include <map>#include <set>#include <assert.h>#include <sstream>#define REP(i,n) for(ll i=0;i<(n);i++)#define MOD 1000000007#define int long long#ifdef intconst long long INF = LLONG_MAX / 10;#elseconst int INF = 1010101010;#endifusing namespace std;typedef long long ll;typedef vector<vector<ll>> mat;typedef pair<int, int> P;//typedef pair<double, double> P;#ifdef LOCAL#define dump(...) \do { \std::ostringstream os; \os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \print_to(os, ", ", "\n", __VA_ARGS__); \std::cerr << os.str(); \} while (0)#define dump_(a) \do { \std::ostringstream os; \os << __LINE__ << ":\t" << #a << " = ["; \print_to_(os, ", ", "]\n", all(a)); \std::cerr << os.str(); \} while (0)#else#define dump(...)#define dump_(...)#endiftemplate <typename T>void print_to(std::ostream &os, const char *, const char *tail, const T &fst) {os << fst << tail;}template <typename Fst, typename... Rst>void print_to(std::ostream &os, const char *del, const char *tail, const Fst &fst, const Rst &... rst) {os << fst << del;print_to(os, del, tail, rst...);}template <typename Iter>void print_to_(std::ostream &os, const char *del, const char *tail, Iter bgn, Iter end) {for (Iter it = bgn; it != end;) {os << *it;if (++it != end) {os << del;} else {os << tail;}}}template <typename Fst, typename... Rst>void println(const Fst &fst, const Rst &... rst) {print_to(std::cout, "\n", "\n", fst, rst...);}template <typename Fst, typename... Rst>void print(const Fst &fst, const Rst &... rst) {print_to(std::cout, " ", "\n", fst, rst...);}template <typename Iter>void println_(Iter bgn, Iter end) {print_to_(std::cout, "\n", "\n", bgn, end);}template <typename Iter>void print_(Iter bgn, Iter end) {print_to_(std::cout, " ", "\n", bgn, end);}// const int MOD = 1000000007;namespace trush {int _ = (std::cout.precision(10), std::cout.setf(std::ios::fixed), std::cin.tie(0),std::ios::sync_with_stdio(0), 0);}int N, M;int Sa, Sb;int degree[510];struct edge{int to;bool used;};vector<edge> G[510];bool dfs(int v, int n){if (n == M) return true;for (edge e : G[v]) {if (!e.used) {e.used = true;if (dfs(e.to, n + 1)) return true;e.used = false;}}return false;}signed main(){cin >> N >> M;REP(i,M) {cin >> Sa >> Sb;G[Sa].push_back(edge{Sb, false});G[Sb].push_back(edge{Sa, false});degree[Sa]++;degree[Sb]++;}int oddNum = 0;REP(i,N) if (degree[i] % 2 == 1) oddNum++;bool con = dfs(Sa, 0);if (con && (oddNum == 0 || oddNum == 2)) {cout << "YES" << endl;} else {cout << "NO" << endl;}}