Submission #2498380


Source Code Expand

#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cctype>
#define szxb 100010
#define M(a) memset((a),(0),sizeof((a)))
#define P putchar((10))
using namespace std;
int n,a[szxb],b[szxb],c[szxb];
signed main(){M(b),M(c);scanf("%d",&n);for(register int i(1);i^n;i++){scanf("%d",&a[i]);}for(register int i(n-1);i;i--){b[a[i]]+=++b[i],c[a[i]]=max(c[a[i]],b[i]);}for(register int i(0);i^n;i++){printf("%d",max(c[i],n-b[i])),P;}return 0;}

Submission Info

Submission Time
Task C - 高橋王国の分割統治
User luogu_bot3
Language C++ (GCC 5.4.1)
Score 100
Code Size 612 Byte
Status AC
Exec Time 20 ms
Memory 2048 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 signed main(){M(b),M(c);scanf("%d",&n);for(register int i(1);i^n;i++){scanf("%d",&a[i]);}for(register int i(n-1);i;i--){b[a[i]]+=++b[i],c[a[i]]=max(c[a[i]],b[i]);}for(register int i(0);i^n;i++){printf("%d",max(c[i],n-b[i])),P;}return 0;}
                                       ^
./Main.cpp:19:88: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 signed main(){M(b),M(c);scanf("%d",&n);for(register int i(1);i^n;i++){scanf("%d",&a[i]);}for(register int i(n-1);i;i--){b[a[i]]+=++b[i],c[a[i]]=max(c[a[i]],b[i]);}for(register int i(0);i^n;i++){printf("%d",max(c[i],n-b[i])),P;}return 0;}
                                                                                        ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 11
AC × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 1024 KB
sample_02.txt AC 2 ms 1024 KB
subtask1_01.txt AC 2 ms 1024 KB
subtask1_02.txt AC 2 ms 1024 KB
subtask1_03.txt AC 1 ms 1024 KB
subtask1_04.txt AC 2 ms 1024 KB
subtask1_05.txt AC 2 ms 1024 KB
subtask1_06.txt AC 2 ms 1024 KB
subtask1_07.txt AC 2 ms 1024 KB
subtask1_08.txt AC 2 ms 1024 KB
subtask1_09.txt AC 2 ms 1024 KB
subtask2_01.txt AC 15 ms 1792 KB
subtask2_02.txt AC 18 ms 1920 KB
subtask2_03.txt AC 20 ms 2048 KB
subtask2_04.txt AC 20 ms 2048 KB
subtask2_05.txt AC 18 ms 2048 KB
subtask2_06.txt AC 18 ms 2048 KB
subtask2_07.txt AC 20 ms 2048 KB