negcy_But Stupid

#include <iostream>
#include <cstdio>
#include <stack>
#include <bitset>
#include <algorithm>
#include <vector>
#define task ""

using namespace std;
using ll = long long;
using ld = long double;

const int N = 5e3 + 2;
int n, m;
const ll Inf = 1e18;
ll w[N], d[N];
vector<pair<int, int>> adj[N];
stack<int> ans;

void Read()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        int u, v;
        cin >> u >> v >> w[i];
        adj[u].push_back({v, i});
        //adj[v].push_back({u, i});
    }
}

bool dfs(int v, const int &goals)
{
    if (d[v] < 0 && v == goals)
    {
        cout << "YES\n";
        ans.push(v);
        return true;
    }
    for (auto i : adj[v])
        if (d[i.first] > d[v] + w[i.second])
        {
            d[i.first] = d[v] + w[i.second];
            if (d[i.first] <= 0 && dfs(i.first, goals))
            {
                ans.push(v);
                return true;
            }
        }
    return false;
}

void Solve()
{
    for (int i = 1; i <= n; ++i)
    {
        fill_n(d, N, Inf);
        d[i] = 0;
        if (dfs(i, i))
        {
            while (!ans.empty())
            {
                cout << ans.top() << " ";
                ans.pop();
            }
            return;
        }
    }
    cout << "NO";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(task ".INP", "r"))
    {
        freopen(task ".INP", "r", stdin);
        freopen(task ".OUT", "w", stdout);
    }
    Read();
    Solve();
}