結果

問題 No.1370 置換門松列
ユーザー gazellegazelle
提出日時 2021-01-29 23:04:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,961 bytes
コンパイル時間 2,426 ms
コンパイル使用メモリ 213,204 KB
実行使用メモリ 21,864 KB
最終ジャッジ日時 2024-11-08 04:17:11
合計ジャッジ時間 4,980 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
11,080 KB
testcase_01 AC 5 ms
11,072 KB
testcase_02 AC 5 ms
11,084 KB
testcase_03 AC 6 ms
11,092 KB
testcase_04 WA -
testcase_05 AC 5 ms
11,136 KB
testcase_06 WA -
testcase_07 AC 5 ms
11,248 KB
testcase_08 AC 6 ms
11,132 KB
testcase_09 AC 5 ms
10,972 KB
testcase_10 AC 5 ms
11,036 KB
testcase_11 AC 5 ms
11,136 KB
testcase_12 AC 5 ms
11,136 KB
testcase_13 AC 6 ms
11,136 KB
testcase_14 AC 5 ms
11,072 KB
testcase_15 AC 6 ms
11,064 KB
testcase_16 AC 5 ms
10,980 KB
testcase_17 AC 5 ms
11,096 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 6 ms
11,088 KB
testcase_21 AC 35 ms
21,760 KB
testcase_22 AC 26 ms
20,584 KB
testcase_23 AC 31 ms
19,036 KB
testcase_24 AC 12 ms
11,480 KB
testcase_25 AC 51 ms
21,760 KB
testcase_26 AC 51 ms
21,864 KB
testcase_27 AC 41 ms
20,968 KB
testcase_28 AC 43 ms
20,904 KB
testcase_29 AC 39 ms
15,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-6;
 
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << v[i];
    }
    return os;
}
 
struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
 
#define MAX_N 1010101
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
 
using mi = modint;
 
mi mod_pow(mi a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}

ll mod_pow(ll a, ll n, ll m) {
    ll ret = 1;
    ll tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        ret %= m;
        tmp = tmp * tmp;
        tmp %= m;
        n /= 2;
    }
    return ret % m;
}
 
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

bool is_kadomatsu(int a, int b, int c) {
    if(a == b || b == c || a == c) {
        return false;
    }
    if(b < a && b < c) {
        return true;
    } else if(b > a && b > c) {
        return true;
    } else {
        return false;
    }
}

void dfs(int v, vector<int> & used, bool & ok, vector<set<int>> & g, vector<int>  & sorted) {
    used[v] = 1;
        for(auto adj: g[v]) {
            if(used[adj] == 2) continue;
            if(used[adj] == 1) {
                ok = false;
                return;
            } else {
                dfs(adj, used, ok, g, sorted);
            }
        }

        used[v] = 2;
        sorted.pb(v);

        return;
}

bool topological_sort(vector<set<int>> & g, vector<int> & sorted) {
    int n = size(g);
    vector<int> used(n, 0);
    bool ok = true;

    REP(i, n) {
        if(used[i] > 0) continue;
        dfs(i, used, ok ,g, sorted);
    }
    return ok;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, m;
    cin >> n >> m;

    vector<int> a(n);
    REP(i, n) {
        cin >> a[i];
    }

    vector<set<int>> g(m);

    REP(i, n - 1) {
        if(i % 2 == 0) g[a[i] - 1].insert(a[i + 1] - 1);
        else g[a[i + 1] - 1].insert(a[i] - 1);
    }

    vector<int> sorted;
    if(topological_sort(g, sorted)) {
        vector<int> ans(m);
        REP(i, m) {
            ans[sorted[i]] = i + 1;
        }
        cout << "Yes" << endl;
        cout << ans << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}
0