Submission #1353325


Source Code Expand

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#define P pair<int,int>
using namespace std;

P S[100000];
int p[100000];
int d[100000];
int W[100000];
int DFS(int a) {
	if (d[a] != -1)return d[a];
	return d[a] = DFS(p[a]) + 1;
}
signed main() {
	int n, k; scanf("%d%d", &n, &k);
	for (int i = 0; i < n; i++) {
		scanf("%d", &p[i]);
		p[i]--;
	}
	int ans = p[0] != 0;
	memset(d, -1, sizeof(d));
	d[0] = 0;
	S[0] = { 0,0 };
	for (int i = 1; i < n; i++) {
		DFS(i);
		S[i] = { d[i],i };
	}
	sort(S, S + n, greater<P>());
	for (int i = 0; i < n; i++) {
		if (S[i].second == 0)continue;
		int count = W[S[i].second];
		if (count == k - 1&&p[S[i].second]!=0) {
			ans++;
		}
		else {
			W[p[S[i].second]] = max(count + 1,W[p[S[i].second]]);
		}
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Teleporter
User naoki2016
Language C++14 (GCC 5.4.1)
Score 800
Code Size 911 Byte
Status AC
Exec Time 22 ms
Memory 3712 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21: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:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p[i]);
                     ^

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 1 ms 640 KB
0_01.txt AC 1 ms 640 KB
0_02.txt AC 1 ms 640 KB
1_00.txt AC 1 ms 640 KB
1_01.txt AC 1 ms 640 KB
1_02.txt AC 21 ms 2816 KB
1_03.txt AC 21 ms 2816 KB
1_04.txt AC 21 ms 3072 KB
1_05.txt AC 22 ms 3712 KB
1_06.txt AC 21 ms 2816 KB
1_07.txt AC 21 ms 3584 KB
1_08.txt AC 21 ms 2816 KB
1_09.txt AC 21 ms 3200 KB
1_10.txt AC 21 ms 2304 KB
1_11.txt AC 21 ms 2944 KB
1_12.txt AC 21 ms 2944 KB
1_13.txt AC 22 ms 1792 KB
1_14.txt AC 22 ms 2176 KB
1_15.txt AC 22 ms 2176 KB
1_16.txt AC 17 ms 1792 KB
1_17.txt AC 18 ms 2176 KB
1_18.txt AC 18 ms 2176 KB
1_19.txt AC 12 ms 1792 KB
1_20.txt AC 12 ms 1792 KB
1_21.txt AC 12 ms 1792 KB
1_22.txt AC 20 ms 1792 KB
1_23.txt AC 21 ms 2176 KB
1_24.txt AC 20 ms 2176 KB
1_25.txt AC 19 ms 1792 KB
1_26.txt AC 20 ms 2176 KB
1_27.txt AC 19 ms 2176 KB
1_28.txt AC 19 ms 1792 KB
1_29.txt AC 17 ms 2176 KB
1_30.txt AC 16 ms 2176 KB
1_31.txt AC 21 ms 2176 KB
1_32.txt AC 21 ms 2176 KB
1_33.txt AC 22 ms 2176 KB
1_34.txt AC 21 ms 2176 KB
1_35.txt AC 22 ms 2176 KB
1_36.txt AC 22 ms 2176 KB
1_37.txt AC 22 ms 2176 KB
1_38.txt AC 22 ms 2176 KB
1_39.txt AC 22 ms 2176 KB
1_40.txt AC 22 ms 2176 KB
1_41.txt AC 22 ms 2176 KB
1_42.txt AC 22 ms 2176 KB
1_43.txt AC 22 ms 2304 KB
1_44.txt AC 22 ms 2304 KB
1_45.txt AC 22 ms 2304 KB
1_46.txt AC 22 ms 2176 KB
1_47.txt AC 22 ms 2560 KB
1_48.txt AC 22 ms 2560 KB
1_49.txt AC 22 ms 2432 KB
1_50.txt AC 22 ms 2560 KB
1_51.txt AC 21 ms 2688 KB
1_52.txt AC 21 ms 3456 KB
1_53.txt AC 21 ms 2688 KB
1_54.txt AC 21 ms 3072 KB