結果
問題 | No.2202 贅沢てりたまチキン |
ユーザー |
|
提出日時 | 2023-02-03 23:09:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 124 ms / 2,000 ms |
コード長 | 3,980 bytes |
コンパイル時間 | 1,958 ms |
コンパイル使用メモリ | 207,652 KB |
最終ジャッジ日時 | 2025-02-10 09:59:56 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
/*** author: shu8Cream* created: 03.02.2023 22:26:17**/#include <bits/stdc++.h>using namespace std;#define overload3(a,b,c,d,...) d#define rep1(i,n) for (int i=0; i<(n); i++)#define rep2(i,a,n) for (int i=(a); i<(n); i++)#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)#define rrep1(i,n) for (int i=(n-1); i>=0; i--)#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define sz(x) int((x).size())#define pcnt __builtin_popcountllusing ll = long long;using P = pair<ll,ll>;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;using vi = vc<ll>;using vvi = vv<ll>;const int INF = 1e9;const ll LINF = 8e18;template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}template<class T> inline bool chmax(T& a, T b) {if(a<b) { a=b;return true; } return false;}template<class T> inline bool chmin(T& a, T b) {if(a>b) { a=b;return true; } return false;}template <class T> string to_string(T s);template <class S, class T> string to_string(pair<S, T> p);string to_string(char c) { return string(1, c); }string to_string(string s) { return s; }string to_string(const char s[]) { return string(s); }template <class T>string to_string(T v) {if (v.empty()) return "{}";string ret = "{";for (auto x : v) ret += to_string(x) + ",";ret.back() = '}';return ret;}template <class S, class T>string to_string(pair<S, T> p) {return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";}void debug_out() { cout << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cout << to_string(H) << " ";debug_out(T...);}#ifdef _DEBUG#define debug(...) debug_out(__VA_ARGS__)#else#define debug(...)#endifstruct UnionFind{vector<int> par;UnionFind(){}UnionFind(int n=0): par(n, -1){}int find(int x){if(par[x] < 0) return x;return par[x] = find(par[x]);}bool merge(int x, int y){x = find(x); y = find(y);if(x == y) return false;if(par[x] > par[y]) swap(x,y); //マージテクpar[x] += par[y];par[y] = x;return true;}bool same(int x, int y) {return find(x) == find(y);}int size(int x) {return -par[find(x)];}};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);ll n,m; cin >> n >> m;vvi to(n);UnionFind uf(n);rep(i,m){int a,b; cin >> a >> b;a--; b--;to[a].push_back(b);to[b].push_back(a);uf.merge(a,b);}vi ord;vi pos(n,-1);set<ll> par;rep(i,n)par.insert(uf.find(i));vi cnt(n);int now;auto dfs = [&](auto dfs, int s, int p=-1)->void{pos[s] = now++;for(auto nv:to[s]){if(nv==p) continue;if(pos[nv]!=-1){// cerr<<now<<" "<<pos[nv]<<endl;if((now-pos[nv])%2){cnt[uf.find(nv)]=1;return;}continue;}dfs(dfs,nv,s);}pos[s] = -1;now--;};for(auto p : par){now = 0;dfs(dfs,p);}cerr<<sz(par)<<" "<<reduce(all(cnt))<<endl;cout << (sz(par)==reduce(all(cnt)) ? "Yes" : "No") << endl;}