結果

問題 No.1153 ねこちゃんゲーム
ユーザー xllend3xllend3
提出日時 2020-08-07 23:15:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,581 bytes
コンパイル時間 1,956 ms
コンパイル使用メモリ 178,816 KB
実行使用メモリ 88,740 KB
最終ジャッジ日時 2024-09-25 00:02:56
合計ジャッジ時間 21,533 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
88,740 KB
testcase_01 AC 14 ms
40,528 KB
testcase_02 WA -
testcase_03 AC 15 ms
40,524 KB
testcase_04 WA -
testcase_05 AC 15 ms
38,476 KB
testcase_06 WA -
testcase_07 AC 311 ms
51,352 KB
testcase_08 AC 296 ms
47,564 KB
testcase_09 AC 293 ms
51,220 KB
testcase_10 AC 311 ms
47,692 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 312 ms
48,920 KB
testcase_14 WA -
testcase_15 AC 319 ms
51,736 KB
testcase_16 AC 300 ms
49,044 KB
testcase_17 WA -
testcase_18 AC 303 ms
51,788 KB
testcase_19 WA -
testcase_20 AC 308 ms
49,000 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 312 ms
49,996 KB
testcase_24 WA -
testcase_25 AC 319 ms
47,692 KB
testcase_26 AC 290 ms
47,688 KB
testcase_27 WA -
testcase_28 AC 314 ms
61,132 KB
testcase_29 AC 350 ms
71,412 KB
testcase_30 AC 350 ms
65,864 KB
testcase_31 AC 344 ms
74,700 KB
testcase_32 TLE -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define rep(i,a,n) for(int i=(a);i<=(n);++i)
#define dep(i,a,n) for(int i=(a);i>=(n);--i)
#define eps 1e-8
#define pi 3.1415926535897
#define sqr(x) ((x)*(x))
#define SZ(x) ((int)(x).size())
#define CPY(a,b) memcpy(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define POSIN(x,y) (1<=(x)&&(x)<=m&&1<=(y)&&(y)<=n)
#define ALL(x) (x).begin(),(x).end()
#define COUT(S,x) cout<<fixed<<setprecision(x)<<S<<endl
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#else
#define debug(...) 
#define dbg(x) 
#endif
template<typename T> bool MAX(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool MIN(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
typedef long long ll;
typedef double lf;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<lf,lf> pff;
typedef complex<double> CD;
typedef vector<int> VI;
typedef vector<ll> VL;
const int inf=0x3f3f3f3f;
const int mo=1000000007;
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
template<class T1,class T2>inline void gn(T1&r,T2&s){gn(r),gn(s);}
template<class T1,class T2,class T3>inline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);}
template<class T1,class T2,class T3,class T4>inline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};
ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
//*******************************************

const int N=1111111,M=111111;
int l,m,n,t,C,vis[N];
vector<int>a[N];
int v[N];
map<pii,int>MA;
int qa[N],qb[N],qc[N],fa[N];
int que(int x,int y){
	if(x==0)return qa[y];
	if(fa[x]==y)return qb[x];
	return qc[y];
}
int fu(int x,int y,int z){
	if(x==0)return qa[y]=z;
	if(fa[x]==y)return qb[x]=z;
	return qc[y]=z;
}
int cal(int x,int y){
	if(que(x,y)!=-1)return que(x,y);
	set<int>S;
	for(auto i:a[y])if(i!=x){
		S.insert(cal(y,i));
	}
	for(int i=0;;++i)if(S.find(i)==S.end()){
		return fu(x,y,i);
	}
}
void dfs(int x,int f){
	for(auto i:a[x])if(i!=f)dfs(i,x);fa[x]=f;
}
int main(){
#ifdef LOCAL
	freopen("E.in","r",stdin);//freopen("E.out","w",stdout);
#endif
	scanf("%d%d",&n,&m);
	rep(i,0,n+1)qa[i]=qb[i]=qc[i]=-1;
	rep(i,1,m)scanf("%d",&v[i]);
	rep(i,1,n-1){
		int x,y;
		scanf("%d%d",&x,&y);a[x].pb(y);a[y].pb(x);
	}
	dfs(1,0);
	int ans=0;
	rep(i,1,m)ans^=cal(0,v[i]);
	if(ans==0){
		puts("-1 -1");
	}else{
		pii res;int ok=0;
		rep(i,1,m){
			if(vis[v[i]])continue;
			for(auto j:a[v[i]])if(ans^cal(0,v[i])^cal(v[i],j)==0){
				res=mp(i,j);ok=1;break;
			}if(ok)break;
			vis[v[i]]=1;
		}
		printf("%d %d\n",res.X,res.Y);
	}
	return 0;
}
0