-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1272A-friends.cpp
More file actions
149 lines (140 loc) · 4.78 KB
/
Copy path1272A-friends.cpp
File metadata and controls
149 lines (140 loc) · 4.78 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
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
#include <iostream>
#include <cmath>
using namespace std;
#define dist(x,y,z) abs(x-y) + abs(x-z) + abs(y-z)
#define max(x,y,z) (x-y) > 0 ? ((x-z) > 0 ? 1 : 3 ) : (y-z) > 0 ? 2 : 3
#define min(x,y,z) (x-y) < 0 ? ((x-z) < 0 ? 1 : 3 ) : (y-z) < 0 ? 2 : 3
int main(){
int friend1, friend2, friend3;
int n;
cin>>n;
int res[n];
for (int i=0; i<n;i++) {
cin>>friend1>>friend2>>friend3;
int max = max(friend1, friend2, friend3);
int min = min(friend1, friend2, friend3);
if ((friend1 == friend2) && (friend2 == friend3)) {
res[i]=0;
continue;
}
if ( min == 1 ) {
if ( max == 3 ) {
if ( friend2 - friend1 > 1 ) {
friend1++;
friend2--;
friend3--;
} else if ( friend2 - friend1 == 1 && friend3 - friend2 > 0 ) {
friend1++;
friend3--;
} else if (friend3 - friend2 > 1) {
friend1++;
friend2++;
friend3--;
} else if (friend3 - friend2 > 0) {
friend1++;
friend2++;
} else if (friend3 - friend2 == 0) {
friend1++;
}
} else {
if ( friend3 - friend1 > 1 ) {
friend1++;
friend3--;
friend2--;
} else if ( friend3 - friend1 == 1 && friend2 - friend3 > 0 ) {
friend1++;
friend2--;
} else if (friend2 - friend3 > 1) {
friend1++;
friend2--;
friend3++;
} else if (friend2 - friend3 > 0) {
friend1++;
friend3++;
} else if (friend2 - friend3 == 0) {
friend1++;
}
}
} else if ( min == 2 ) {
if ( max == 1 ) {
if ( friend3 - friend2 > 1 ) {
friend2++;
friend3--;
friend1--;
} else if (friend3 - friend2 == 1 && friend1 - friend3 > 0) {
friend1--;
friend2++;
} else if (friend1 - friend3 > 1) {
friend1--;
friend2++;
friend3++;
} else if (friend1 - friend3 > 0) {
friend2++;
friend3++;
} else if (friend1 - friend3 == 0) {
friend2++;
}
} else {
if ( friend1 - friend2 > 1 ) {
friend2++;//
friend1--;
friend3--;
} else if ( friend1 - friend2 == 1 && friend3 - friend1 > 0 ) {
friend2++;
friend3--;
} else if (friend3 - friend1 > 1) {
friend1++;
friend2++;
friend3--;
} else if (friend3 - friend1 > 0){
friend1++;
friend2++;
} else if (friend3 - friend1 == 0) {
friend2++;
}
}
} else {
if ( max == 1 ) {
if ( friend2 - friend3 > 1 ) {
friend3++;
friend2--;
friend1--;
} else if (friend2 - friend3 == 1 && friend1 - friend2 > 0) {
friend3++;
friend1--;
} else if (friend1 - friend2 > 1) {
friend1--;
friend2++;
friend3++;
} else if (friend1 - friend2 > 0){
friend2++;
friend3++;
} else if (friend1 - friend2 == 0) {
friend3++;
}
} else {
if ( friend1 - friend3 > 1 ) {
friend3++;
friend1--;
friend2--;
} else if ( friend1 - friend3 == 1 && friend2 - friend1 > 0 ) {
friend3++;
friend2--;
} else if (friend2 - friend1 > 1) {
friend1++;
friend2--;
friend3++;
} else if (friend2 - friend1 > 0){
friend1++;
friend3++;
} else if (friend2 - friend1 == 0) {
friend3++;
}
}
}
res[i]=dist(friend1, friend2, friend3);
}
for (int i =0 ; i<n; i++) {
cout<<res[i]<<endl;
}
}