-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBT.cpp
More file actions
77 lines (76 loc) · 1.1 KB
/
BT.cpp
File metadata and controls
77 lines (76 loc) · 1.1 KB
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
#include <iostream>
using namespace std;
#define SIZE 10240
int main(){
int m[SIZE]={0};
for(int i=0;i<SIZE;i++)m[i]=-1;
int a=0,d;
while(true){
cin>>d;
if(d==-1){
break;
}
for(int i=0;i<a;i++){
if(d==m[i])d=-2;
}
if(d!=-1&&d!=-2){
m[a]=d;
a++;
}
}
for(int i=0;i<a;i++){
//cout<<m[i];
}
int b,c,e[SIZE],o=0;
while(true){
cin>>b;
if(b<=0)break;
cin>>c;
if(b==1){
for(int i=0;i<a;i++){
if(m[i]==c){
if(((i+1)/2-1)<a){
if(m[(i+1)/2-1]==-1){
e[o]=-1;
}
}
e[o]=m[(i+1)/2-1];
break;
}
if(i==a-1)e[o]=-1;
}
}else if(b==2){
for(int i=0;i<a;i++){
if(m[i]==c){
if(((i+1)*2-1)<a){
if(m[(i+1)/2-1]==-1){
e[o]=-1;
}
}
e[o]=m[(i+1)*2-1];
break;
}
if(i==a-1)e[o]=-1;
}
}
else if(b==3){
for(int i=0;i<a;i++){
if(((i+1)*2-1+1)<a){
if(m[(i+1)*2-1+1]==-1){
e[o]=-1;
}
}
if(m[i]==c){
e[o]=m[(i+1)*2-1+1];
break;
}
if(i==a-1)e[o]=-1;
}
}
o++;
}
for(int i=0;i<o;i++){
cout<<e[i];
if(i!=o-1)cout<<" ";
}
}