結果

問題 No.470 Inverse S+T Problem
ユーザー firiexp
提出日時 2019-12-03 20:17:38
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 5 ms
コード長 3,216 Byte
コンパイル時間 1,298 ms
使用メモリ 1,576 KB
最終ジャッジ日時 2019-12-03 20:17:42

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00sample1.txt AC 4 ms
1,536 KB
00sample2.txt AC 3 ms
1,524 KB
00sample3.txt AC 3 ms
1,536 KB
00sample4.txt AC 3 ms
1,540 KB
10hand01.txt AC 3 ms
1,532 KB
10hand02.txt AC 3 ms
1,536 KB
20randomA00.txt AC 4 ms
1,488 KB
20randomA01.txt AC 4 ms
1,484 KB
20randomA02.txt AC 3 ms
1,484 KB
30randomB00.txt AC 4 ms
1,544 KB
30randomB01.txt AC 3 ms
1,548 KB
30randomB02.txt AC 4 ms
1,564 KB
40randomC00.txt AC 4 ms
1,536 KB
40randomC01.txt AC 4 ms
1,552 KB
40randomC02.txt AC 4 ms
1,576 KB
50randomD00.txt AC 3 ms
1,556 KB
50randomD01.txt AC 4 ms
1,544 KB
50randomD02.txt AC 3 ms
1,548 KB
50randomD03.txt AC 4 ms
1,548 KB
50randomD04.txt AC 3 ms
1,552 KB
50randomD05.txt AC 3 ms
1,540 KB
90special01.txt AC 3 ms
1,560 KB
90special02.txt AC 4 ms
1,564 KB
90special03.txt AC 4 ms
1,564 KB
90special04.txt AC 4 ms
1,556 KB
95challenge01.txt AC 3 ms
1,560 KB
95challenge02.txt AC 4 ms
1,556 KB
95challenge03.txt AC 4 ms
1,560 KB
99_system_test1.txt AC 4 ms
1,488 KB
99_system_test2.txt AC 5 ms
1,484 KB
99_system_test3.txt AC 3 ms
1,488 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

struct SCC {
    vector<vector<int>> G, G_r, G_out;
    vector<int> vs, used, cmp;
    SCC() = default;
    explicit SCC(int n) : G(n), G_r(n), G_out(n), used(n), cmp(n) {}

    void add_edge(int a, int b){
        G[a].emplace_back(b);
        G_r[b].emplace_back(a);
    }

    void dfs(int v){
        used[v] = 1;
        for (auto &&u : G[v]) if(!used[u]) dfs(u);
        vs.emplace_back(v);
    }

    void dfs_r(int v, int k){
        used[v] = 1;
        cmp[v] = k;
        for (auto &&u : G_r[v]) if(!used[u]) dfs_r(u, k);
    }

    int build() {
        int n = G.size();
        for (int i = 0; i < n; ++i) if(!used[i]) dfs(i);
        fill(used.begin(),used.end(), 0);
        int k = 0;
        for (int i = n - 1; i >= 0; --i) {
            if(!used[vs[i]]){
                dfs_r(vs[i], k++);
            }
        }
        G_out.resize(k);
        for (int i = 0; i < n; ++i) {
            for (auto &&j : G[i]) {
                if(cmp[i] != cmp[j]){
                    G_out[cmp[i]].emplace_back(cmp[j]);
                }
            }
        }
        for (int i = 0; i < k; ++i) {
            sort(G_out.begin(), G_out.end());
            G_out.erase(unique(G_out.begin(), G_out.end()), G_out.end());
        }
        return k;
    }

    int operator[](int k) const { return cmp[k]; }
};

struct TwoSAT {
    int n;
    SCC scc;
    explicit TwoSAT(int n) : n(n), scc(n*2) {};
    int negate(int v){
        int ret = n+v;
        if(ret >= n*2) ret -= n*2;
        return ret;
    }

    vector<int> build() {
        scc.build();
        vector<int> res(n);
        for (int i = 0; i < n; ++i) {
            if(scc[i] == scc[n+i]) return {};
            res[i] = scc[i] > scc[n+i];
        }
        return res;
    }

    void add_if(int u, int v){ // u -> v
        scc.add_edge(u, v);
        scc.add_edge(negate(v), negate(u));
    }

    void add_or(int u, int v){ // u || v
        add_if(negate(u), v);
    }
};

int main() {
    int n;
    cin >> n;
    if(n > 52){
        puts("Impossible");
        return 0;
    }
    vector<string> v(n);
    for (auto &&i : v) {
        cin >> i;
    }
    TwoSAT G(n);
    vector<string> a(2*n), b(2*n);
    for (int i = 0; i < n; ++i) {
        a[i] = v[i].substr(0, 1);
        a[i+n] = v[i].substr(2, 1);
        b[i] = v[i].substr(1, 2);
        b[i+n] = v[i].substr(0, 2);
    }
    for (int i = 0; i < 2*n; ++i) {
        for (int j = i+1; j < 2*n; ++j) {
            if(a[i] == a[j] || b[i] == b[j]){
                G.add_if(i, G.negate(j));
            }
        }
    }

    auto ret = G.build();
    if(ret.empty()){
        puts("Impossible");
    }else {
        for (int i = 0; i < n; ++i) {
            if(ret[i]){
                cout << a[i] << " " << b[i] << "\n";
            }else {
                cout << b[i+n] << " " << a[i+n] << "\n";
            }
        }
    }
    return 0;
}
0