oj.uz

답안 #878816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878816 2023-11-25T09:27:27 Z niter Unique Cities (JOI19_ho_t5) C++14
4 / 100
 2000 ms 21896 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ins isnert
#define pii pair<int,int>
#define ff first
#define ss second
#define loop(i,a,b) for(int i = (a); i < (b); i ++)
#define op(x) cerr << #x << " = " << x << endl;
#define opa(x) cerr << #x << " = " << x << ", ";
#define ops(x) cerr << x;
#define spac cerr << ' ';
#define entr cerr << endl;
#define STL(x) cerr << #x << " : "; for(auto &qwe:x) cerr << qwe << ' '; cerr << endl;
#define ARR(x, nnn) cerr << #x << " : "; loop(qwe,0,nnn) cerr << x[qwe] << ' '; cerr << endl;
#define BAE(x) (x).begin(), (x).end()
#define bye exit(0);
using namespace std;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int mxn = (int)(2e5) + 10;
vector<int> E[mxn];
int col[mxn];

vector<int> vec_col[mxn];
void dfs(int v, int par, int dis){
    vec_col[dis].pb(col[v]);
    for(auto &u:E[v]){
        if(u == par) continue;
        dfs(u, v, dis + 1);
    }
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    int n, m; cin >> n >> m;
    loop(i,0,n-1){
        int a, b;
        cin >> a >> b;
        E[a].pb(b);
        E[b].pb(a);
    }
    vector<int> srt_col;
    loop(i,1,n+1){
        cin >> col[i];
        srt_col.pb(col[i]);
    }
    sort(BAE(srt_col));
    srt_col.resize(unique(BAE(srt_col)) - srt_col.begin());
    loop(i,1,n+1){
        col[i] = lower_bound(BAE(srt_col), col[i]) - srt_col.begin() + 1;
    }
    loop(i,1,n+1){
        loop(i,1,n+1) vec_col[i].clear();
        vector<int> vec_ans;
        dfs(i, -1, 0);
        loop(i,1,n+1){
            if(vec_col[i].size() == 1){
                vec_ans.pb(vec_col[i][0]);
            }
        }
        sort(BAE(vec_ans));
        vec_ans.resize(unique(BAE(vec_ans)) - vec_ans.begin());
        cout << vec_ans.size() << '\n';
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 36 ms 10760 KB Output is correct
3 Correct 33 ms 10588 KB Output is correct
4 Correct 47 ms 10844 KB Output is correct
5 Correct 37 ms 10772 KB Output is correct
6 Correct 106 ms 10872 KB Output is correct
7 Correct 51 ms 10840 KB Output is correct
8 Correct 33 ms 10584 KB Output is correct
9 Correct 39 ms 10588 KB Output is correct
10 Correct 37 ms 10844 KB Output is correct
11 Correct 38 ms 10808 KB Output is correct
12 Correct 27 ms 10760 KB Output is correct
13 Correct 93 ms 10872 KB Output is correct
14 Correct 43 ms 11608 KB Output is correct
15 Correct 47 ms 11504 KB Output is correct
16 Correct 24 ms 10752 KB Output is correct
17 Correct 64 ms 13428 KB Output is correct
18 Correct 51 ms 11608 KB Output is correct
19 Correct 36 ms 10584 KB Output is correct
20 Correct 152 ms 11108 KB Output is correct
21 Correct 57 ms 10924 KB Output is correct
22 Correct 33 ms 10588 KB Output is correct
23 Correct 39 ms 10740 KB Output is correct
24 Correct 36 ms 10588 KB Output is correct
25 Correct 37 ms 10584 KB Output is correct
26 Correct 27 ms 10588 KB Output is correct
27 Correct 108 ms 10852 KB Output is correct
28 Correct 80 ms 13136 KB Output is correct
29 Correct 47 ms 11600 KB Output is correct
30 Correct 26 ms 10588 KB Output is correct
31 Correct 91 ms 13300 KB Output is correct
32 Correct 54 ms 11860 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2009 ms 18564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2053 ms 21896 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 36 ms 10760 KB Output is correct
3 Correct 33 ms 10588 KB Output is correct
4 Correct 47 ms 10844 KB Output is correct
5 Correct 37 ms 10772 KB Output is correct
6 Correct 106 ms 10872 KB Output is correct
7 Correct 51 ms 10840 KB Output is correct
8 Correct 33 ms 10584 KB Output is correct
9 Correct 39 ms 10588 KB Output is correct
10 Correct 37 ms 10844 KB Output is correct
11 Correct 38 ms 10808 KB Output is correct
12 Correct 27 ms 10760 KB Output is correct
13 Correct 93 ms 10872 KB Output is correct
14 Correct 43 ms 11608 KB Output is correct
15 Correct 47 ms 11504 KB Output is correct
16 Correct 24 ms 10752 KB Output is correct
17 Correct 64 ms 13428 KB Output is correct
18 Correct 51 ms 11608 KB Output is correct
19 Correct 36 ms 10584 KB Output is correct
20 Correct 152 ms 11108 KB Output is correct
21 Correct 57 ms 10924 KB Output is correct
22 Correct 33 ms 10588 KB Output is correct
23 Correct 39 ms 10740 KB Output is correct
24 Correct 36 ms 10588 KB Output is correct
25 Correct 37 ms 10584 KB Output is correct
26 Correct 27 ms 10588 KB Output is correct
27 Correct 108 ms 10852 KB Output is correct
28 Correct 80 ms 13136 KB Output is correct
29 Correct 47 ms 11600 KB Output is correct
30 Correct 26 ms 10588 KB Output is correct
31 Correct 91 ms 13300 KB Output is correct
32 Correct 54 ms 11860 KB Output is correct
33 Execution timed out 2009 ms 18564 KB Time limit exceeded
34 Halted 0 ms 0 KB -