#462084 (C++14) No.1023 Cyclic Tour

• 問題: No.1023 Cyclic Tour
• ユーザー: 👑 tute7627
• 提出日時: 2020-04-10 22:03:12
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 94 ms / 2,000 ms
• コード長: 3,656 bytes
• コンパイル時間: 1,889 ms
• コンパイル使用メモリ: 178,732 KB
• 実行使用メモリ: 19,584 KB
• 最終ジャッジ日時: 2024-09-15 20:23:10
• 合計ジャッジ時間: 7,968 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 5,248 KB
testcase_01	AC	3 ms; 5,248 KB
testcase_02	AC	3 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	63 ms; 12,672 KB
testcase_05	AC	57 ms; 12,672 KB
testcase_06	AC	68 ms; 14,848 KB
testcase_07	AC	64 ms; 13,696 KB
testcase_08	AC	54 ms; 14,720 KB
testcase_09	AC	51 ms; 14,336 KB
testcase_10	AC	51 ms; 14,336 KB
testcase_11	AC	56 ms; 14,976 KB
testcase_12	AC	50 ms; 15,616 KB
testcase_13	AC	47 ms; 14,976 KB
testcase_14	AC	47 ms; 14,848 KB
testcase_15	AC	48 ms; 14,976 KB
testcase_16	AC	77 ms; 18,688 KB
testcase_17	AC	79 ms; 18,816 KB
testcase_18	AC	78 ms; 18,560 KB
testcase_19	AC	75 ms; 18,304 KB
testcase_20	AC	90 ms; 15,488 KB
testcase_21	AC	94 ms; 15,744 KB
testcase_22	AC	92 ms; 17,024 KB
testcase_23	AC	92 ms; 17,408 KB
testcase_24	AC	91 ms; 18,816 KB
testcase_25	AC	89 ms; 15,488 KB
testcase_26	AC	88 ms; 15,616 KB
testcase_27	AC	81 ms; 14,976 KB
testcase_28	AC	87 ms; 18,432 KB
testcase_29	AC	82 ms; 18,432 KB
testcase_30	AC	90 ms; 18,816 KB
testcase_31	AC	86 ms; 17,920 KB
testcase_32	AC	83 ms; 18,048 KB
testcase_33	AC	92 ms; 18,560 KB
testcase_34	AC	86 ms; 15,872 KB
testcase_35	AC	90 ms; 15,616 KB
testcase_36	AC	85 ms; 16,128 KB
testcase_37	AC	84 ms; 17,152 KB
testcase_38	AC	81 ms; 17,792 KB
testcase_39	AC	88 ms; 17,024 KB
testcase_40	AC	88 ms; 17,408 KB
testcase_41	AC	86 ms; 17,408 KB
testcase_42	AC	86 ms; 15,744 KB
testcase_43	AC	82 ms; 18,048 KB
testcase_44	AC	53 ms; 12,160 KB
testcase_45	AC	47 ms; 16,384 KB
testcase_46	AC	44 ms; 16,512 KB
testcase_47	AC	60 ms; 19,584 KB
testcase_48	AC	77 ms; 16,496 KB
testcase_49	AC	75 ms; 16,184 KB
testcase_50	AC	74 ms; 16,500 KB
testcase_51	AC	73 ms; 16,500 KB
testcase_52	AC	75 ms; 16,372 KB

ソースコード

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
ll sz=100005;
vector<ll>t(sz,-1);
bool judge=false;
void dfs(ll k,vector<vector<ll>>&g,ll par,ll group){
  t[k]=group;
  for(auto to:g[k]){
    if(to != par&&t[to]==-1){
      dfs(to,g,k,group); 
    }
    else if(to!=par){
      judge=true;
    }
  }
}
vector<ll>tsort(vector<vector<ll>>&g){
  ll n = g.size();
  vector<ll>ret(n),ret2(n);
  vector<ll>v(n);
  for(ll i=0;i<n;i++)for(ll j=0;j<g[i].size();j++)v[g[i][j]]++;
  stack<ll>st;
  for(ll i=0;i<n;i++)if(v[i]==0)st.push(i);
  for(ll i=0;i<n;i++){
    if(st.empty())return vector<ll>();//閉路がある
    ll x=st.top();
    st.pop();
    ret[x]=i;
    ret2[i]=x;
    for(ll j=0;j<g[x].size();j++){
      v[g[x][j]]--;
      if(v[g[x][j]]==0)st.push(g[x][j]);
    }
  }
  //ret:頂点のトポロジカル順序の割り当て　ret2:頂点をトポロジカル順に並べたもの
  return ret;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  ll n,m;cin>>n>>m;
  vector<vector<ll>>g1(n);
  vector<ll>a(m),b(m),c(m);
  rep(i,0,m){
    cin>>a[i]>>b[i]>>c[i];a[i]--;b[i]--;
    if(c[i]==1){
      g1[a[i]].PB(b[i]);
      g1[b[i]].PB(a[i]);
    }
  }
  ll num=0;
  rep(i,0,n){
    if(t[i]==-1){
      dfs(i,g1,-1,num);
      num++;
      //debug(t,n);
      //cout<<i spa num spa g1[i].size()<<endl;
    }
  }
  vector<vector<ll>>g2(num);
  //debug(t,n);
  rep(i,0,m){
    if(c[i]==2){
      g2[t[a[i]]].PB(t[b[i]]);
      if(t[a[i]]==t[b[i]])judge=true;
    }
  }
  auto v=tsort(g2);
  if(v.empty())judge=true;
  ans1(judge);
  return 0;
}