結果

問題 No.1612 I hate Construct a Palindrome
ユーザー mtsdmtsd
提出日時 2021-07-21 23:10:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 10,643 bytes
コンパイル時間 2,344 ms
コンパイル使用メモリ 200,460 KB
実行使用メモリ 18,240 KB
最終ジャッジ日時 2024-07-17 20:16:38
合計ジャッジ時間 6,618 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 138 ms
14,544 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 145 ms
14,544 KB
testcase_06 AC 120 ms
12,972 KB
testcase_07 AC 121 ms
12,968 KB
testcase_08 AC 117 ms
12,848 KB
testcase_09 AC 112 ms
12,592 KB
testcase_10 AC 122 ms
12,712 KB
testcase_11 AC 122 ms
12,588 KB
testcase_12 AC 129 ms
13,124 KB
testcase_13 AC 123 ms
13,116 KB
testcase_14 AC 131 ms
13,008 KB
testcase_15 AC 243 ms
18,228 KB
testcase_16 AC 250 ms
18,240 KB
testcase_17 AC 228 ms
18,220 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 3 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 3 ms
5,376 KB
testcase_24 AC 3 ms
5,376 KB
testcase_25 AC 3 ms
5,376 KB
testcase_26 AC 3 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'std::pair<std::__cxx11::basic_string<char>, std::vector<int> > shortest_path(std::vector<std::vector<std::tuple<int, char, int> > >&, int, int)':
main.cpp:200:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  200 |                 auto [id,c,eid] = pre[T];
      |                      ^
main.cpp:209:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  209 |         for(auto [nxt,c,eid]:g[id]){
      |                  ^
main.cpp: In function 'int main()':
main.cpp:237:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  237 |     auto [X,A,eid] = g[0][0];
      |          ^
main.cpp:240:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  240 |     for(auto [a,b,c,id]:E){
      |              ^
main.cpp: In function 'std::pair<std::__cxx11::basic_string<char>, std::vector<int> > shortest_path(std::vector<std::vector<std::tuple<int, char, int> > >&, int, int)':
main.cpp:217:1: warning: control reaches end of non-void function [-Wreturn-type]
  217 | }
      | ^
main.cpp: In function 'int main()':
main.cpp:252:33: warning: 'T' may be used uninitialized [-Wmaybe-uninitialized]
  252 |     auto R = shortest_path(g,X,T);
      |                                 ^
main.cpp:238:11: note: 'T' was declared here
  238 |     int S,T,xxid;
      |           ^
main.cpp:251:33: warning: 'S' may be used uninitialized [-Wmaybe-uninitialized]
  251 |     auto Q = shortest_path(g,X,S);
      |                                 ^
main.cpp:238:9: note: 'S' was declared here
  238 |     int S,T,xxid;
      |         ^
main.cpp:264:18: warning: 'B' may be used uninitialized [-Wmaybe-uninitialized]
  264 |     str.push_back(B);
      |     ~~~~~~~~~~~~~^~~
main.cpp:239:10: note: 'B' was declared here
  239 |     char B;
      |          ^

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    os << "{";
    for (int i = 0; i<(int)vec.size(); i++) {
        os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "{";
    for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if(itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
    os << "{";
    for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
        os << (*itr);
        ++itr;
        if(itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                                                                                                  \
    vector<type> name(size);                                                                                                                                   \
    IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                                                                                                   \
    vector<vector<type>> name(h, vector<type>(w));                                                                                                             \
    IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)                                                                                                                         \
    vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...)                                                                                                                                               \
    int __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define LL(...)                                                                                                                                                \
    ll __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
#define STR(...)                                                                                                                                               \
    string __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define CHR(...)                                                                                                                                               \
    char __VA_ARGS__;                                                                                                                                          \
    IN(__VA_ARGS__)
#define DBL(...)                                                                                                                                               \
    double __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
    scan(head);
    IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define dbg(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}
template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x + y - 1) / y);}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }


template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto e : a) v.emplace_back(e);
    fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto &&e : a) e = lb(v, e);
    renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
    vector<S> v;
    fold_in(v, head, args...);
    sort(all(v)), v.erase(unique(all(v)), v.end());
    renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
pair<string,vector<int> > shortest_path(vector<vector<tuple<int,char,int > > > &g,int S,int T){
    if(S==T){
        return MP("",vector<int>());
    }
    queue<int> q;
    int n = g.size();
    vector<bool> flag(n);
    vector<tuple<int,char,int>> pre(n,MT(inf,'?',inf));
    pre[S] = MT(0,'?',0);
    flag[S] = 1;
    q.push(S);
    while(!q.empty()){
        auto id = q.front();
        dbg(id,T);
        q.pop();
        if(id==T){
            string s;
            vector<int> p;
            while(T!=S){
                dbg(T);
                auto [id,c,eid] = pre[T];
                s.push_back(c);
                p.push_back(eid);
                T = id;
            }
            reverse(all(s));
            reverse(all(p));
            return MP(s,p);
        }
        for(auto [nxt,c,eid]:g[id]){
            if(!flag[nxt]){
                flag[nxt] = 1;
                pre[nxt] = MT(id,c,eid);
                q.push(nxt);
            }
        }
    }
}
int main(){
    INT(n,m);
    vector<vector<tuple<int,char,int > > > g(n);
    vector<tuple<int,int,char,int> > E;
    set<char>st;
    rep(i,m){
        INT(a,b);
        char c;
        cin >> c;
        a--;b--;
        g[a].push_back(MT(b,c,i+1));
        g[b].push_back(MT(a,c,i+1));
        E.push_back(MT(a,b,c,i+1));
        st.insert(c);
    }
    if(st.size()==1){
        cout << -1 << endl;
        return 0;
    }
    auto [X,A,eid] = g[0][0];
    int S,T,xxid;
    char B;
    for(auto [a,b,c,id]:E){
        if(A!=c){
            B = c;
            S = a;
            T = b;
            xxid = id;
            break;
        }
    }
    dbg(X,S,T);
    auto P = shortest_path(g,0,X);
    auto Q = shortest_path(g,X,S);
    auto R = shortest_path(g,X,T);
    if(Q.first.size() > R.first.size()){
        swap(Q,R);
        swap(S,T);
    }
    auto ZZ = shortest_path(g,T,n-1);
    string str;
    vector<int> e;
    str.push_back(A);
    e.push_back(eid);
    str += Q.first;
    for(auto x:Q.second)e.push_back(x);
    str.push_back(B);
    e.push_back(xxid);
    str += ZZ.first;
    for(auto x:ZZ.second)e.push_back(x);
    dbg(str);
    int M = str.size();
    rep(i,M){
        if(str[i]!=str[M-1-i]){
            cout << e.size() << "\n";
            for(auto x:e){
                cout << x << "\n";
            }
            return 0;
        }
    }
    cout << e.size()+2 << "\n";
    cout << e[0] << "\n";
    cout << e[0] << "\n";
    for(auto x:e){
        cout << x << "\n";
    }
    return 0;
}
0