結果
問題 | No.583 鉄道同好会 |
ユーザー | mai |
提出日時 | 2017-10-27 22:28:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,746 bytes |
コンパイル時間 | 3,210 ms |
コンパイル使用メモリ | 220,556 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-26 08:28:34 |
合計ジャッジ時間 | 3,978 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 4 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | AC | 4 ms
5,376 KB |
testcase_16 | AC | 6 ms
5,376 KB |
testcase_17 | AC | 6 ms
5,376 KB |
testcase_18 | AC | 6 ms
5,376 KB |
ソースコード
#pragma GCC optimize ("O3")#pragma GCC target ("avx")#include "bits/stdc++.h" // define macro "/D__MAI"using namespace std;typedef long long int ll;#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}#define ALL(v) (v).begin(),(v).end()#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))#define MD 1000000007ll#define PI 3.1415926535897932384626433832795#define EPS 1e-12template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o;}template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }mt19937_64 randdev(8901016);inline ll rand_range(ll l, ll h) {return uniform_int_distribution<ll>(l, h)(randdev);}#ifdef __MAI#define getchar_unlocked getchar#define putchar_unlocked putchar#endif#ifdef __VSCC#define getchar_unlocked _getchar_nolock#define putchar_unlocked _putchar_nolock#endifnamespace {#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)class MaiScanner {public:template<typename T> void input_integer(T& var) {var = 0;T sign = 1;int cc = getchar_unlocked();for (; cc<'0' || '9'<cc; cc = getchar_unlocked())if (cc == '-') sign = -1;for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())var = (var << 3) + (var << 1) + cc - '0';var = var*sign;}inline int c() { return getchar_unlocked(); }inline MaiScanner& operator>>(int& var) {input_integer<int>(var);return *this;}inline MaiScanner& operator>>(long long& var) {input_integer<long long>(var);return *this;}inline MaiScanner& operator>>(string& var) {int cc = getchar_unlocked();for (; !isvisiblechar(cc); cc = getchar_unlocked());for (; isvisiblechar(cc); cc = getchar_unlocked())var.push_back(cc);return *this;}template<typename IT> void in(IT begin, IT end) {for (auto it = begin; it != end; ++it) *this >> *it;}};}MaiScanner scanner;// 隣接頂点を保持する無向グラフclass Graph {public:size_t n;vector<vector<int>> vertex_to;Graph(size_t n) :n(n), vertex_to(n) {}void connect(int from, int to) {vertex_to[from].emplace_back(to);vertex_to[to].emplace_back(from);}void resize(size_t _n) {n = _n;vertex_to.resize(_n);}};ll m, n, kei;int main() {scanner >> n >> m;Graph g(n);repeat(i, m) {int a, b;scanner >> a >> b;g.connect(a, b);}int odd = 0;repeat(i, n) {if (g.vertex_to[i].size() % 2 == 1)odd++;}if (odd != 0 && odd != 2) {cout << "NO" << endl;}else {cout << "YES" << endl;}return 0;}