結果

問題 No.1612 I hate Construct a Palindrome
ユーザー SumitacchanSumitacchan
提出日時 2021-07-21 22:09:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 563 ms / 2,000 ms
コード長 4,496 bytes
コンパイル時間 1,929 ms
コンパイル使用メモリ 186,528 KB
実行使用メモリ 84,368 KB
最終ジャッジ日時 2024-07-17 18:45:56
合計ジャッジ時間 10,081 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 5 ms
6,944 KB
testcase_02 AC 516 ms
51,464 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 6 ms
6,940 KB
testcase_05 AC 527 ms
51,612 KB
testcase_06 AC 334 ms
51,264 KB
testcase_07 AC 336 ms
51,268 KB
testcase_08 AC 305 ms
50,960 KB
testcase_09 AC 290 ms
50,380 KB
testcase_10 AC 305 ms
50,352 KB
testcase_11 AC 305 ms
50,284 KB
testcase_12 AC 326 ms
54,132 KB
testcase_13 AC 328 ms
54,104 KB
testcase_14 AC 383 ms
54,092 KB
testcase_15 AC 563 ms
84,368 KB
testcase_16 AC 552 ms
84,356 KB
testcase_17 AC 545 ms
84,224 KB
testcase_18 AC 3 ms
6,940 KB
testcase_19 AC 3 ms
6,940 KB
testcase_20 AC 3 ms
6,944 KB
testcase_21 AC 3 ms
6,940 KB
testcase_22 AC 4 ms
6,940 KB
testcase_23 AC 3 ms
6,940 KB
testcase_24 AC 4 ms
6,940 KB
testcase_25 AC 4 ms
6,940 KB
testcase_26 AC 4 ms
6,944 KB
testcase_27 AC 2 ms
6,944 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,944 KB
testcase_30 AC 2 ms
6,944 KB
testcase_31 AC 2 ms
6,944 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 1 ms
6,940 KB
testcase_38 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    vec dijkstra(int s, int t, v_Pii &prev){
        prev.resize(N);
        vec d(N);
        priority_queue<Pii, vector<Pii>, greater<Pii>> que;
        fill(d.begin(), d.end(), INF);
        d[s] = 0;
        prev[s] = Pii(-1, -1);
        que.push(Pii(0, s));

        while(!que.empty()){
            Pii p = que.top(); que.pop();
            int v = p.second;
            if(v == t) return d;
            if(d[v] < p.first) continue;
            REP(i, G[v].size()){
                edge e = G[v][i];
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    prev[e.to] = Pii(v, e.id);
                    que.push(Pii(d[e.to], e.to));
                }
            }
        }
        return d;
    }

};

signed main(){

    int N, M; cin >> N >> M;
    vec a(M), b(M);
    vector<char> c(M);
    REP(i, M){
        cin >> a[i] >> b[i] >> c[i];
        a[i]--; b[i]--;
    }

    Graph G(4 * N);
    REP(i, M){
        if(c[i] == c[0]){
            REP(k, 4){
                G.add_Directed_edge(k * N + a[i], (k | 1) * N + b[i], 1, i);
                G.add_Directed_edge(k * N + b[i], (k | 1) * N + a[i], 1, i);
            }
        }else{
            REP(k, 4){
                G.add_Directed_edge(k * N + a[i], (k | 2) * N + b[i], 1, i);
                G.add_Directed_edge(k * N + b[i], (k | 2) * N + a[i], 1, i);
            }
        }
    }

    v_Pii prev;
    vec d = G.dijkstra(0, -1, prev);
    if(d[4 * N - 1] == INF){
        Out(-1);
        return 0;
    }

    vec ans;
    string res;
    int now = 4 * N - 1;
    while(now != 0){
        ans.pb(prev[now].se);
        res += c[prev[now].se];
        now = prev[now].fi;
    }
    Reverse(ans);
    Reverse(res);

    string res2 = res; Reverse(res);
    if(res == res2){
        int i = G.G[N - 1][0].id;
        ans.pb(i); ans.pb(i);
    }
    Out(SZ(ans));
    for(int i: ans) Out(i + 1);

    return 0;
}
0