Submission #1371303


Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

typedef pair<int,int> P;

int n,k,a[100000],ans = 0,d[100000];
vector<int> rev[100000];

void dfs(int v,int depth){
	d[v] = depth;
	for(int i = 0;i < rev[v].size();i++){
		int to = rev[v][i];
		if(d[to] == -1) dfs(to,depth + 1);
	}
}

void dfs2(int v){
	d[v] = 0;
	for(int i = 0;i < rev[v].size();i++){
		int to = rev[v][i];
		if(d[to]) dfs2(to);
	}
}

bool used[100000] = {};

int main(){
	cin >> n >> k;
	for(int i = 0;i < n;i++) {
		cin >> a[i];a[i]--;
		if(i) rev[a[i]].push_back(i);
		d[i] = -1;
	}
	if(a[0]) ans++;
	dfs(0,0);
	priority_queue<P> que;
	for(int i = 0;i < n;i++){
		if(d[i] > k) que.push(P(d[i],i));
	}
	while(!que.empty()){
		P p = que.top();que.pop();
		int v = p.second;
		if(d[v] <= k) continue;
		for(int i = 0;i < k - 1;i++) v = a[v];
		ans++;
		dfs2(v);
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User hoget157
Language C++14 (GCC 5.4.1)
Score 800
Code Size 945 Byte
Status AC
Exec Time 72 ms
Memory 12280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 58
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 2560 KB
0_01.txt AC 3 ms 2560 KB
0_02.txt AC 3 ms 2560 KB
1_00.txt AC 3 ms 2560 KB
1_01.txt AC 3 ms 2560 KB
1_02.txt AC 67 ms 12280 KB
1_03.txt AC 72 ms 12280 KB
1_04.txt AC 70 ms 12280 KB
1_05.txt AC 70 ms 12280 KB
1_06.txt AC 62 ms 11772 KB
1_07.txt AC 60 ms 11772 KB
1_08.txt AC 55 ms 11136 KB
1_09.txt AC 50 ms 11136 KB
1_10.txt AC 63 ms 9972 KB
1_11.txt AC 68 ms 9972 KB
1_12.txt AC 72 ms 9972 KB
1_13.txt AC 66 ms 7672 KB
1_14.txt AC 68 ms 7672 KB
1_15.txt AC 68 ms 7672 KB
1_16.txt AC 38 ms 5756 KB
1_17.txt AC 32 ms 5116 KB
1_18.txt AC 32 ms 5116 KB
1_19.txt AC 20 ms 3832 KB
1_20.txt AC 20 ms 3832 KB
1_21.txt AC 20 ms 3832 KB
1_22.txt AC 59 ms 6136 KB
1_23.txt AC 61 ms 6136 KB
1_24.txt AC 62 ms 6136 KB
1_25.txt AC 58 ms 5624 KB
1_26.txt AC 58 ms 5624 KB
1_27.txt AC 58 ms 5624 KB
1_28.txt AC 46 ms 5240 KB
1_29.txt AC 34 ms 4352 KB
1_30.txt AC 34 ms 4096 KB
1_31.txt AC 64 ms 6140 KB
1_32.txt AC 45 ms 4992 KB
1_33.txt AC 44 ms 4992 KB
1_34.txt AC 43 ms 4992 KB
1_35.txt AC 67 ms 6520 KB
1_36.txt AC 45 ms 5376 KB
1_37.txt AC 44 ms 5376 KB
1_38.txt AC 45 ms 5376 KB
1_39.txt AC 68 ms 6524 KB
1_40.txt AC 66 ms 6520 KB
1_41.txt AC 45 ms 5376 KB
1_42.txt AC 44 ms 5376 KB
1_43.txt AC 67 ms 6780 KB
1_44.txt AC 67 ms 6780 KB
1_45.txt AC 60 ms 6780 KB
1_46.txt AC 45 ms 5632 KB
1_47.txt AC 67 ms 7932 KB
1_48.txt AC 67 ms 7932 KB
1_49.txt AC 60 ms 7932 KB
1_50.txt AC 45 ms 6784 KB
1_51.txt AC 69 ms 11256 KB
1_52.txt AC 70 ms 11256 KB
1_53.txt AC 72 ms 11256 KB
1_54.txt AC 47 ms 10112 KB