結果
問題 | No.583 鉄道同好会 |
ユーザー | hiyokko2 |
提出日時 | 2017-10-27 23:48:30 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,462 bytes |
コンパイル時間 | 1,044 ms |
コンパイル使用メモリ | 77,044 KB |
実行使用メモリ | 22,656 KB |
最終ジャッジ日時 | 2024-11-21 23:38:19 |
合計ジャッジ時間 | 23,131 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
12,032 KB |
testcase_01 | AC | 2 ms
10,496 KB |
testcase_02 | AC | 1 ms
13,636 KB |
testcase_03 | AC | 1 ms
10,496 KB |
testcase_04 | AC | 2 ms
13,636 KB |
testcase_05 | AC | 2 ms
10,496 KB |
testcase_06 | AC | 2 ms
13,636 KB |
testcase_07 | WA | - |
testcase_08 | AC | 2 ms
10,496 KB |
testcase_09 | AC | 1 ms
14,720 KB |
testcase_10 | AC | 2 ms
13,636 KB |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | AC | 299 ms
22,656 KB |
ソースコード
#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 int const long long INF = LLONG_MAX / 10; #else const int INF = 1010101010; #endif using 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_(...) #endif template <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 used[252525 * 3]; struct edge { int id; int to; }; vector<edge> G[510]; bool dfs(int v, int n) { if (n == M) return true; //dump(v, n); for (edge e : G[v]) { if (!used[252525 + e.id] && !used[252525 - e.id]) { used[252525 + e.id] = true; if (dfs(e.to, n + 1)) return true; used[252525 + e.id] = false; } } return false; } signed main() { cin >> N >> M; REP(i,M) { cin >> Sa >> Sb; G[Sa].push_back(edge{(i + 1), Sb}); G[Sb].push_back(edge{-(i + 1), Sa}); } /* REP(i,N) { if (dfs(i, 0)) { cout << "YES" << endl; return 0; } } */ if (dfs(Sa, 0)) cout << "YES" << endl; else cout << "NO" << endl; }