Language: C++

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
#include <atcoder/twosat>


using namespace std;
using namespace atcoder;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;


// edit

void solve() {
    int N;
    cin >> N;

    ll D;
    cin >> D;
    vector<pair<ll, ll>> xy(N);
    REP(i, N) {
        cin >> xy[i].first >> xy[i].second;
    }

    two_sat ts(2 * N);

    for (int i = 0; i < N; ++i) {
        ts.add_clause(2 * i, true, 2 * i + 1, true);
    }
    for (int i = 0; i < N; ++i) {
        for (int j = i + 1; j < N; ++j) {
            vector<pair<ll, ll>> tapu{{xy[i].first,  2 * i},
                                      {xy[i].second, 2 * i + 1}};
            vector<pair<ll, ll>> tapi{{xy[j].first,  2 * j},
                                      {xy[j].second, 2 * j + 1}};
            for (auto ei1333 : tapu) {
                for (auto treeone79 : tapi) {
                    if (abs(ei1333.first - treeone79.first) < D) {
                        ts.add_clause(ei1333.second, false, treeone79.second, false);
//                        cerr << ei1333.second << " " << treeone79.second << endl;
                    }
                }
            }
        }
    }

    bool f = ts.satisfiable();
    if (f) {
        cout << "Yes" << endl;
        auto v = ts.answer();
        for (int i = 0; i < N; ++i) {
            if (v[2 * i]) {
                cout << xy[i].first;
            } else {
                cout << xy[i].second;
            }
            cout << endl;
        }
    } else {
        cout << "No" << endl;
    }


}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    solve();


    return 0;
}


Compiler output:
a.cc:36:10: fatal error: atcoder/twosat: No such file or directory
   36 | #include <atcoder/twosat>
      |          ^~~~~~~~~~~~~~~~
compilation terminated.