洛谷P1347

最新推荐文章于 2024-09-09 12:31:15 发布

集.翔物

最新推荐文章于 2024-09-09 12:31:15 发布

阅读量288

点赞数 3

分类专栏：算法题解文章标签： c++ 算法

本文链接：https://blog.csdn.net/2302_79599802/article/details/141965566

版权

算法题解专栏收录该内容

7 篇文章 0 订阅

订阅专栏

洛谷P1347

#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define int __int128
typedef unsigned long long ull;
using ld = long double;
inline int read();
inline void write(int);
#define inf 0x3f3f3f3f         // 0x7fffffff 2147483647
#define INF 0x3f3f3f3f3f3f3f3f // 0x7fffffffffffffff 9223372036854775807
#define lowbit(x) ((x) & (-x))
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define mp make_pair
#define PII pair<int, int>
#define fi first
#define se second
#define mem(x, y) memset(x, y, sizeof(x))
#define endl '\n'
const double PI = acos(-1.0);
#define eps 1e-7
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << ": " << x << endl;
const int d[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const int maxn = 1e6 + 5;
const int mod = 998244353;
const int N = 30;

int n, m;
char u, v, op;
int in[N], iin[N];
int res;
vector<int> g[N], order;
int bfs()
{
    bool noorder = false;
    queue<int> q;
    order.resize(0);
    rep(i, 0, n - 1)
        iin[i] = in[i];

    rep(i,0,n-1)
        if (!iin[i])
            q.push(i);

    if (q.size() > 1)
        noorder = true;

    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        order.push_back(u);
        int temp = 0;
        for (auto v : g[u])
        {
            if (--iin[v] == 0)
            {
                temp++;
                if (temp > 1)
                    noorder = true;
                q.push(v);
            }
        }
    }

    if (order.size() != n)
        return 2;
    if (noorder)
        return 0;
    else
        return 1;
}
void solve()
{
    cin >> n >> m;
    rep(i, 1, m)
    {
        cin >> u >> op >> v;
        if (u == v)
        {
            cout << "Inconsistency found after " << i << " relations." << endl;
            return;
        }
        g[u - 'A'].push_back(v - 'A');
        in[v - 'A']++;

        res = bfs();

        if (res == 1)
        {
            cout << "Sorted sequence determined after " << i << " relations: ";
            for (auto j : order)
                cout << (char)(j + 'A');
            cout << "." << endl;
            return;
        }
        if (res == 2)
        {
            cout << "Inconsistency found after " << i << " relations." << endl;
            return;
        }
    }
    if (res == 0)
        cout << "Sorted sequence cannot be determined." << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // cout << fixed;
    // cout.precision(18);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}

inline int read()
{
    register int x = 0, f = 1;
    register char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        x = (x << 1) + (x << 3) + (ch ^ '0');
        ch = getchar();
    }
    return x * f;
}

inline void write(int x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
    return;
}