oj.uz

답안 #208104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208104 2020-03-10T03:46:05 Z coldEr66 Unique Cities (JOI19_ho_t5) C++14
4 / 100
 364 ms 3448 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"LINE: %d (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=2e3+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

int c[MAXn];
vector<int> d[MAXn],e[MAXn];
void dfs(int x,int p,int dep){
    d[dep].eb(x);
    for (auto i:e[x]) {
        if (i == p) continue;
        dfs(i,x,dep+1);
    }
}
int main(){
    IOS();
    int n,m;
    cin >> n >> m;
    REP (i,n-1) {
        int u,v;
        cin >> u >> v;
        u--, v--;
        e[u].eb(v);
        e[v].eb(u);
    }
    pary(e,e+n);
    REP (i,n) cin >> c[i];
    REP (i,n) {
        REP (j,n+1) d[j].clear();
        dfs(i,i,0);
        set<int> st;
        pary(d,d+n);
        REP1 (j,n) {
            if (SZ(d[j]) == 1) {
                st.insert(c[d[j][0]]);
            }
        }
        cout << SZ(st) << endl;
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 71 ms 504 KB Output is correct
3 Correct 79 ms 636 KB Output is correct
4 Correct 101 ms 760 KB Output is correct
5 Correct 86 ms 504 KB Output is correct
6 Correct 150 ms 760 KB Output is correct
7 Correct 106 ms 636 KB Output is correct
8 Correct 83 ms 504 KB Output is correct
9 Correct 128 ms 504 KB Output is correct
10 Correct 89 ms 632 KB Output is correct
11 Correct 93 ms 636 KB Output is correct
12 Correct 53 ms 504 KB Output is correct
13 Correct 143 ms 760 KB Output is correct
14 Correct 95 ms 1400 KB Output is correct
15 Correct 103 ms 1468 KB Output is correct
16 Correct 41 ms 504 KB Output is correct
17 Correct 109 ms 3320 KB Output is correct
18 Correct 97 ms 1528 KB Output is correct
19 Correct 86 ms 504 KB Output is correct
20 Correct 364 ms 888 KB Output is correct
21 Correct 129 ms 760 KB Output is correct
22 Correct 82 ms 504 KB Output is correct
23 Correct 94 ms 632 KB Output is correct
24 Correct 92 ms 632 KB Output is correct
25 Correct 88 ms 504 KB Output is correct
26 Correct 55 ms 504 KB Output is correct
27 Correct 252 ms 760 KB Output is correct
28 Correct 200 ms 3320 KB Output is correct
29 Correct 112 ms 1528 KB Output is correct
30 Correct 41 ms 504 KB Output is correct
31 Correct 178 ms 3448 KB Output is correct
32 Correct 126 ms 1656 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 71 ms 504 KB Output is correct
3 Correct 79 ms 636 KB Output is correct
4 Correct 101 ms 760 KB Output is correct
5 Correct 86 ms 504 KB Output is correct
6 Correct 150 ms 760 KB Output is correct
7 Correct 106 ms 636 KB Output is correct
8 Correct 83 ms 504 KB Output is correct
9 Correct 128 ms 504 KB Output is correct
10 Correct 89 ms 632 KB Output is correct
11 Correct 93 ms 636 KB Output is correct
12 Correct 53 ms 504 KB Output is correct
13 Correct 143 ms 760 KB Output is correct
14 Correct 95 ms 1400 KB Output is correct
15 Correct 103 ms 1468 KB Output is correct
16 Correct 41 ms 504 KB Output is correct
17 Correct 109 ms 3320 KB Output is correct
18 Correct 97 ms 1528 KB Output is correct
19 Correct 86 ms 504 KB Output is correct
20 Correct 364 ms 888 KB Output is correct
21 Correct 129 ms 760 KB Output is correct
22 Correct 82 ms 504 KB Output is correct
23 Correct 94 ms 632 KB Output is correct
24 Correct 92 ms 632 KB Output is correct
25 Correct 88 ms 504 KB Output is correct
26 Correct 55 ms 504 KB Output is correct
27 Correct 252 ms 760 KB Output is correct
28 Correct 200 ms 3320 KB Output is correct
29 Correct 112 ms 1528 KB Output is correct
30 Correct 41 ms 504 KB Output is correct
31 Correct 178 ms 3448 KB Output is correct
32 Correct 126 ms 1656 KB Output is correct
33 Runtime error 5 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -