Submission #1575447


Source Code Expand

#include<bits/stdc++.h>
#include<vector>
#define N 400005
using namespace std;
vector<int> G[N];
int n,m=1,a[N],b[N],head[N],nxt[N],num[N],op[N],vis[N],dex[N],X[N],rt;
void link(int x,int y,int z)
{
	num[++m]=y,dex[m]=z,nxt[m]=head[x],head[x]=m;
	num[++m]=x,dex[m]=z,nxt[m]=head[y],head[y]=m;
}
void dfs(int t)
{
	int i;
	while(head[t]){
		i=head[t];
		head[t]=nxt[i];
		if(vis[i]) continue;
		vis[i]=vis[i^1]=1;
		dfs(num[i]);
		if(~dex[i]&1)
			X[dex[i]/2]=(i&1 ? 1 : -1);
	  }
}
void DFS(int t)
{
	int i;
	for(i=0;i<G[t].size();i++)
		X[t]-=X[G[t][i]],DFS(G[t][i]);
}
int main()
{
	int i;
	scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&a[i]);
	for(i=1;i<=n;i++) scanf("%d",&b[i]);
	for(i=1;i<=n;i++){
		if(a[i]!=-1) G[a[i]].push_back(i); else rt=i;
		link(i,(a[i]==-1 ? n+1 : a[i]),2*i);
		link((b[i]==-1 ? n+1 : b[i]),i,2*i+1);
		if(a[i]>0) op[a[i]]^=1;
		if(b[i]>0) op[b[i]]^=1;
	  }
	for(i=1;i<=n;i++)
		if(op[i]){
			printf("IMPOSSIBLE");
			return 0;
		  }
 	dfs(n+1);
	DFS(rt);
	printf("POSSIBLE\n");
	for(i=1;i<=n;i++)
		printf("%d ",X[i]);
	return 0;
}

Submission Info

Submission Time
Task F - Two Trees
User MemorySlices
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1120 Byte
Status AC
Exec Time 62 ms
Memory 30464 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:35:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%d",&a[i]);
                                     ^
./Main.cpp:36:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%d",&b[i]);
                                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 3
AC × 70
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 6 ms 21632 KB
sample_02.txt AC 6 ms 19584 KB
sample_03.txt AC 6 ms 21632 KB
subtask_1_01.txt AC 6 ms 19584 KB
subtask_1_02.txt AC 6 ms 19584 KB
subtask_1_03.txt AC 23 ms 23296 KB
subtask_1_04.txt AC 42 ms 28032 KB
subtask_1_05.txt AC 31 ms 23808 KB
subtask_1_06.txt AC 18 ms 23936 KB
subtask_1_07.txt AC 36 ms 23808 KB
subtask_1_08.txt AC 17 ms 22528 KB
subtask_1_09.txt AC 21 ms 22912 KB
subtask_1_10.txt AC 37 ms 27264 KB
subtask_1_11.txt AC 12 ms 20352 KB
subtask_1_12.txt AC 50 ms 29184 KB
subtask_1_13.txt AC 25 ms 23424 KB
subtask_1_14.txt AC 12 ms 22784 KB
subtask_1_15.txt AC 18 ms 22784 KB
subtask_1_16.txt AC 23 ms 22780 KB
subtask_1_17.txt AC 18 ms 22784 KB
subtask_1_18.txt AC 49 ms 29440 KB
subtask_1_19.txt AC 34 ms 23936 KB
subtask_1_20.txt AC 56 ms 30208 KB
subtask_1_21.txt AC 34 ms 24448 KB
subtask_1_22.txt AC 34 ms 25216 KB
subtask_1_23.txt AC 57 ms 30336 KB
subtask_1_24.txt AC 51 ms 24576 KB
subtask_1_25.txt AC 27 ms 22780 KB
subtask_1_26.txt AC 32 ms 23548 KB
subtask_1_27.txt AC 54 ms 30208 KB
subtask_1_28.txt AC 36 ms 23936 KB
subtask_1_29.txt AC 59 ms 30208 KB
subtask_1_30.txt AC 36 ms 23936 KB
subtask_1_31.txt AC 36 ms 25216 KB
subtask_1_32.txt AC 60 ms 30336 KB
subtask_1_33.txt AC 51 ms 24576 KB
subtask_1_34.txt AC 27 ms 22780 KB
subtask_1_35.txt AC 31 ms 23548 KB
subtask_1_36.txt AC 54 ms 30108 KB
subtask_1_37.txt AC 57 ms 30336 KB
subtask_1_38.txt AC 60 ms 30336 KB
subtask_1_39.txt AC 57 ms 30208 KB
subtask_1_40.txt AC 57 ms 30336 KB
subtask_1_41.txt AC 57 ms 30336 KB
subtask_1_42.txt AC 40 ms 29560 KB
subtask_1_43.txt AC 54 ms 30208 KB
subtask_1_44.txt AC 57 ms 30336 KB
subtask_1_45.txt AC 56 ms 30208 KB
subtask_1_46.txt AC 57 ms 30208 KB
subtask_1_47.txt AC 57 ms 30336 KB
subtask_1_48.txt AC 57 ms 30464 KB
subtask_1_49.txt AC 40 ms 29560 KB
subtask_1_50.txt AC 54 ms 30208 KB
subtask_1_51.txt AC 57 ms 30208 KB
subtask_1_52.txt AC 56 ms 30208 KB
subtask_1_53.txt AC 57 ms 30336 KB
subtask_1_54.txt AC 57 ms 30336 KB
subtask_1_55.txt AC 58 ms 30336 KB
subtask_1_56.txt AC 40 ms 29560 KB
subtask_1_57.txt AC 54 ms 30108 KB
subtask_1_58.txt AC 57 ms 30208 KB
subtask_1_59.txt AC 57 ms 30336 KB
subtask_1_60.txt AC 58 ms 30336 KB
subtask_1_61.txt AC 60 ms 30336 KB
subtask_1_62.txt AC 62 ms 30464 KB
subtask_1_63.txt AC 40 ms 29560 KB
subtask_1_64.txt AC 54 ms 30208 KB