Submission #99733

#	Time	Username	Problem	Language	Result	Execution time	Memory
99733		kjp4155	Unique Cities (JOI19_ho_t5)	C++17	0 / 100	255 ms	17876 KiB

joi2019_ho_t5

#include <bits/stdc++.h>

using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }

void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //cout << setprecision(15);
}

#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define endl '\n'

typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+7;

pii operator + (pii a, pii b){
    return pii(a.Fi+b.Fi, a.Se+b.Se);
}

int N,M;
vector<int> E[200200];
int C[200200], ans[200200];
pii D[200200][2], U[200200], A[200200][2];
void put(pii* X, pii val){
    if( X[0].Fi == val.Fi ) X[0].Se += val.Se;
    else if( X[1].Fi == val.Fi ) X[1].Se += val.Se;
    else if( X[0].Fi < val.Fi ){ X[1] = X[0]; X[0] = val;}
    else if( X[1].Fi < val.Fi ) X[1] = val;
}
pii except(pii* X, pii val){
    if( X[0].Fi != val.Fi ) return X[0];
    if( X[0].Se - val.Se > 0 ) return X[0] + pii(0, -val.Se);
    return X[1];
}
void dfs1(int x, int pa){
    for(auto e : E[x])if( e != pa ) dfs1(e,x);
    put(D[x], pii(0,1));
    for(auto e : E[x])if( e != pa ){
        if( D[e][0].Fi != -1 ) put(D[x], D[e][0] + pii(1,0));
    //    if( D[e][1].Fi != -1 ) put(D[x], D[e][1] + pii(1,0));
    }
}
void dfs2(int x, int pa){
    
    if( pa == -1 ) U[x] = {-1,0};
    else{
        U[x] = except(D[pa], D[x][0] + pii(1,0));
        U[x] = U[x] + pii(1,0);
        if( U[pa].Fi+1 == U[x].Fi ) U[x].Se += U[pa].Se;
        else if( U[pa].Fi+1 > U[x].Fi ) U[x] = U[pa] + pii(1,0);    
    }
    
    pii res = U[x];
    if( D[x][0].Fi > res.Fi ) res = D[x][0];
    else if( D[x][0].Fi == res.Fi ) res.Se += D[x][0].Se;
    if( res.Fi > 0 && res.Se == 1 ) ans[x] = 1;
    
    for(auto e : E[x])if( e != pa ) dfs2(e,x);
}

int main(){
    scanf("%d%d",&N,&M);
    repp(i,N) D[i][0] = D[i][1] = A[i][0] = A[i][1] = {-1,0};
    repp(i,N-1){
        int a,b; scanf("%d%d",&a,&b);
        E[a].pb(b); E[b].pb(a);
    }
    repp(i,N) scanf("%d",&C[i]);


    dfs1(1,-1);
    dfs2(1, -1);

    //repp(i,N) Debug(i, D[i][0], D[i][1], U[i]);
    repp(i,N) printf("%d\n",ans[i]);
}

Compilation message (stderr)

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:116:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t5.cpp:119:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int a,b; scanf("%d%d",&a,&b);
                  ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t5.cpp:122:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     repp(i,N) scanf("%d",&C[i]);
               ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32