結果
問題 | No.1023 Cyclic Tour |
ユーザー |
![]() |
提出日時 | 2020-08-14 13:47:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 3,403 bytes |
コンパイル時間 | 2,893 ms |
コンパイル使用メモリ | 212,084 KB |
最終ジャッジ日時 | 2025-01-12 22:42:02 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 49 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<long long> VL;typedef vector<vector<long long>> VVL;typedef pair<int,int> P;typedef tuple<int,int,int> tpl;#define ALL(a) (a).begin(),(a).end()#define SORT(c) sort((c).begin(),(c).end())#define REVERSE(c) reverse((c).begin(),(c).end())#define EXIST(m,v) (m).find((v)) != (m).end()#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define REP(i,n) FOR(i,0,n)#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)#define RREP(i,n) RFOR(i,n,0)#define en "\n"constexpr double EPS = 1e-9;constexpr double PI = 3.1415926535897932;constexpr int INF = 2147483647;constexpr long long LINF = 1LL<<60;constexpr long long MOD = 1000000007; // 998244353;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; }struct Edge{int from, to, id=0;int cost=1;Edge(int from, int to, int cost=1, int id=0): from(from), to(to), cost(cost), id(id) {}Edge() {}friend istream &operator>>(istream &input, Edge &e ){input >> e.from >> e.to;e.from--; e.to--;return input;}Edge rev(void){return Edge(to, from, cost, id);}};vector<vector<Edge>> edge, re;vector<bool> vis, done;VI one_group, order, id;VVI group;int n,m;void dfs1(int v){vis[v] = 1;for(auto& e : edge[v]){if(vis[e.to] || done[e.to]) continue;dfs1(e.to);}order.push_back(v);return;}void dfs2(int v){vis[v] = 0;for(auto& e : re[v]){if(vis[e.to]==0) continue;dfs2(e.to);}one_group.push_back(v);return;}void decomp(int v){dfs1(v);while(!order.empty()){if(vis[order.back()]==0){order.pop_back();continue;}dfs2(order.back());for(int u : one_group) done[u] = 1;group.emplace_back(one_group);one_group = {};}return;}bool dfs(int v){if(vis[v]==1){return true;}vis[v] = 1;for(auto& e : edge[v]){if(id[v] != id[e.to]) continue;if(done[e.id]) continue;done[e.id] = true;if(dfs(e.to)) return true;}return false;}void Main(){int N,M; cin >> N >> M; edge.resize(N);re.resize(N);REP(i,M){Edge e; int c; cin >> e >> c; e.id = i;edge[e.from].emplace_back(e); re[e.to].emplace_back(e.rev());if(c == 1){edge[e.to].emplace_back(e.rev());re[e.from].emplace_back(e);}}vis.resize(N,0);done.resize(N,0);REP(i,N) if(done[i]==0) decomp(i);id.resize(N);REP(i,group.size()){for(int v : group[i]) id[v] = i;}vis.assign(N,0);done.assign(M,0);REP(i,N){if(vis[i]) continue;if(dfs(i)){cout << "Yes" << en;return;}}cout << "No" << en;return;}int main(void){cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);int t=1; //cin>>t;REP(_,t) Main();return 0;}