-
Notifications
You must be signed in to change notification settings - Fork 0
/
101.cpp
147 lines (134 loc) · 2.76 KB
/
101.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
void initial(char **s,int *p,int *q,int n)
{
int i;
for (i=0;i<n;i++)
p[i]=1,q[i]=i,s[i][0]=i+'0',s[i][1]='\0';
}
void Put(int key,int position,int target,char **s,int *p,int *q)
{
s[target][p[target]+1]='\0';
s[target][p[target]++]=s[key][position];
p[key]--;
q[s[key][position]-'0']=target;
s[key][position]='\0';
}
void PutBack(int key,int position,char **s,int *p,int *q)
{
int i;
for (i=p[key]-1;i>position;i--)
Put(key,i,s[key][i]-'0',s,p,q);
}
void MoveOnto(int a,int b,char **s,int *p,int *q)
{
int position;//Âk¦^°Ê§@¥Îªº
int i;
for (i=0;s[q[a]][i]!=a+'0';i++);
position=i;
PutBack(q[a],i,s,p,q);
for (i=0;s[q[b]][i]!=b+'0';i++);
PutBack(q[b],i,s,p,q);
Put(q[a],position,q[b],s,p,q);
}
void MoveOver(int a,int b,char **s,int *p,int *q)
{
int i;
for (i=0;s[q[a]][i]!=a+'0';i++);
PutBack(q[a],i,s,p,q);
Put(q[a],i,q[b],s,p,q);
}
void PileOnto(int a,int b,char **s,int *p,int *q)
{
int position3;
int position2;
int position;
int i;
for (i=0;s[q[b]][i]!=b+'0';i++);
PutBack(q[b],i,s,p,q);
position=i;
for (i=0;s[q[a]][i]!=a+'0';i++);
position++;
position2=i;
position3=q[a];
while (s[position3][i]!='\0')
{
s[q[b]][position]=s[position3][i];
q[s[position3][i]-'0']=q[b];
i++,position++;
}
p[position3]=position2;
p[q[b]]=position;
s[position3][position2]='\0';
s[q[b]][position]='\0';
}
void PileOver(int a,int b,char **s,int *p,int *q)
{
int position3;
int position,position2,i;
position=p[q[b]];
for (i=0;s[q[a]][i]!=a+'0';i++);
position2=i;
position3=q[a];
while (s[position3][i]!='\0')
{
s[q[b]][position]=s[position3][i];
q[s[position3][i]-'0']=q[b];
i++,position++;
}
p[position3]=position2;
p[q[b]]=position;
s[position3][position2]='\0';
s[q[b]][position]='\0';
}
main()
{
int j;
char **s;
int *p;
int *q;
int n;
char one[5],two[5];
int a,b;
int i;
while (cin>>n)
{
s=new char*[n];
p=new int[n];
q=new int[n];
for (i=0;i<n;i++)
s[i]=new char[n+1];
initial(s,p,q,n);
while (cin>>one && strcmp(one,"quit")!=0)
{
cin>>a>>two>>b;
if (a==b || q[a]==q[b] || a>n || b>n || a<0 || b<0) continue;
if (strcmp(one,"move")==0)
{
if (strcmp(two,"onto")==0)
MoveOnto(a,b,s,p,q);
else MoveOver(a,b,s,p,q);
}
else
{
if (strcmp(two,"onto")==0)
PileOnto(a,b,s,p,q);
else PileOver(a,b,s,p,q);
}
}
for (i=0;i<n;i++)
{
cout<<i<<":";
for (j=0;s[i][j]!='\0';j++) cout<<" "<<(int)s[i][j]-'0';
cout<<endl;
}
//
//for (i=0;i<n;i++) cout<<q[i]<<" ";
//cout<<endl;
//for (i=0;i<n;i++) cout<<p[i]<<" ";
//cout<<endl;
}
return 0;
}