Submission #1602086
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; #define MAXN 100000 #define rint register int #define gc() getchar() inline int read(rint ans = 0, rint sgn = ' ', rint ch = gc()) { for(; ch < '0' || ch > '9'; sgn = ch, ch = gc()); for(; ch >='0' && ch <='9';(ans*=10)+=ch-'0', ch = gc()); return sgn-'-'?ans:-ans; } int first[MAXN+5], cur[MAXN+5], fa[2][MAXN+5], in[2][MAXN+5], c[MAXN+5], w[MAXN+5], to[MAXN+5], n, tot; struct Edge{int to,nex,w; Edge(){} Edge(int _to, int _nex, int _w):to(_to),nex(_nex),w(_w){}}e[(MAXN<<2)+5]; bool book[(MAXN<<2)+5]; inline void Add(int a, int b, int w){e[tot] = Edge(b,first[a],w), first[a] = tot++, e[tot] = Edge(a,first[b],w), first[b] = tot++;} void DFS(int p){for(rint u = cur[p]; ~u; u = cur[p]) if(cur[p]=e[u].nex, !book[u] && !book[u^1]) !e[u].w ? to[e[u^1].to] = e[u].to, ++c[e[u].to], --c[e[u^1].to] : 0, book[u] = true, DFS(e[u].to);} int main() { n = read(), memset(first,-1,-~n<<2); for(rint k = 0, i; k < 2; k++) for(i = 1; i <= n; ++in[k][fa[k][i++]=max(read(),0)]); for(rint i = 1; i <= n; i++) if((in[0][i]+in[1][i])&1){puts("IMPOSSIBLE"); return 0;} puts("POSSIBLE"); for(rint i = 1; i <= n; Add(i,fa[0][i],0), Add(i,fa[1][i],1), i++); memcpy(cur,first,-~n<<2), DFS(1); for(rint i = 1; i <= n; printf("%d ",c[i]), i++); putchar('\n'); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Two Trees |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1377 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 12160 KB |
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 | 4352 KB |
sample_02.txt | AC | 2 ms | 4352 KB |
sample_03.txt | AC | 2 ms | 4352 KB |
subtask_1_01.txt | AC | 2 ms | 4352 KB |
subtask_1_02.txt | AC | 2 ms | 4352 KB |
subtask_1_03.txt | AC | 7 ms | 4608 KB |
subtask_1_04.txt | AC | 23 ms | 11008 KB |
subtask_1_05.txt | AC | 10 ms | 4736 KB |
subtask_1_06.txt | AC | 9 ms | 6528 KB |
subtask_1_07.txt | AC | 18 ms | 8704 KB |
subtask_1_08.txt | AC | 7 ms | 4608 KB |
subtask_1_09.txt | AC | 7 ms | 4608 KB |
subtask_1_10.txt | AC | 20 ms | 10752 KB |
subtask_1_11.txt | AC | 4 ms | 4480 KB |
subtask_1_12.txt | AC | 27 ms | 11648 KB |
subtask_1_13.txt | AC | 8 ms | 4608 KB |
subtask_1_14.txt | AC | 5 ms | 5376 KB |
subtask_1_15.txt | AC | 9 ms | 6016 KB |
subtask_1_16.txt | AC | 9 ms | 4608 KB |
subtask_1_17.txt | AC | 6 ms | 4480 KB |
subtask_1_18.txt | AC | 28 ms | 11776 KB |
subtask_1_19.txt | AC | 11 ms | 4736 KB |
subtask_1_20.txt | AC | 30 ms | 12160 KB |
subtask_1_21.txt | AC | 11 ms | 4736 KB |
subtask_1_22.txt | AC | 11 ms | 4736 KB |
subtask_1_23.txt | AC | 30 ms | 12160 KB |
subtask_1_24.txt | AC | 26 ms | 9088 KB |
subtask_1_25.txt | AC | 11 ms | 4736 KB |
subtask_1_26.txt | AC | 11 ms | 4736 KB |
subtask_1_27.txt | AC | 29 ms | 12160 KB |
subtask_1_28.txt | AC | 11 ms | 4736 KB |
subtask_1_29.txt | AC | 30 ms | 12160 KB |
subtask_1_30.txt | AC | 11 ms | 4736 KB |
subtask_1_31.txt | AC | 11 ms | 4736 KB |
subtask_1_32.txt | AC | 31 ms | 12160 KB |
subtask_1_33.txt | AC | 27 ms | 9088 KB |
subtask_1_34.txt | AC | 11 ms | 4736 KB |
subtask_1_35.txt | AC | 11 ms | 4736 KB |
subtask_1_36.txt | AC | 29 ms | 12160 KB |
subtask_1_37.txt | AC | 30 ms | 12160 KB |
subtask_1_38.txt | AC | 31 ms | 12160 KB |
subtask_1_39.txt | AC | 30 ms | 12160 KB |
subtask_1_40.txt | AC | 31 ms | 12160 KB |
subtask_1_41.txt | AC | 33 ms | 12160 KB |
subtask_1_42.txt | AC | 23 ms | 12160 KB |
subtask_1_43.txt | AC | 29 ms | 12160 KB |
subtask_1_44.txt | AC | 30 ms | 12160 KB |
subtask_1_45.txt | AC | 31 ms | 12160 KB |
subtask_1_46.txt | AC | 30 ms | 12160 KB |
subtask_1_47.txt | AC | 30 ms | 12160 KB |
subtask_1_48.txt | AC | 31 ms | 12160 KB |
subtask_1_49.txt | AC | 23 ms | 12160 KB |
subtask_1_50.txt | AC | 29 ms | 12160 KB |
subtask_1_51.txt | AC | 30 ms | 12160 KB |
subtask_1_52.txt | AC | 31 ms | 12160 KB |
subtask_1_53.txt | AC | 31 ms | 12160 KB |
subtask_1_54.txt | AC | 31 ms | 12160 KB |
subtask_1_55.txt | AC | 30 ms | 12160 KB |
subtask_1_56.txt | AC | 23 ms | 12160 KB |
subtask_1_57.txt | AC | 29 ms | 12160 KB |
subtask_1_58.txt | AC | 30 ms | 12160 KB |
subtask_1_59.txt | AC | 30 ms | 12160 KB |
subtask_1_60.txt | AC | 33 ms | 12160 KB |
subtask_1_61.txt | AC | 31 ms | 12160 KB |
subtask_1_62.txt | AC | 31 ms | 12160 KB |
subtask_1_63.txt | AC | 23 ms | 12160 KB |
subtask_1_64.txt | AC | 30 ms | 12160 KB |