結果

問題 No.1370 置換門松列
ユーザー kaikey
提出日時 2021-01-29 22:19:51
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 98 ms / 2,000 ms
コード長 4,475 bytes
コンパイル時間 2,131 ms
コンパイル使用メモリ 212,556 KB
最終ジャッジ日時 2025-01-18 09:23:18
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double 
    long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
#define fi first
#define se second
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); }
lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); }
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e15;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c = 1) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<string, lint> valstring;
struct Topological_Sort {
public:
    Topological_Sort(int _n) : G(_n, Vl()), indegree(_n, 0), N(_n) {}
    void add_edge(int u, int v) {
        G[u].push_back(v);
        indegree[v]++;
    }
    Vl get() {
        Vl sorted_vertices;
        Vl tmp_indegree = indegree;
        queue<int> que;
        REP(i, N) {
            if (tmp_indegree[i] == 0) que.push(i);
        }
        while (!que.empty()) {
            int v = que.front(); que.pop();
            REP(i, SZ(G[v])) {
                int u = G[v][i];
                tmp_indegree[u]--;
                if (tmp_indegree[u] == 0) que.push(u);
            }
            sorted_vertices.push_back(v);
        }
        return sorted_vertices;
    }
private:
    VVl G;
    Vl indegree;
    int N;
};
lint N, M, A;
int main() {
    cin >> N >> M;
    Vl arr(N);
    
    cin >> arr;
    REP(i, N - 2) {
        if (arr[i] == arr[i + 1] || arr[i] == arr[i + 2] || arr[i + 1] == arr[i + 2]) {
            cout << "No" << endk;
            return 0;
        }
    }
    Topological_Sort topo1(M), topo2(M);
    set<plint> st;
    REP(i, N) arr[i]--;
    REP(i, N - 1) {
        if (i % 2 == 0 && st.count({ arr[i], arr[i + 1] })) {
            continue;
        }
        if (i % 2 == 1 && st.count({ arr[i + 1], arr[i] })) {
            continue;
        }
        if (i % 2 == 0) {
            topo1.add_edge(arr[i], arr[i + 1]);
            topo2.add_edge(arr[i + 1], arr[i]);
        }
        else {
            topo2.add_edge(arr[i], arr[i + 1]);
            topo1.add_edge(arr[i + 1], arr[i]);
        }
        if(i%2 == 0) st.insert({ arr[i], arr[i + 1] });
        else st.insert({ arr[i + 1], arr[i] });
    }
    {
        auto vec = topo1.get();
        if (SZ(vec) == M) {
            Vl ans(M);
            REP(i, M) {
                ans[vec[i]] = i + 1;
            }
            cout << "Yes" << endk;
            cout << ans << endk;
            return 0;
        }
    }
    {
        auto vec = topo2.get();
        if (SZ(vec) == M) {
            Vl ans(M);
            REP(i, M) {
                ans[vec[i]] = i + 1;
            }
            cout << "Yes" << endk;
            cout << ans << endk;
            return 0;
        }
    }
    cout << "No" << endk;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0