Submission #2230645
Source Code Expand
// G++ MACRO.CPP -STD=C++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}
#define ALL(obj) (obj).begin(),(obj).end()
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
seco.resize(head);
VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
VECCIN(head);
VT2(move(tail)...);
}
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
seco[head]=IN();
VT3(head,move(tail)...);
}
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int
#define P pair<int,int>
#define V vector<int>
#define M map<int,int>
#define S set<int>
#define pb(a) push_back(a)
#define mp make_pair
#define T (flag?a:b)
bool Check(int p){
}
int main(){
//片側が次数1の頂点に移動させられた時: 無限ループが発生する
//1回で距離1しか移動できないため、必ず押し戻しが発生する
//高橋くんが最初に移動させた先の(青木くんが石を取る)頂点の石数=青木くんが耐えられるターン数?
//高橋くんが耐えられるターン数=青木くんが石を取る頂点と隣接する頂点の中で、最も石数が小さいもの
CIN(n);VC1(n,a);VC2(n-1,x,y);
REP(i,n-1){x[i]--;y[i]--;}
vector<V> edges(n);REP(i,n-1){edges[x[i]].pb(y[i]);edges[y[i]].pb(x[i]);}
/*
V min_goku(n,MOD);//その頂点と隣接する頂点の中での、石数の最小値
REP(i,n)
REP(j,edges[i].size())
min_goku[i] = min(min_goku[i] , a[ edges[i][j] ]);
*/
V ans;//解答を保存しておく
auto check = [&](int p){
REP(i,edges[p].size()){//最初にどの方向へ移動させればいいかを考える
int stone_min = MOD;
REP(j,edges[ edges[p][i] ].size()){//青木くんがどちらへ移動させるか
stone_min = min(stone_min , a[edges[edges[p][i]][j]]);
}
/*
dump(a[edges[p][i]]);
dump(stone_min);ENDL;
*/
if(a[ edges[p][i] ] <= stone_min ) return true;
}
return false;
};
REP(i,n){//全ての頂点に対して
a[i]--;//最初に置く場所なので値を減らす 次の頂点について調べる時は値を戻す
//if(i == 1)
if(check(i)) ans.pb(i + 1);//判定関数を走らせる
a[i]++;
}
VECCOUT(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Tree Game |
User |
shibh308 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4421 Byte |
Status |
WA |
Exec Time |
13 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt |
All |
sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in5.txt, in50.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
WA |
4 ms |
512 KB |
in10.txt |
WA |
4 ms |
512 KB |
in11.txt |
WA |
4 ms |
512 KB |
in12.txt |
WA |
2 ms |
256 KB |
in13.txt |
WA |
2 ms |
256 KB |
in14.txt |
WA |
4 ms |
512 KB |
in15.txt |
WA |
4 ms |
512 KB |
in16.txt |
WA |
4 ms |
512 KB |
in17.txt |
WA |
4 ms |
512 KB |
in18.txt |
WA |
4 ms |
512 KB |
in19.txt |
WA |
4 ms |
512 KB |
in2.txt |
WA |
4 ms |
512 KB |
in20.txt |
WA |
4 ms |
512 KB |
in21.txt |
WA |
4 ms |
512 KB |
in22.txt |
WA |
4 ms |
512 KB |
in23.txt |
WA |
4 ms |
512 KB |
in24.txt |
WA |
4 ms |
512 KB |
in25.txt |
WA |
4 ms |
512 KB |
in26.txt |
WA |
4 ms |
512 KB |
in27.txt |
WA |
4 ms |
512 KB |
in28.txt |
WA |
4 ms |
512 KB |
in29.txt |
WA |
4 ms |
512 KB |
in3.txt |
WA |
4 ms |
512 KB |
in30.txt |
WA |
4 ms |
512 KB |
in31.txt |
AC |
13 ms |
512 KB |
in32.txt |
AC |
13 ms |
512 KB |
in33.txt |
AC |
13 ms |
512 KB |
in34.txt |
AC |
13 ms |
512 KB |
in35.txt |
AC |
13 ms |
512 KB |
in36.txt |
AC |
1 ms |
256 KB |
in37.txt |
AC |
1 ms |
256 KB |
in38.txt |
AC |
1 ms |
256 KB |
in39.txt |
AC |
1 ms |
256 KB |
in4.txt |
WA |
4 ms |
512 KB |
in40.txt |
AC |
4 ms |
512 KB |
in41.txt |
AC |
4 ms |
512 KB |
in42.txt |
AC |
4 ms |
512 KB |
in43.txt |
AC |
4 ms |
512 KB |
in44.txt |
AC |
4 ms |
512 KB |
in45.txt |
AC |
4 ms |
512 KB |
in46.txt |
AC |
4 ms |
512 KB |
in47.txt |
WA |
4 ms |
512 KB |
in48.txt |
WA |
4 ms |
512 KB |
in49.txt |
WA |
4 ms |
512 KB |
in5.txt |
WA |
3 ms |
384 KB |
in50.txt |
WA |
4 ms |
512 KB |
in6.txt |
WA |
4 ms |
512 KB |
in7.txt |
WA |
4 ms |
512 KB |
in8.txt |
WA |
4 ms |
512 KB |
in9.txt |
WA |
4 ms |
512 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |