Submission #4642779


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=110000;
int a[N],b[N],root1,root2,p[N*2],h[N*2],num,n,ans[N*2],f[N*2];
bool flag[N];
struct node{
	int x,y,next,k;
	bool flag;
}data[N*10];
void link(int x,int y){
	++num;
	data[num].x=x;
	data[num].y=y;
	data[num].next=h[x];
	data[num].k=num+1;
	data[num].flag=true;
	h[x]=num;
	++num;
	data[num].x=y;
	data[num].y=x;
	data[num].next=h[y];
	data[num].k=num-1;
	data[num].flag=true;
	h[y]=num;
	p[x]++;
	p[y]++;
}
void dfs1(int x){
	for(int i=h[x];i!=-1;i=data[i].next){
		if(!data[i].flag)continue;
		int v=data[i].y;
		if(x<=n&&v<=n){f[x]++;f[v]--;}
		if(x==root1&&v==root2){f[x]++;f[v]--;}
//		if(x==root2&&v==root1){f[x]++;f[v]--;}
		data[i].flag=false;
		data[data[i].k].flag=false;
		dfs1(v);
	}
}
int dfs2(int x){
	flag[x]=false;
	int num1=0;
	for(int i=h[x];i!=-1;i=data[i].next){
		int v=data[i].y;
		if(!flag[v])continue;
		num1+=dfs2(v);
	}
	ans[x]=f[x]+num1;
	return ans[x];
}
int main(){
//	freopen("4.in","r",stdin);
	scanf("%d",&n);
	memset(h,-1,sizeof h);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		if(a[i]!=-1)link(a[i],i);
		else root1=i;
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&b[i]);
		if(b[i]!=-1)link(b[i]+n,i+n);
		else root2=i+n;
	}
	link(root1,root2);
	for(int i=1;i<=n;i++){
		if((p[i]%2)!=(p[i+n]%2)){
			printf("IMPOSSIBLE\n");
			return 0;
		}else if(p[i]%2==1)link(i,i+n);
	}
	printf("POSSIBLE\n");
	dfs1(root1);
	for(int i=1;i<=n;i++)printf("%d ",f[i]);
	return 0;
}

Submission Info

Submission Time
Task F - Two Trees
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 1570 Byte
Status WA
Exec Time 2104 ms
Memory 26752 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:55:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:58:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
                    ^
./Main.cpp:63:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&b[i]);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1700
Status
AC × 3
AC × 53
WA × 5
TLE × 12
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt, subtask_1_49.txt, subtask_1_50.txt, subtask_1_51.txt, subtask_1_52.txt, subtask_1_53.txt, subtask_1_54.txt, subtask_1_55.txt, subtask_1_56.txt, subtask_1_57.txt, subtask_1_58.txt, subtask_1_59.txt, subtask_1_60.txt, subtask_1_61.txt, subtask_1_62.txt, subtask_1_63.txt, subtask_1_64.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 4224 KB
sample_02.txt AC 1 ms 2176 KB
sample_03.txt AC 1 ms 4224 KB
subtask_1_01.txt AC 1 ms 2176 KB
subtask_1_02.txt AC 1 ms 2176 KB
subtask_1_03.txt AC 15 ms 8832 KB
subtask_1_04.txt WA 41 ms 19712 KB
subtask_1_05.txt AC 22 ms 11392 KB
subtask_1_06.txt AC 15 ms 10624 KB
subtask_1_07.txt AC 31 ms 13312 KB
subtask_1_08.txt AC 13 ms 8832 KB
subtask_1_09.txt AC 14 ms 8832 KB
subtask_1_10.txt TLE 2104 ms 18816 KB
subtask_1_11.txt AC 6 ms 3968 KB
subtask_1_12.txt AC 50 ms 23168 KB
subtask_1_13.txt AC 17 ms 9088 KB
subtask_1_14.txt WA 8 ms 6784 KB
subtask_1_15.txt AC 14 ms 8704 KB
subtask_1_16.txt AC 19 ms 11264 KB
subtask_1_17.txt AC 11 ms 6656 KB
subtask_1_18.txt TLE 2104 ms 23680 KB
subtask_1_19.txt AC 24 ms 11520 KB
subtask_1_20.txt WA 65 ms 26624 KB
subtask_1_21.txt AC 24 ms 11520 KB
subtask_1_22.txt AC 24 ms 11520 KB
subtask_1_23.txt AC 57 ms 26624 KB
subtask_1_24.txt AC 48 ms 16000 KB
subtask_1_25.txt AC 23 ms 13568 KB
subtask_1_26.txt AC 23 ms 11520 KB
subtask_1_27.txt TLE 2104 ms 26624 KB
subtask_1_28.txt AC 24 ms 11520 KB
subtask_1_29.txt AC 58 ms 26624 KB
subtask_1_30.txt AC 24 ms 11520 KB
subtask_1_31.txt AC 25 ms 11520 KB
subtask_1_32.txt AC 58 ms 26624 KB
subtask_1_33.txt AC 45 ms 16000 KB
subtask_1_34.txt AC 23 ms 13568 KB
subtask_1_35.txt AC 24 ms 11520 KB
subtask_1_36.txt TLE 2104 ms 26624 KB
subtask_1_37.txt AC 59 ms 26624 KB
subtask_1_38.txt AC 62 ms 26624 KB
subtask_1_39.txt AC 59 ms 26624 KB
subtask_1_40.txt AC 61 ms 26624 KB
subtask_1_41.txt AC 56 ms 26368 KB
subtask_1_42.txt TLE 2104 ms 21504 KB
subtask_1_43.txt TLE 2104 ms 26624 KB
subtask_1_44.txt AC 59 ms 26624 KB
subtask_1_45.txt AC 64 ms 26752 KB
subtask_1_46.txt AC 59 ms 26624 KB
subtask_1_47.txt WA 63 ms 26624 KB
subtask_1_48.txt AC 58 ms 26368 KB
subtask_1_49.txt TLE 2104 ms 21376 KB
subtask_1_50.txt TLE 2104 ms 26624 KB
subtask_1_51.txt AC 59 ms 26624 KB
subtask_1_52.txt AC 60 ms 26624 KB
subtask_1_53.txt AC 61 ms 26624 KB
subtask_1_54.txt WA 58 ms 26624 KB
subtask_1_55.txt AC 58 ms 26496 KB
subtask_1_56.txt TLE 2104 ms 21376 KB
subtask_1_57.txt TLE 2104 ms 26624 KB
subtask_1_58.txt AC 60 ms 26624 KB
subtask_1_59.txt AC 59 ms 26624 KB
subtask_1_60.txt AC 61 ms 26624 KB
subtask_1_61.txt AC 60 ms 26624 KB
subtask_1_62.txt AC 61 ms 26240 KB
subtask_1_63.txt TLE 2104 ms 21504 KB
subtask_1_64.txt TLE 2104 ms 26624 KB