Submission #1521463


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int, int>P;

P p[100000];
int a[100000];
bool used[100000];
vector<int>E[100000];

void dfs(int u) {
	used[u] = true;
	for (int v : E[u]) {
		if (!used[v]) {
			p[v].first = p[u].first + 1;
			dfs(v);
		}
	}
}
void dfs2(int u) {
	used[u] = true;
	for (int v : E[u]) {
		if (!used[v])dfs(v);
	}
}
int main(){
	int n, k; scanf("%d%d", &n, &k);
	rep(i, n) {
		scanf("%d", &a[i]); a[i]--;
		if (i != 0)E[a[i]].push_back(i);
		p[i].second = i;
	}
	int cnt = (a[0] != 0);
	a[0] = 0;
	dfs(0);
	sort(p, p + n, greater<>());
	memset(used, 0, sizeof(used));
	rep(i, n) {
		if (p[i].first <= k)break;
		if (used[p[i].second])continue;
		cnt++;
		int x = p[i].second;
		rep(j, k - 1)x = a[x];
		dfs2(x);
	}
	printf("%d\n", cnt);
}

Submission Info

Submission Time
Task D - Teleporter
User autumn_eel
Language C++14 (GCC 5.4.1)
Score 0
Code Size 861 Byte
Status WA
Exec Time 40 ms
Memory 10112 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n, k; scanf("%d%d", &n, &k);
                                 ^
./Main.cpp:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]); a[i]--;
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 47
WA × 11
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 2 ms 2688 KB
0_01.txt AC 2 ms 2688 KB
0_02.txt AC 2 ms 2688 KB
1_00.txt AC 2 ms 2688 KB
1_01.txt AC 2 ms 2688 KB
1_02.txt AC 35 ms 10112 KB
1_03.txt AC 39 ms 10112 KB
1_04.txt WA 39 ms 10112 KB
1_05.txt WA 40 ms 10112 KB
1_06.txt AC 39 ms 10112 KB
1_07.txt AC 36 ms 10112 KB
1_08.txt AC 39 ms 10112 KB
1_09.txt AC 33 ms 10112 KB
1_10.txt AC 34 ms 8576 KB
1_11.txt AC 37 ms 8576 KB
1_12.txt AC 38 ms 8576 KB
1_13.txt AC 35 ms 7040 KB
1_14.txt AC 38 ms 7040 KB
1_15.txt WA 33 ms 7040 KB
1_16.txt AC 23 ms 5628 KB
1_17.txt AC 23 ms 5628 KB
1_18.txt AC 23 ms 5628 KB
1_19.txt AC 13 ms 4344 KB
1_20.txt AC 14 ms 4344 KB
1_21.txt AC 13 ms 4344 KB
1_22.txt AC 32 ms 5376 KB
1_23.txt AC 33 ms 5376 KB
1_24.txt WA 33 ms 5376 KB
1_25.txt AC 30 ms 4864 KB
1_26.txt AC 31 ms 4864 KB
1_27.txt WA 30 ms 4864 KB
1_28.txt AC 23 ms 4608 KB
1_29.txt AC 20 ms 4608 KB
1_30.txt AC 20 ms 4608 KB
1_31.txt WA 33 ms 5504 KB
1_32.txt AC 32 ms 5504 KB
1_33.txt AC 32 ms 5504 KB
1_34.txt AC 32 ms 5504 KB
1_35.txt AC 37 ms 5760 KB
1_36.txt AC 33 ms 5760 KB
1_37.txt AC 33 ms 5760 KB
1_38.txt AC 33 ms 5760 KB
1_39.txt WA 38 ms 5888 KB
1_40.txt WA 38 ms 5888 KB
1_41.txt AC 33 ms 5888 KB
1_42.txt AC 33 ms 5888 KB
1_43.txt AC 37 ms 6016 KB
1_44.txt WA 39 ms 6016 KB
1_45.txt AC 38 ms 6016 KB
1_46.txt AC 33 ms 6016 KB
1_47.txt AC 37 ms 6912 KB
1_48.txt AC 39 ms 6912 KB
1_49.txt AC 38 ms 6912 KB
1_50.txt AC 33 ms 6912 KB
1_51.txt AC 38 ms 9216 KB
1_52.txt WA 40 ms 9216 KB
1_53.txt WA 37 ms 9344 KB
1_54.txt AC 33 ms 9344 KB