結果

問題 No.1153 ねこちゃんゲーム
ユーザー hotman78hotman78
提出日時 2020-08-07 22:45:08
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,431 ms / 2,500 ms
コード長 6,428 bytes
コンパイル時間 9,054 ms
コンパイル使用メモリ 452,008 KB
実行使用メモリ 304,776 KB
最終ジャッジ日時 2023-10-25 03:34:47
合計ジャッジ時間 59,227 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 4 ms
4,512 KB
testcase_03 AC 5 ms
4,516 KB
testcase_04 AC 5 ms
4,536 KB
testcase_05 AC 5 ms
4,516 KB
testcase_06 AC 4 ms
4,516 KB
testcase_07 AC 1,128 ms
186,240 KB
testcase_08 AC 1,086 ms
186,504 KB
testcase_09 AC 1,140 ms
186,240 KB
testcase_10 AC 1,136 ms
186,504 KB
testcase_11 AC 1,130 ms
186,240 KB
testcase_12 AC 1,119 ms
186,240 KB
testcase_13 AC 1,109 ms
186,504 KB
testcase_14 AC 1,155 ms
186,240 KB
testcase_15 AC 1,122 ms
186,504 KB
testcase_16 AC 1,122 ms
186,240 KB
testcase_17 AC 1,134 ms
189,672 KB
testcase_18 AC 1,162 ms
193,104 KB
testcase_19 AC 1,204 ms
193,104 KB
testcase_20 AC 1,220 ms
199,968 KB
testcase_21 AC 1,238 ms
199,968 KB
testcase_22 AC 1,140 ms
188,880 KB
testcase_23 AC 1,142 ms
191,520 KB
testcase_24 AC 1,144 ms
191,520 KB
testcase_25 AC 1,188 ms
196,800 KB
testcase_26 AC 1,231 ms
196,536 KB
testcase_27 AC 1,134 ms
286,296 KB
testcase_28 AC 1,169 ms
304,776 KB
testcase_29 AC 1,251 ms
293,952 KB
testcase_30 AC 1,148 ms
292,632 KB
testcase_31 AC 1,098 ms
234,816 KB
testcase_32 AC 1,394 ms
172,900 KB
testcase_33 AC 1,400 ms
172,884 KB
testcase_34 AC 1,423 ms
172,908 KB
testcase_35 AC 1,431 ms
172,872 KB
testcase_36 AC 1,425 ms
172,856 KB
testcase_37 AC 694 ms
176,848 KB
testcase_38 AC 667 ms
172,128 KB
testcase_39 AC 670 ms
172,128 KB
testcase_40 AC 704 ms
181,456 KB
testcase_41 AC 651 ms
172,080 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:53:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   53 | inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
      |                      ^~~~
main.cpp:60:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   60 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |            ^~~~
main.cpp:60:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   60 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |                          ^~~~
main.cpp:61:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   61 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |            ^~~~
main.cpp:61:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   61 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |                          ^~~~
main.cpp:76:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   76 |     reroot(auto g):g(g),p_list(g.size(),-1),p_checked(g.size(),0),table(g.size()){
      |            ^~~~

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<int64_t> range(int64_t n){vector<int64_t>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<int64_t> range(int64_t a,int64_t b){vector<int64_t>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<int64_t> range(int64_t a,int64_t b,int64_t c){vector<int64_t>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
//inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
//inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}

template<typename T>
struct reroot{
    vector<vector<lint>>g;
    vector<lint>p_list;
    vector<T>p_table;
    vector<bool>p_checked;
    vector<map<lint,T>>table;
    vector<T>ans;
    reroot(auto g):g(g),p_list(g.size(),-1),p_checked(g.size(),0),table(g.size()){
        p_table.resize(g.size(),e);
        ans.resize(g.size(),e);
        dfs1(0,-1);
        for(int i=0;i<(int)g.size();++i)ans[i]=dfs2(i,-1);
    }
    T dfs1(lint n,lint p){
        p_list[n]=p;
        T tmp1=e,tmp2=e;
        vector<T>tmp(g[n].size());
        rep(i,g[n].size()){
            lint t=g[n][i];
            if(t==p)continue;
            table[n][t]=tmp1;
            tmp1=f(tmp1,tmp[i]=dfs1(t,n));
        }
        for(lint i=g[n].size()-1;i>=0;--i){
            lint t=g[n][i];
            if(t==p)continue;
            table[n][t]=f(table[n][t],tmp2);
            tmp2=f(tmp[i],tmp2);
        }
        return fix(table[n][p]=tmp1,n,p);
    }
    T dfs2(lint n,lint p){
        if(n==-1)return e;
        if(!p_checked[n]){
            p_checked[n]=1;
            p_table[n]=dfs2(p_list[n],n);
        }
        if(p==-1){
            return f(table[n][p_list[n]],p_table[n]);
        }else{
            if(p_list[n]==-1)return fix(table[n][p],n,p);
            else return fix(f(table[n][p],p_table[n]),n,p);
        }
    }
    vector<T>query(){
        return ans;
    }
    T e=make_tuple(0,map<int,int>(),-1);
    T f(T s,T t){
        for(auto e:get<1>(t)){
            if(e.second!=-1)get<1>(s)[e.first]=e.second;
        }
        return s;
    }
    T fix(T s,int n,int p){
        get<0>(s)=0;
        for(auto e:get<1>(s)){
            if(e.first==get<0>(s))get<0>(s)++;
            else break;
        }
        get<1>(s).clear();
        get<1>(s)[get<0>(s)]=n;
        get<2>(s)=n;
        return s;
    }
};

int main(){
    lint n,m;
    cin>>n>>m;
    vec a(m);
    rep(i,m)cin>>a[i];
    rep(i,m)a[i]--;
    mat g(n);
    rep(i,n-1){
        lint s,t;
        cin>>s>>t;
        s--;t--;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    auto e=reroot<tuple<int,map<int,int>,int>>(g).query();
    vec mex(n);
    rep(i,n){
        mex[i]=0;
        for(auto d:get<1>(e[i])){
            if(d.first==mex[i])mex[i]++;
            else break;
        }
    }
    lint ans=0;
    rep(i,m){
        ans^=mex[a[i]];
    }
    if(ans==0){
        cout<<-1<<" "<<-1<<endl;
        return 0;
    }
    rep(i,m){
        if((ans^mex[a[i]])<mex[a[i]]){
            cout<<i+1<<" "<<get<1>(e[a[i]])[ans^mex[a[i]]]+1<<endl;
        }
    }

}
0