結果

問題 No.1023 Cyclic Tour
ユーザー fiord
提出日時 2020-04-12 02:10:16
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,232 bytes
コンパイル時間 1,300 ms
コンパイル使用メモリ 132,600 KB
実行使用メモリ 30,208 KB
最終ジャッジ日時 2024-09-21 07:43:56
合計ジャッジ時間 28,208 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 44 WA * 5
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()   {cin.tie(0);    cout.sync_with_stdio(false);}
#define reach(i,a)  for(auto i:a)
#define rep(i,n)    for(int i=0;i<((int)n);i++)
#define REP(i,n)    for(int i=0;i<=((int)n);i++)
#define srep(i,a,n) for(int i=a;i<((int)n);i++)
#define SREP(i,a,n) for(int i=a;i<=((int)n);i++)
#define rrep(i,n)   for(int i=n-1;i>=0;i--)
#define RREP(i,n)   for(int i=n;i>=0;i--)
#define all(a)  (a).begin(),(a).end()
#define mp(a,b) make_pair(a,b)
#define mt  make_tuple
#define pb  push_back
template<typename T> istream& operator >> (istream& is, vector<T>& vec) {
    for (T& x : vec)    is >> x;
    return is;
}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "[";
    rep(i, vec.size())  os << (i ? ", " : "") << vec[i];
    os << "]";
    return os;
}
template<typename T> istream& operator >> (istream& is, pair<T, T>& p) {
    is >> p.first >> p.second;
    return is;
}
template<typename T> ostream& operator << (ostream& os, pair<T, T>& p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T> bool operator < (vector<T>& a, vector<T>& b) {
    rep(i, a.size()) {
        if (i == b.size())  return false;
        if (a[i] < b[i])    return true;
        else if (a[i] > b[i])   return false;
    }
    return false;
}
template<typename T> bool operator > (vector<T>& a, vector<T>& b) {
    rep(i, a.size()) {
        if (i == b.size())  return true;
        if (a[i] < b[i])    return false;
        else if (a[i] > b[i])   return true;
    }
    return false;
}
int bitcnt(ll x) {
    x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
    x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
    x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
    x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
    x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
    x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
    return x;
}
int bitcnt(int x) {
    x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
    x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
    x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
    x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
    x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
    return x;
}
ll sqrtll(ll x) {
    ll left = 0, right = x;
    rep(i, 100) {
        ll mid = (left + right) >> 1;
        if (mid * mid <= x) left = mid;
        else    right = mid;
    }
    return left;
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}
#define debug(x)    printf("Case #%d: ", x)
#undef DEBUG
const ld infl = 1e100;
const ll mod = 998244353;
const ld eps = 1e-9;
const ll inf = 1e15;
const int dx[] = { 1,0,-1,0,1, -1 };
const int dy[] = { 0,1,0,-1,1, -1 };
set<pii> edge_set;
set<pii> can_ignore;
vint edge[100000];
bool found[100000];
bool visit[100000];
bool dfs(int i, int p) {
    found[i] = true;
    for (int to : edge[i]) {
        if (to == p)    continue;
        if (found[to] && !visit[to])    return true;
        int parent = (can_ignore.count(mp(i, to)) ? -1 : i);
        if (!found[to] && dfs(to, parent))  return true;
    }
    visit[i] = true;
    return false;
}
int main() {
    int n, m;   cin >> n >> m;
    rep(i, m) {
        int a, b, c;    cin >> a >> b >> c;
        a--;    b--;
        if (c == 1) {
            edge[a].push_back(b);
            edge[b].push_back(a);
        }
        else if (c == 2) {
            edge[a].push_back(b);
        }
        if (edge_set.count(mp(a, b))) {
            can_ignore.insert(mp(a, b));
            can_ignore.insert(mp(b, a));
        }
        else {
            edge_set.insert(mp(a, b));
            edge_set.insert(mp(b, a));
        }
    }
    rep(i, n) {
        if (visit[i] == 0) {
            if (dfs(i, -1)) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0