-
Notifications
You must be signed in to change notification settings - Fork 0
/
rondom.rb
236 lines (225 loc) · 6.6 KB
/
rondom.rb
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
$stdout.sync = true
N, D, Q = gets.split.map(&:to_i)
ddd = D
question_time = 0
list = Array.new(D) { Array.new() }
repeated_question = Hash.new()
def repeated_check(h,l,r)
h.each{|key,val|
ll = []
rr = []
s = key.split.map &:to_i
now = 0
for i in 0...s.size
if s[i] == -1
now = 1
next
end
ll << s[i] if now == 0
rr << s[i] if now == 1
end
if val == "="
if (l == ll && r == rr) || (r == ll && l == rr)
return "="
end
elsif val == ">" #llの方が大きい
if (l.size >= (ll & l).size) && (r.size <= (rr & r).size)
return ">"
elsif (r.size >= (ll & r).size) && (l.size <= (rr & l).size)
return "<"
end
elsif val == "<" #rrの方が大きい
if (l.size >= (rr & l).size) && (r.size <= (ll & r).size)
return ">"
elsif (r.size >= (rr & r).size) && (l.size <= (ll & l).size)
return "<"
end
end
}
return nil
end
#トポロジカルソートっぽく1対1の既存質問を避ける
#重みもつける->=なら0で、
$up_to_down_tree = Array.new(N){Array.new(N, -1)}
$dist = Array.new(N,0)
$single_known = -1
def deeps(a,b,w,n)
$dist[a] = 1
if a == b
if w == 0
$single_known = 0
else
$single_known = 1
end
end
for i in 0...n
next if $dist[i] == 1
next if $up_to_down_tree[a][i] == -1
deeps(i,b,w += $up_to_down_tree[a][i],n)#0なら"=", 1なら">"
end
end
def single_known_check(a,b,n)
$single_known = -1
$dist = Array.new(n,0)
deeps(a,b,0,n)
if $single_known == 1
return ">"
elsif $single_known == 0
return "="
end
$dist = Array.new(n,0)
deeps(b,a,0,n)
if $single_known == 1
return "<"
elsif $single_known == 0
return "="
end
return nil
end
for i in 0...N
list[i % D] << i
end
list_copy = [[]]
roop_num = 0
change_flag = 0
while true
list_copy = list.map(&:dup)
lll = rand(D)
rrr = rand(D)
next if lll == rrr
roop_num += 1 if change_flag == 0
if change_flag == 1
roop_num = 0
change_flag = 0
end
which = rand(5)
# 多対多の交換
if which <= 3 || roop_num > N
next if list[lll].size == 1 || list[rrr].size == 1
lr_rand = rand(2)
if lr_rand == 0
lll_size, rrr_size = 2, 1
elsif lr_rand == 1
lll_size, rrr_size = 2, 2
end
lll_size = rrr_size = 1 if roop_num <= N
lll_size = [1, [list[lll].size - 1, lll_size].min].max
rrr_size = [1, [list[rrr].size - 1, rrr_size].min].max
lll_delete_list = []
rrr_delete_list = []
while (lll_delete_list.size < lll_size)
lll_delete_element = list[lll][rand(list[lll].size)]
next if lll_delete_list.include?(lll_delete_element)
lll_delete_list << lll_delete_element
end
while (rrr_delete_list.size < rrr_size)
rrr_delete_element = list[rrr][rand(list[rrr].size)]
next if rrr_delete_list.include?(rrr_delete_element)
rrr_delete_list << rrr_delete_element
end
question_content = "#{lll_delete_list.size} #{rrr_delete_list.size} #{lll_delete_list.join(" ")} #{rrr_delete_list.join(" ")}"
if lll_size == 1 && rrr_size == 1
single_check = single_known_check(lll_delete_list[0], rrr_delete_list[0], N)
if single_check == nil
break if question_time == Q
puts question_content
s = gets.chomp
repeated_question["#{lll_delete_list.join(" ")}" + " -1 " + "#{rrr_delete_list.join(" ")}"] = s
question_time += 1
if s == "="
$up_to_down_tree[lll_delete_list[0]][rrr_delete_list[0]] = 0
$up_to_down_tree[rrr_delete_list[0]][lll_delete_list[0]] = 0
elsif s == "<"
$up_to_down_tree[rrr_delete_list[0]][lll_delete_list[0]] = 1
elsif s == ">"
$up_to_down_tree[lll_delete_list[0]][rrr_delete_list[0]] = 1
end
else
s = single_check
end
else
repeated_check_temp = repeated_check(repeated_question,lll_delete_list,rrr_delete_list)
if repeated_check_temp == nil
break if question_time == Q
puts question_content
s = gets.chomp
repeated_question["#{lll_delete_list.join(" ")}" + " -1 " + "#{rrr_delete_list.join(" ")}"] = s
question_time += 1
else
s = repeated_check_temp
end
end
next if s == "="
first_answer = s
lll_delete_list.each { |del_l| list[lll].delete(del_l) }
rrr_delete_list.each { |del_r| list[rrr].delete(del_r) }
question_content = "#{list[lll].size} #{list[rrr].size} #{list[lll].join(" ")} #{list[rrr].join(" ")}"
if list[lll].size == 1 && list[rrr].size == 1
single_check = single_known_check(list[lll][0], list[rrr][0], N)
if single_check == nil
break if question_time == Q
puts question_content
s = gets.chomp
repeated_question["#{list[lll].join(" ")}" + " -1 " + "#{list[rrr].join(" ")}"] = s
question_time += 1
if s == "="
$up_to_down_tree[list[lll][0]][list[rrr][0]] = 0
$up_to_down_tree[list[rrr][0]][list[lll][0]] = 0
elsif s == "<"
$up_to_down_tree[list[rrr][0]][list[lll][0]] = 1
elsif s == ">"
$up_to_down_tree[list[lll][0]][list[rrr][0]] = 1
end
else
s = single_check
end
else
repeated_check_temp = repeated_check(repeated_question,list[lll],list[rrr])
if repeated_check_temp == nil
break if question_time == Q
puts question_content
s = gets.chomp
repeated_question["#{list[lll].join(" ")}" + " -1 " + "#{list[rrr].join(" ")}"] = s
question_time += 1
else
s = repeated_check_temp
end
end
if s != first_answer
list = list_copy.map(&:dup)
next
end
change_flag = 1
lll_delete_list.each { |del_l| list[rrr] << del_l }
rrr_delete_list.each { |del_r| list[lll] << del_r }
else
# 挿入
next if list[rrr].size == 1
upper_side = list[rrr][rand(list[rrr].size)]
list[rrr].delete(upper_side)
question_content = "#{list[lll].size} #{list[rrr].size} #{list[lll].join(" ")} #{list[rrr].join(" ")}"
repeated_check_temp = repeated_check(repeated_question,list[lll],list[rrr])
if repeated_check_temp == nil
break if question_time == Q
puts question_content
s = gets.chomp
question_time += 1
repeated_question["#{list[lll].join(" ")}" + " -1 " + "#{list[rrr].join(" ")}"] = s
else
s = repeated_check_temp
end
if s != "<"
list = list_copy.map(&:dup)
next
end
change_flag = 1
list[lll] << upper_side
end
end
ans = []
for i in 0...N
for j in 0...D
ans << j if list_copy[j].include?(i)
end
end
puts ans.join(" ")