AtCoder Grand Contest 004

Submission #1358186

Source codeソースコード

// Copyright 2017 wu_qing
#include <cstdio>
#include <vector>
const int N = 1e5 + 10;
int n, k, t1, ans;
std::vector<int> to[N];
inline void dfs(int cur, int dis) {
    if (dis > k) {
        ans++;
        dis = 1;
    }
    for (int i : to[cur])
        dfs(i, dis + 1);
}
int main() {
    scanf("%d%d", &n, &k);
    scanf("%d", &t1);
    if (t1 != 1) ans++;
    for (int i = 2; i <= n; i++) {
        scanf("%d", &t1);
        to[t1].push_back(i);
    }
    dfs(1, 0);
    printf("%d\n", ans);
    return 0;
}

Submission

Task問題 D - Teleporter
User nameユーザ名 wu_qing
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 539 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
^
./Main.cpp:17:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &t1);
^
./Main.cpp:20:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &t1);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt
All 0 / 800 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 2 ms 2560 KB
0_01.txt AC 2 ms 2560 KB
0_02.txt AC 2 ms 2560 KB
1_00.txt AC 2 ms 2560 KB
1_01.txt AC 2 ms 2560 KB
1_02.txt AC 24 ms 7936 KB
1_03.txt AC 25 ms 7936 KB
1_04.txt AC 26 ms 7936 KB
1_05.txt AC 25 ms 7936 KB
1_06.txt AC 24 ms 7936 KB
1_07.txt AC 25 ms 7936 KB
1_08.txt AC 24 ms 7936 KB
1_09.txt AC 25 ms 7936 KB
1_10.txt AC 24 ms 6784 KB
1_11.txt AC 24 ms 6784 KB
1_12.txt AC 24 ms 6784 KB
1_13.txt AC 23 ms 5760 KB
1_14.txt AC 24 ms 5760 KB
1_15.txt AC 24 ms 5760 KB
1_16.txt AC 16 ms 4348 KB
1_17.txt AC 16 ms 4348 KB
1_18.txt AC 16 ms 4348 KB
1_19.txt AC 10 ms 3196 KB
1_20.txt AC 10 ms 3196 KB
1_21.txt AC 10 ms 3196 KB
1_22.txt AC 21 ms 4096 KB
1_23.txt WA
1_24.txt WA
1_25.txt AC 21 ms 3584 KB
1_26.txt WA
1_27.txt WA
1_28.txt AC 14 ms 3328 KB
1_29.txt WA
1_30.txt AC 13 ms 3328 KB
1_31.txt WA
1_32.txt AC 22 ms 4224 KB
1_33.txt AC 22 ms 4224 KB
1_34.txt AC 22 ms 4224 KB
1_35.txt WA
1_36.txt AC 23 ms 4480 KB
1_37.txt AC 23 ms 4480 KB
1_38.txt AC 23 ms 4480 KB
1_39.txt WA
1_40.txt WA
1_41.txt AC 23 ms 4608 KB
1_42.txt AC 23 ms 4608 KB
1_43.txt WA
1_44.txt WA
1_45.txt WA
1_46.txt AC 23 ms 4736 KB
1_47.txt WA
1_48.txt WA
1_49.txt WA
1_50.txt AC 24 ms 5376 KB
1_51.txt WA
1_52.txt WA
1_53.txt WA
1_54.txt AC 24 ms 7296 KB