-
Notifications
You must be signed in to change notification settings - Fork 183
Expand file tree
/
Copy pathmedian_sort.rb
More file actions
79 lines (62 loc) · 1.25 KB
/
median_sort.rb
File metadata and controls
79 lines (62 loc) · 1.25 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
$stdout.sync = true
def valid res
if res == -1
exit 0
end
return res
end
def printsAnswer res
puts res.join(' ')
$stdout.flush
judge = STDIN.gets.chomp.to_i;
valid(judge)
end
def query(i, j, k)
puts "#{i} #{j} #{k}"
$stdout.flush
res = STDIN.gets.chomp.to_i
return valid(res)
end
def solve ans
res = [1, 2]
n = ans.size
# try new index
for number in 3.upto(n)
start = 0
finish = res.size - 1
while finish-start >= 1
# divide list in 3 parts
a = start + (finish - start) / 3
b = finish - (finish - start) / 3
# query median
median = query(res[a], res[b], number)
# move limits of parts according to median
if median == res[a]
finish = a - 1
if start == finish
finish += 1
end
elsif median == res[b]
start = b + 1
if start == finish
start -= 1
end
elsif median == number
start = a + 1
finish = b - 1
if start == finish
start -= 1
end
end
end
# insert at correct index
res.insert(start, number)
end
printsAnswer(res)
end
t, n, q = STDIN.gets.split.map &:to_i;
0.upto(t - 1) do
answer = Array(1..n)
solve(answer)
end
exit 0