PKU 1904. King's Quest. TLE 비재귀함수까지

#include <stdio.h> #include <stdlib.h> #include <string.h> struct _prince_ { int love[2001]; int marry[2001]; int n; }prince[2001]; int married_prince[2001]; int n; int stack[2][2001]; int *top[2]={&stack[0][0],&stack[1][0]}; void push(int stack_num, int value) { *top[stack_num]++=value; } int pop(int stack_num) { return *(--top[stack_num]); } int is_stack_empty() { if(top[0] == &stack[0][0]) return 1; return 0; } void input() { int i, j ,k; scanf("%d",&n); for(i=0; i<n; i++) { scanf("%d",&j); for(k=0; k<j; k++) { scanf("%d",&prince[i].love[k]); } } for(i=0; i<n; i++) { scanf("%d",&prince[i].marry[prince[i].n++]); } } int intcmp(const void *pa, const void *pb) { return (*(int *)pa - *(int *)pb); } void print() { int i, j; for(i=0; i<n; i++) { printf("%d",prince[i].n); qsort(prince[i].marry, prince[i].n, sizeof(int),intcmp); for(j=0; j<prince[i].n; j++) { printf(" %d",prince[i].marry[j]); } printf("\n"); } } int is_married(int girl, int num) { int i; for(i=0; i<num; i++) { if(married_prince[i]==girl) return 1; } return 0; } void insert() { int i, j, flag; for(i=0; i<n; i++) { for(j=0, flag=1; prince[i].marry[j]; j++) { if(prince[i].marry[j]==married_prince[i]) { flag=0; break; } } if(flag==1) { prince[i].marry[prince[i].n++]=married_prince[i]; } } } void back() { int i, num, first=1; push(0,1); push(1,0); while(is_stack_empty()==0) { num=pop(0); i=pop(1); if(first==0) goto called; first=0; for(; prince[num].love[i]; i++) { if(is_married(prince[num].love[i], num)==0) { married_prince[num]=prince[num].love[i]; push(0,num); push(1,i); i=-1; num++; called:; } if(num==n) { insert(); num=pop(0); i=pop(1); } } } } int main() { int i; input(); for(i=0; prince[0].love[i]; i++) { if(is_married(prince[0].love[i],0)==0) { married_prince[0]=prince[0].love[i]; back(); memset(married_prince, 0, sizeof(int)*n); } } print(); return 0; }

아니 왜 아들을 2000명이나 낳아