Submission #1583728
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> #include<map> #include<stack> using namespace std; typedef long long LL; const int N=4e5+100; int gi() { int w=0;bool q=1;char c=getchar(); while ((c<'0'||c>'9') && c!='-') c=getchar(); if (c=='-') q=0,c=getchar(); while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar(); return q? w:-w; } int x[N],a[N],b[N]; int head[N],nxt[N],to[N],tot=1; bool o[N],vis[N]; inline void link(int a,int b) { to[++tot]=b,nxt[tot]=head[a],head[a]=tot; to[++tot]=a,nxt[tot]=head[b],head[b]=tot; } inline void dfs(int k) { for (int i;i=head[k];) if (head[k]=nxt[i],!vis[i]) { vis[i^1]=true; dfs(to[i]); if (i&2) x[a[k]==to[i]?k:to[i]]=i&1?-1:1; } } inline void back(int k) { for (int i=head[k];i;i=nxt[i]) { x[k]-=x[i]; back(i); } } int main() { int n=gi(),i,rt; for (i=1;i<=n;i++) if ((a[i]=gi())==-1) a[i]=n+1,rt=i; for (i=1;i<=n;i++) if ((b[i]=gi())==-1) b[i]=n+1; for (i=1;i<=n;i++) { o[a[i]]^=1;o[b[i]]^=1; link(a[i],i);link(i,b[i]); } for (i=1;i<=n;i++) if (o[i]) return puts("IMPOSSIBLE"),0; puts("POSSIBLE"); dfs(n+1); for (i=1;i<=n;i++) head[i]=0; for (i=1;i<=n;i++) nxt[i]=head[a[i]],head[a[i]]=i; back(rt); for (i=1;i<=n;i++) printf("%d ",x[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Two Trees |
User | laofu |
Language | C++14 (Clang 3.8.0) |
Score | 1700 |
Code Size | 1424 Byte |
Status | AC |
Exec Time | 38 ms |
Memory | 15360 KB |
Compile Error
./Main.cpp:31:14: warning: using the result of an assignment as a condition without parentheses [-Wparentheses] for (int i;i=head[k];) ~^~~~~~~~ ./Main.cpp:31:14: note: place parentheses around the assignment to silence this warning for (int i;i=head[k];) ^ ( ) ./Main.cpp:31:14: note: use '==' to turn this assignment into an equality comparison for (int i;i=head[k];) ^ == 1 warning generated.
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1700 / 1700 | ||||
Status |
|
|
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 | 2 ms | 6400 KB |
sample_02.txt | AC | 2 ms | 6400 KB |
sample_03.txt | AC | 2 ms | 6400 KB |
subtask_1_01.txt | AC | 2 ms | 6400 KB |
subtask_1_02.txt | AC | 2 ms | 6400 KB |
subtask_1_03.txt | AC | 9 ms | 7296 KB |
subtask_1_04.txt | AC | 27 ms | 12800 KB |
subtask_1_05.txt | AC | 12 ms | 7936 KB |
subtask_1_06.txt | AC | 10 ms | 8320 KB |
subtask_1_07.txt | AC | 21 ms | 8064 KB |
subtask_1_08.txt | AC | 8 ms | 7040 KB |
subtask_1_09.txt | AC | 8 ms | 7296 KB |
subtask_1_10.txt | AC | 23 ms | 12032 KB |
subtask_1_11.txt | AC | 4 ms | 6528 KB |
subtask_1_12.txt | AC | 32 ms | 14080 KB |
subtask_1_13.txt | AC | 10 ms | 7424 KB |
subtask_1_14.txt | AC | 6 ms | 7296 KB |
subtask_1_15.txt | AC | 9 ms | 6912 KB |
subtask_1_16.txt | AC | 11 ms | 7680 KB |
subtask_1_17.txt | AC | 7 ms | 7040 KB |
subtask_1_18.txt | AC | 32 ms | 14592 KB |
subtask_1_19.txt | AC | 13 ms | 8064 KB |
subtask_1_20.txt | AC | 37 ms | 15360 KB |
subtask_1_21.txt | AC | 13 ms | 8064 KB |
subtask_1_22.txt | AC | 13 ms | 8064 KB |
subtask_1_23.txt | AC | 37 ms | 15360 KB |
subtask_1_24.txt | AC | 31 ms | 9088 KB |
subtask_1_25.txt | AC | 13 ms | 8064 KB |
subtask_1_26.txt | AC | 13 ms | 8064 KB |
subtask_1_27.txt | AC | 36 ms | 15360 KB |
subtask_1_28.txt | AC | 14 ms | 8064 KB |
subtask_1_29.txt | AC | 38 ms | 15360 KB |
subtask_1_30.txt | AC | 14 ms | 8064 KB |
subtask_1_31.txt | AC | 13 ms | 8064 KB |
subtask_1_32.txt | AC | 37 ms | 15360 KB |
subtask_1_33.txt | AC | 30 ms | 9088 KB |
subtask_1_34.txt | AC | 13 ms | 8064 KB |
subtask_1_35.txt | AC | 13 ms | 8064 KB |
subtask_1_36.txt | AC | 36 ms | 15360 KB |
subtask_1_37.txt | AC | 38 ms | 15360 KB |
subtask_1_38.txt | AC | 37 ms | 15360 KB |
subtask_1_39.txt | AC | 37 ms | 15360 KB |
subtask_1_40.txt | AC | 38 ms | 15360 KB |
subtask_1_41.txt | AC | 38 ms | 15360 KB |
subtask_1_42.txt | AC | 26 ms | 15232 KB |
subtask_1_43.txt | AC | 35 ms | 15360 KB |
subtask_1_44.txt | AC | 38 ms | 15360 KB |
subtask_1_45.txt | AC | 37 ms | 15360 KB |
subtask_1_46.txt | AC | 37 ms | 15360 KB |
subtask_1_47.txt | AC | 37 ms | 15360 KB |
subtask_1_48.txt | AC | 37 ms | 15360 KB |
subtask_1_49.txt | AC | 26 ms | 15232 KB |
subtask_1_50.txt | AC | 37 ms | 15360 KB |
subtask_1_51.txt | AC | 37 ms | 15360 KB |
subtask_1_52.txt | AC | 38 ms | 15360 KB |
subtask_1_53.txt | AC | 37 ms | 15360 KB |
subtask_1_54.txt | AC | 37 ms | 15360 KB |
subtask_1_55.txt | AC | 38 ms | 15360 KB |
subtask_1_56.txt | AC | 27 ms | 15232 KB |
subtask_1_57.txt | AC | 35 ms | 15360 KB |
subtask_1_58.txt | AC | 37 ms | 15360 KB |
subtask_1_59.txt | AC | 37 ms | 15360 KB |
subtask_1_60.txt | AC | 37 ms | 15360 KB |
subtask_1_61.txt | AC | 37 ms | 15360 KB |
subtask_1_62.txt | AC | 38 ms | 15360 KB |
subtask_1_63.txt | AC | 26 ms | 15232 KB |
subtask_1_64.txt | AC | 35 ms | 15360 KB |