oj.uz

답안 #535787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535787 2022-03-11T08:05:26 Z browntoad Unique Cities (JOI19_ho_t5) C++14
4 / 100
 122 ms 596 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=2005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
vector<int> graph[maxn];
vector<int> typ(maxn);
vector<int> tot(maxn);
vector<int> c(maxn);
void dfs(int x, int prev, int lay){
    if (lay!=0){
        if (typ[lay]!=0){
            typ[lay]=-1;
        }
        else {
            typ[lay]=c[x];
        }
    }
    REP(i,SZ(graph[x])){
        if (graph[x][i]==prev) continue;
        dfs(graph[x][i], x, lay+1);
    }
}
signed main (){
    IOS();
    int n; cin>>n;
    int m; cin>>m;
    REP(i,n-1){
        int x, y; cin>>x>>y;
        graph[x].pb(y);
        graph[y].pb(x);
    }
    REP1(i, n) cin>>c[i];
    FOR(i,1,n+1){
        REP(i, n+1){
            typ[i]=0;
            tot[i]=0;
        }
        dfs(i, -1, 0);
        int ans=0;
        REP1(j, n){
            if (typ[j]!=-1){
                tot[typ[j]]=1;
            }
        }
        REP1(j, m){
            ans+=tot[j];
        }
        cout<<ans<<endl;
    }
}
/*
2 3
2 1
2 1
2
2
2
*/

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 90 ms 496 KB Output is correct
3 Correct 25 ms 500 KB Output is correct
4 Correct 95 ms 512 KB Output is correct
5 Correct 99 ms 500 KB Output is correct
6 Correct 104 ms 560 KB Output is correct
7 Correct 101 ms 468 KB Output is correct
8 Correct 105 ms 508 KB Output is correct
9 Correct 122 ms 516 KB Output is correct
10 Correct 105 ms 504 KB Output is correct
11 Correct 106 ms 488 KB Output is correct
12 Correct 75 ms 504 KB Output is correct
13 Correct 116 ms 564 KB Output is correct
14 Correct 99 ms 468 KB Output is correct
15 Correct 101 ms 468 KB Output is correct
16 Correct 55 ms 436 KB Output is correct
17 Correct 87 ms 468 KB Output is correct
18 Correct 97 ms 528 KB Output is correct
19 Correct 102 ms 468 KB Output is correct
20 Correct 103 ms 468 KB Output is correct
21 Correct 105 ms 468 KB Output is correct
22 Correct 101 ms 496 KB Output is correct
23 Correct 111 ms 508 KB Output is correct
24 Correct 113 ms 504 KB Output is correct
25 Correct 106 ms 468 KB Output is correct
26 Correct 63 ms 468 KB Output is correct
27 Correct 115 ms 544 KB Output is correct
28 Correct 89 ms 536 KB Output is correct
29 Correct 100 ms 520 KB Output is correct
30 Correct 56 ms 516 KB Output is correct
31 Correct 78 ms 552 KB Output is correct
32 Correct 84 ms 468 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 90 ms 496 KB Output is correct
3 Correct 25 ms 500 KB Output is correct
4 Correct 95 ms 512 KB Output is correct
5 Correct 99 ms 500 KB Output is correct
6 Correct 104 ms 560 KB Output is correct
7 Correct 101 ms 468 KB Output is correct
8 Correct 105 ms 508 KB Output is correct
9 Correct 122 ms 516 KB Output is correct
10 Correct 105 ms 504 KB Output is correct
11 Correct 106 ms 488 KB Output is correct
12 Correct 75 ms 504 KB Output is correct
13 Correct 116 ms 564 KB Output is correct
14 Correct 99 ms 468 KB Output is correct
15 Correct 101 ms 468 KB Output is correct
16 Correct 55 ms 436 KB Output is correct
17 Correct 87 ms 468 KB Output is correct
18 Correct 97 ms 528 KB Output is correct
19 Correct 102 ms 468 KB Output is correct
20 Correct 103 ms 468 KB Output is correct
21 Correct 105 ms 468 KB Output is correct
22 Correct 101 ms 496 KB Output is correct
23 Correct 111 ms 508 KB Output is correct
24 Correct 113 ms 504 KB Output is correct
25 Correct 106 ms 468 KB Output is correct
26 Correct 63 ms 468 KB Output is correct
27 Correct 115 ms 544 KB Output is correct
28 Correct 89 ms 536 KB Output is correct
29 Correct 100 ms 520 KB Output is correct
30 Correct 56 ms 516 KB Output is correct
31 Correct 78 ms 552 KB Output is correct
32 Correct 84 ms 468 KB Output is correct
33 Runtime error 1 ms 596 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -