problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02837
|
n=int(input())
xy=[[] for i in range(n)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
x-=1
xy.append((x,y))
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
if cnt<=ans:continue
for j in range(n):
if i&(1<<j):
for x,y in xy[j]:
if y==1 and i&(1<<x):continue
if y==0 and i&(1<<x)==0:continue
break
else:
continue
break
else:
ans=cnt
print(ans)
|
n=int(input())
xy=[[] for i in range(n)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
x-=1
xy[i].append((x,y))
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
if cnt<=ans:continue
for j in range(n):
if i&(1<<j):
for x,y in xy[j]:
if y==1 and i&(1<<x):continue
if y==0 and i&(1<<x)==0:continue
break
else:
continue
break
else:
ans=cnt
print(ans)
|
[] | 641,302
| 641,303
|
u970197315
|
python
|
p02837
|
n = int(input())
tst = [[] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x,y = map(int,input().split())
st[i].append([x,y])
ans = 0
for bit in range(1<<n):
honest = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
honest[-1-i] = 1
for i in range(n):
if not honest[i]:
continue
for l in tst[i]:
if l[1]!=honest[l[0]-1]:
check = 0
break
if check:
ans = max(ans,sum(honest))
print(ans)
|
n = int(input())
tst = [[] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x,y = map(int,input().split())
tst[i].append([x,y])
ans = 0
for bit in range(1<<n):
honest = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
honest[-1-i] = 1
for i in range(n):
if not honest[i]:
continue
for l in tst[i]:
if l[1]!=honest[l[0]-1]:
check = 0
break
if check:
ans = max(ans,sum(honest))
print(ans)
|
[
"identifier.change"
] | 641,313
| 641,314
|
u531599639
|
python
|
p02837
|
#入力はn人のx,yに分けないといけない
n = int(input())
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
testimony = [[2]*n for i in range(n)]
for i in range(n):
for j in range(a[i]):
if (y[i][j] == 1):
testimony[i][x[i][j] - 1] = 1
elif(y[i][j] == 0):
testimony[i][x[i][j]-1] = 0
ans = 0
for i in range(2**n):
bit_list = []
for j in range(n):
if ((i >> j) & 1):
bit_list.append(1)
else:
bit_list.append(0)
print(bit_list)
flag = 1
for k in range(n):
if(bit_list[k] == 1):
for l in range(n):
if(testimony[k][l] != 2):
if(testimony[k][l] != bit_list[l]):
flag = 0
break
if(flag == 1):
ans = max(sum(bit_list),ans)
print(ans)
|
#入力はn人のx,yに分けないといけない
n = int(input())
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
testimony = [[2]*n for i in range(n)]
for i in range(n):
for j in range(a[i]):
if (y[i][j] == 1):
testimony[i][x[i][j] - 1] = 1
elif(y[i][j] == 0):
testimony[i][x[i][j]-1] = 0
ans = 0
for i in range(2**n):
bit_list = []
for j in range(n):
if ((i >> j) & 1):
bit_list.append(1)
else:
bit_list.append(0)
flag = 1
for k in range(n):
if(bit_list[k] == 1):
for l in range(n):
if(testimony[k][l] != 2):
if(testimony[k][l] != bit_list[l]):
flag = 0
break
if(flag == 1):
ans = max(sum(bit_list),ans)
print(ans)
|
[
"call.remove"
] | 641,329
| 641,330
|
u694810977
|
python
|
p02837
|
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
def ternary (n, k, length):
if n == 0:
nums = ['0' for i in range(length)]
nums = ''.join(nums)
return nums
nums = ''
while n:
n, r = divmod(n, k)
nums += str(r)
nums = nums[::-1]
nums = nums.zfill(length)
return nums
def main():
num = int(input())
say_count = []
say_data = []
for i in range(num):
aaa = int(input())
say_count.append(aaa)
data = [list(map(int, input().split())) for i in range(aaa)]
say_data.append(data)
ans = 0
for i in range(2 ** num):
bin_data = list(map(int, ternary(i, 2, num)))
kari_ans = bin_data.count(1)
people_flg = [-1 for i in range(num)]
dame_flg = 0
for j in range(num):
if people_flg[j] == -1:
people_flg[j] = bin_data[j]
else:
if people_flg[j] != bin_data[j]:
dame_flg = 1
if people_flg[j] == 0:
continue
for k in range(say_count[j]):
people, flg = [say_dataj][k]
people -= 1
if people_flg[people] == -1:
people_flg[people] = flg
else:
if people_flg[people] != flg:
dame_flg = 1
if dame_flg:
break
if dame_flg:
continue
ans = max(ans, kari_ans)
print(ans)
if __name__ == '__main__':
main()
|
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
def ternary (n, k, length):
if n == 0:
nums = ['0' for i in range(length)]
nums = ''.join(nums)
return nums
nums = ''
while n:
n, r = divmod(n, k)
nums += str(r)
nums = nums[::-1]
nums = nums.zfill(length)
return nums
def main():
num = int(input())
say_count = []
say_data = []
for i in range(num):
aaa = int(input())
say_count.append(aaa)
data = [list(map(int, input().split())) for i in range(aaa)]
say_data.append(data)
ans = 0
for i in range(2 ** num):
bin_data = list(map(int, ternary(i, 2, num)))
kari_ans = bin_data.count(1)
people_flg = [-1 for i in range(num)]
dame_flg = 0
for j in range(num):
if people_flg[j] == -1:
people_flg[j] = bin_data[j]
else:
if people_flg[j] != bin_data[j]:
dame_flg = 1
if people_flg[j] == 0:
continue
for k in range(say_count[j]):
people, flg = say_data[j][k]
people -= 1
if people_flg[people] == -1:
people_flg[people] = flg
else:
if people_flg[people] != flg:
dame_flg = 1
if dame_flg:
break
if dame_flg:
continue
ans = max(ans, kari_ans)
print(ans)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"variable_access.subscript.index.change"
] | 641,331
| 641,332
|
u584174687
|
python
|
p02837
|
N = int(input())
g = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for i in range(1 << N):
hornest = [0] * N
for j in range(N):
if (i << j)&1:
hornest[j] = 1
is_ok = 1
for j in range(N):
if hornest[j]:
for k in range(N):
if g[j][k] == -1:
continue
if g[j][k] != hornest[k]:
is_ok = 0
if is_ok:
ans = max(ans,hornest.count(1))
print(ans)
|
N = int(input())
g = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for i in range(1 << N):
hornest = [0] * N
for j in range(N):
if (i >> j)&1:
hornest[j] = 1
is_ok = 1
for j in range(N):
if hornest[j] and is_ok:
for k in range(N):
if g[j][k] == -1:
continue
if g[j][k] != hornest[k]:
is_ok = 0
if is_ok:
ans = max(ans,hornest.count(1))
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,347
| 641,348
|
u883866798
|
python
|
p02837
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) & 1:
continue
for x, y in (xy[j]):
if (i >> x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) & 1:
for x, y in (xy[j]):
if (i >> x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
[] | 641,351
| 641,352
|
u062754605
|
python
|
p02837
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i << j) & 1:
continue
for x, y in (xy[j]):
if (i << x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) & 1:
for x, y in (xy[j]):
if (i >> x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
[
"control_flow.branch.if.condition.change"
] | 641,353
| 641,352
|
u062754605
|
python
|
p02837
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i << j) & 1:
continue
for x, y in (xy[j]):
if (i >> x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) & 1:
for x, y in (xy[j]):
if (i >> x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
cnt = bin(i)[2:].count('1')
if cnt > c_max:
c_max = cnt
print(c_max)
|
[
"control_flow.branch.if.condition.change"
] | 641,354
| 641,352
|
u062754605
|
python
|
p02837
|
N = int(input())
A = []
XY = []
honest_count = []
for i in range(N):
a = int(input())
A.append(a)
inter = []
for x in range(a):
xy = list(map(int,input().split()))
inter.append(xy)
XY.append(inter)
print(XY)
for i in range(2**N):
pt = [0]*N
ck = 1
for j in range(N):
if (i>>j)&1:
pt[N-j-1]=1
for k in range(N):
if pt[k] ==1:
for l in range(A[k]):
if XY[k][l][1] != pt[XY[k][l][0] -1]: # 正直者と仮定した人の証言に矛盾がないかをチェック。正しいと向けられた人の証言が自分に返ってこないか。
ck = 0
if ck == 1:
honest_count.append(sum(pt))
print(max(honest_count))
|
N = int(input())
A = []
XY = []
honest_count = []
for i in range(N):
a = int(input())
A.append(a)
inter = []
for x in range(a):
xy = list(map(int,input().split()))
inter.append(xy)
XY.append(inter)
#print(XY)
for i in range(2**N):
pt = [0]*N
ck = 1
for j in range(N):
if (i>>j)&1:
pt[N-j-1]=1
for k in range(N):
if pt[k] ==1:
for l in range(A[k]):
if XY[k][l][1] != pt[XY[k][l][0] -1]: # 正直者と仮定した人の証言に矛盾がないかをチェック。正しいと向けられた人の証言が自分に返ってこないか。
ck = 0
if ck == 1:
honest_count.append(sum(pt))
print(max(honest_count))
|
[
"call.remove"
] | 641,355
| 641,356
|
u166621202
|
python
|
p02837
|
#C
n = int(input())
a = []
testimony = [-1]*n
ans = 0
for i in range(n):
a.append(int(input()))#証言の個数
l = []
for j in range(a[i]):
l.append(list(map(int, input().split())))
if l != []:
testimony[i] = l#iの人のa[i]個の証言のリスト
for i in range(2**n):
for j in range(n):
if (i >> j) & 1 and a[n-1-j] != -1:
for k in range(a[n-1-j]):
if (i >> (n - testimony[n-1-j][k][0])) != testimony[n-1-j][k][1]:
break
else:
continue
break
else:
ans = max(ans, str(bin(i)).count('1'))
print(ans)
|
#C
n = int(input())
a = []
testimony = [-1]*n
ans = 0
for i in range(n):
a.append(int(input()))#証言の個数
l = []
for j in range(a[i]):
l.append(list(map(int, input().split())))
if l != []:
testimony[i] = l#iの人のa[i]個の証言のリスト
for i in range(2**n):
for j in range(n):
if (i >> j) & 1 and testimony[n-1-j] != -1:
for k in range(a[n-1-j]):
if ((i >> (n - testimony[n-1-j][k][0])) & 1) != testimony[n-1-j][k][1]:
break
else:
continue
break
else:
ans = max(ans, str(bin(i)).count('1'))
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,359
| 641,358
|
u297667660
|
python
|
p02837
|
N = int(input())
x = []
y = []
words = []
for i in range(N):
A = int(input())
W = []
for _ in range(A):
x, y = map(int, input().split())
W.append([x-1, y])
words.append(W)
ans = 0
for bit in range(1<<n):
ok = True
is_honest = [(bit>>i) & 1 for i in range(N)]
for i in range(N):
if not is_honest[i]:
continue
for x, y in words[i]:
if is_honest[x] != y:
ok = False
if ok:
ans = max(ans, sum(is_honest))
print(ans)
|
N = int(input())
x = []
y = []
words = []
for i in range(N):
A = int(input())
W = []
for _ in range(A):
x, y = map(int, input().split())
W.append([x-1, y])
words.append(W)
ans = 0
for bit in range(1<<N):
ok = True
is_honest = [(bit>>i) & 1 for i in range(N)]
for i in range(N):
if not is_honest[i]:
continue
for x, y in words[i]:
if is_honest[x] != y:
ok = False
if ok:
ans = max(ans, sum(is_honest))
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,362
| 641,363
|
u189516107
|
python
|
p02837
|
N = int(input())
lst = [[] for _ in range(N + 1)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
lst[i].append([x - 1, y])
ans = 0
for i in range(2 ** N):
check = [-1] * N #1:正直者、0:不親切
count = 0 #カウント用
flag = True
for j in range(N):
if (i >> j) & 1: #正直者のとき
if check[j] == 0: #矛盾しているとき
flag = False
break
else:
check[j] == 1
# count += 1
for x, y in lst[j]:
if y == 1:
if check[x] != 0:
check[x] = 1
else: #矛盾しているとき
flag = False
break
else: #y == 0
if check[x] != 1:
check[x] = 0
else:
flag = False
break
else: #正直者でないとき
if check[j] == 1:
flag = False
break
else:
check[j] = 0
if flag == False:
break
if flag:
tmp = 0
for j in range(N):
if (i >> j) & 1:
tmp += 1
# print (i)
# print (check, flag)
ans = max(ans, tmp)
print (ans)
# print (lst)
|
N = int(input())
lst = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
lst[i].append([x - 1, y])
ans = 0
for i in range(2 ** N):
check = [-1] * N #1:正直者、0:不親切
count = 0 #カウント用
flag = True
for j in range(N):
if (i >> j) & 1: #正直者のとき
if check[j] == 0: #矛盾しているとき
flag = False
break
else:
check[j] = 1
# count += 1
for x, y in lst[j]:
if y == 1: #行き先が正直者
if check[x] != 0:
check[x] = 1
else: #矛盾しているとき
flag = False
break
else: #y == 0
if check[x] != 1:
check[x] = 0
else:
flag = False
break
else: #正直者でないとき
if check[j] == 1:
flag = False
break
else:
check[j] = 0
if flag == False:
break
if flag:
tmp = 0
for j in range(N):
if (i >> j) & 1:
tmp += 1
# print (i)
# print (check, flag)
ans = max(ans, tmp)
print (ans)
# print (lst)
|
[
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 641,384
| 641,385
|
u263830634
|
python
|
p02837
|
import math
import itertools
# -1 no ans
# 1 syoziki
# 0 hu sinsetu
N = int(input())
ans = [[-1] * N for i in range(N)]
for person in range(N):
A = int(input())
print(A)
for _ in range(A):
x, y = map(int, input().split())
x -= 1
ans[person][x] = y
def is_ok(num):
# -1 not decided
# 1 syoziki
# 0 husinsetu
people = [-1] * N
for i in range(N):
# i is syoziki
if((num >> i) & 1):
if(people[i] == 0):
return False
people[i] = 1
for j in range(N):
if(ans[i][j] == 1):
if(people[j] == 0):
return False
people[j] = 1
if(ans[i][j] == 0):
if(people[j] == 1):
return False
people[j] = 0
else:
if(people[i] == 1):
return False
people[i] = 0
return True
def countBit(num):
ori = num
count = 0
while(num > 0):
if(num & 1):
count += 1
num = num >> 1
return count
out = 0
for i in range(1 << N):
if(is_ok(i)):
out = max(out, countBit(i))
print(out)
|
import math
import itertools
# -1 no ans
# 1 syoziki
# 0 hu sinsetu
N = int(input())
ans = [[-1] * N for i in range(N)]
for person in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
x -= 1
ans[person][x] = y
def is_ok(num):
# -1 not decided
# 1 syoziki
# 0 husinsetu
people = [-1] * N
for i in range(N):
# i is syoziki
if((num >> i) & 1):
if(people[i] == 0):
return False
people[i] = 1
for j in range(N):
if(ans[i][j] == 1):
if(people[j] == 0):
return False
people[j] = 1
if(ans[i][j] == 0):
if(people[j] == 1):
return False
people[j] = 0
else:
if(people[i] == 1):
return False
people[i] = 0
return True
def countBit(num):
ori = num
count = 0
while(num > 0):
if(num & 1):
count += 1
num = num >> 1
return count
out = 0
for i in range(1 << N):
if(is_ok(i)):
out = max(out, countBit(i))
print(out)
|
[
"call.remove"
] | 641,396
| 641,397
|
u671060652
|
python
|
p02837
|
import itertools
n=int(input())
la=[]
for _ in range(n):
d=int(input())
for dd in d:
x,y=map(int,input().split())
la.append([_,x-1,y])
ans=0
for i in itertools.product([0,1],repeat=n):
s=sum(list(i))
for l in la:
if i[l[0]]==1 and i[l[1]]!=l[2]:
break
else:
ans=max(ans,s)
print(ans)
|
import itertools
n=int(input())
la=[]
for _ in range(n):
d=int(input())
for dd in range(d):
x,y=map(int,input().split())
la.append([_,x-1,y])
ans=0
for i in itertools.product([0,1],repeat=n):
s=sum(list(i))
for l in la:
if i[l[0]]==1 and i[l[1]]!=l[2]:
break
else:
ans=max(ans,s)
print(ans)
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,398
| 641,399
|
u932868243
|
python
|
p02837
|
from itertools import combinations
n = int(input())
a = []
xy = [] #xy[i人目][j個目][0: x, 1: y]
for i in range(n):
a.append(int(input()))
xy.append([])
for _ in range(a[i]):
xy[i].append([int(i) for i in input().split()])
ans = 0
for i in range(n): #i人の正直者
b = list(combinations(list(range(n)), i))
for j in range(len(b)): #組み合わせj
flag = False
#print(b[j])
for k in b[j]: #人k
for l in range(a[k]): #証言l
if (xy[k][l][0] - 1 in b[j] and xy[k][l][1] != 1) or ((not xy[k][l][0] - 1 in b[j]) and xy[k][l][1] == 1):
flag = True
break
#print(xy[k][l][0], xy[k][l][1])
if flag:
break
if not flag:
#print('YES', j)
ans = i
print(ans)
|
from itertools import combinations
n = int(input())
a = []
xy = [] #xy[i人目][j個目][0: x, 1: y]
for i in range(n):
a.append(int(input()))
xy.append([])
for _ in range(a[i]):
xy[i].append([int(i) for i in input().split()])
ans = 0
for i in range(n + 1): #i人の正直者
b = list(combinations(list(range(n)), i))
for j in range(len(b)): #組み合わせj
flag = False
#print(b[j])
for k in b[j]: #人k
for l in range(a[k]): #証言l
if (xy[k][l][0] - 1 in b[j] and xy[k][l][1] != 1) or ((not xy[k][l][0] - 1 in b[j]) and xy[k][l][1] == 1):
flag = True
break
#print(xy[k][l][0], xy[k][l][1])
if flag:
break
if not flag:
#print('YES', j)
ans = i
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 641,415
| 641,416
|
u287500079
|
python
|
p02837
|
from collections import deque
n = int(input())
work = []
for i in range(n):
a = int(input())
work.append([list(map(int, input().split())) for i in range(a)])
result = 0
for i in range(2**n):
state = bin(i)[2:].zfill(n)
honest = []
unkind = []
for j in range(n):
if state[j] == "0":
unkind.append(j)
else:
honest.append(j)
flag = True
for human in honest:
for x, y in work[human-1]:
if y == 1 and x in unkind:
flag = False
break
elif y == 0 and x in honest:
flag = False
break
if not flag:
break
if flag:
result = result if result>len(honest) else len(honest)
print(result)
|
from collections import deque
n = int(input())
work = []
for i in range(n):
a = int(input())
work.append([list(map(int, input().split())) for i in range(a)])
result = 0
for i in range(2**n):
state = bin(i)[2:].zfill(n)
honest = []
unkind = []
for j in range(n):
if state[j] == "0":
unkind.append(j+1)
else:
honest.append(j+1)
flag = True
for human in honest:
for x, y in work[human-1]:
if y == 1 and x in unkind:
flag = False
break
elif y == 0 and x in honest:
flag = False
break
if not flag:
break
if flag:
result = result if result>len(honest) else len(honest)
print(result)
|
[
"expression.operation.binary.add"
] | 641,426
| 641,427
|
u060736237
|
python
|
p02837
|
import numpy as np
import itertools
n = int(input())
info = []
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
info.append((i, x - 1, y))
a = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)
for i, x, y in info:
bl = (~a[:, i]) | (a[:, x] == bool(y))
print(bl)
a = a[bl]
ans = a.sum(axis=1).max()
print(ans)
|
import numpy as np
import itertools
n = int(input())
info = []
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
info.append((i, x - 1, y))
a = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)
for i, x, y in info:
bl = (~a[:, i]) | (a[:, x] == bool(y))
a = a[bl]
ans = a.sum(axis=1).max()
print(ans)
|
[
"call.remove"
] | 641,430
| 641,431
|
u157020659
|
python
|
p02837
|
n = int(input())
def make_remark_list(i, r):
# -1: 不明, 0: 嘘つき, 1: 真実
people = [-1] * n
people[i] = 1
for x, y in r:
people[x - 1] = y
return people
def check(x, y):
new_list = []
for a, b in zip(x, y):
a, b = min(a, b), max(a, b)
if (a, b) == (0, 1):
return False
elif (a, b) == (-1, 0):
new_list.append(0)
else:
new_list.append(max(a, b))
return new_list
remarks = []
for i in range(n):
a = int(input())
r = [tuple(map(int, input().split())) for _ in range(a)]
remarks.append(make_remark_list(i, r))
print(remarks)
def max_count(r, cnt, i = 0):
tmp = r
for j, r_j in enumerate(remarks):
if j < i: continue
if tmp[j] == 0:
continue
elif tmp[j] == 1:
if check(tmp, r_j):
tmp = check(tmp, r_j)
cnt += 1
else:
cnt = 0
break
else:
tmp[j] = 1
if check(tmp, r_j):
cnt_1, tmp_1 = max_count(tmp, cnt, j)
tmp[j] = 0
cnt_0, tmp_0 = max_count(tmp, cnt, j)
if cnt_0 > cnt_1:
return cnt_0, tmp_0
else:
return cnt_1, tmp_1
else:
tmp[j] = 0
return cnt, tmp
r = [-1] * n
cnt, r = max_count(r, 0)
print(cnt)
|
n = int(input())
def make_remark_list(i, r):
# -1: 不明, 0: 嘘つき, 1: 真実
people = [-1] * n
people[i] = 1
for x, y in r:
people[x - 1] = y
return people
def check(x, y):
new_list = []
for a, b in zip(x, y):
a, b = min(a, b), max(a, b)
if (a, b) == (0, 1):
return False
elif (a, b) == (-1, 0):
new_list.append(0)
else:
new_list.append(max(a, b))
return new_list
remarks = []
for i in range(n):
a = int(input())
r = [tuple(map(int, input().split())) for _ in range(a)]
remarks.append(make_remark_list(i, r))
def max_count(r, cnt, i = 0):
tmp = r
for j, r_j in enumerate(remarks):
if j < i: continue
if tmp[j] == 0:
continue
elif tmp[j] == 1:
if check(tmp, r_j):
tmp = check(tmp, r_j)
cnt += 1
else:
cnt = 0
break
else:
tmp[j] = 1
if check(tmp, r_j):
cnt_1, tmp_1 = max_count(tmp, cnt, j)
tmp[j] = 0
cnt_0, tmp_0 = max_count(tmp, cnt, j)
if cnt_0 > cnt_1:
return cnt_0, tmp_0
else:
return cnt_1, tmp_1
else:
tmp[j] = 0
return cnt, tmp
r = [-1] * n
cnt, r = max_count(r, 0)
print(cnt)
|
[
"call.remove"
] | 641,432
| 641,433
|
u157020659
|
python
|
p02837
|
import sys
N = int(input())
A = []
[A.append([]) for _ in range(N)]
for i in range(N):
for j in range(int(input())):
x , y = map(int,input().split())
A[i].append([x,y])
maxT = 0
for i in range(2**N -1):
ju = [0] * N
ind = 0
# trust
trust = 0
for b in reversed(str(bin(i))[2::]):
if b == "1":
ju[ind] = 1
trust += 1
ind += 1
flag = 0
for n in range(N):
if ju[n] == 0:
continue
for y in A[n]:
if ju[y[0]-1] != y[1]:
flag = 1
break
if flag == 1:
break
if flag == 0:
maxT = max(maxT , trust )
print(maxT)
|
import sys
N = int(input())
A = []
[A.append([]) for _ in range(N)]
for i in range(N):
for j in range(int(input())):
x , y = map(int,input().split())
A[i].append([x,y])
maxT = 0
for i in range(2**N ):
ju = [0] * N
ind = 0
trust = 0
for b in reversed(str(bin(i))[2::]):
if b == "1":
ju[ind] = 1
trust += 1
ind += 1
flag = 0
for n in range(N):
if ju[n] == 0:
continue
for y in A[n]:
if ju[y[0]-1] != y[1]:
flag = 1
break
if flag == 1:
break
if flag == 0:
maxT = max(maxT , trust )
print(maxT)
|
[
"expression.operation.binary.remove"
] | 641,450
| 641,451
|
u192042624
|
python
|
p02837
|
import itertools
n = int(input())
speak = [[] for _ in range(n)]
for i in range(n):
s = int(input())
for j in range(s):
a,b = map(int,input().split())
tal = (a-1,b)
speak[i].append(tal)
check = 0
b = [i for i in range(n)]
c = len(b)
b_pairs = []
for i in range(1,n+1):
b_pairs += list(itertools.combinations(b,i))
for i in b_pairs:
tru = []
for j in i:
tru.append(j)
leng = len(tru)
if leng <= check:
break
for k in tru:
z = 1
for d,e in speak[k]:
if d in tru:
if e == 1:
continue
else:
z = 0
else:
if e == 0:
continue
else:
z = 0
if z == 0:
break
else:
check = leng
print(check)
|
import itertools
n = int(input())
speak = [[] for _ in range(n)]
for i in range(n):
s = int(input())
for j in range(s):
a,b = map(int,input().split())
tal = (a-1,b)
speak[i].append(tal)
check = 0
b = [i for i in range(n)]
c = len(b)
b_pairs = []
for i in range(1,n+1):
b_pairs += list(itertools.combinations(b,i))
for i in b_pairs:
tru = []
for j in i:
tru.append(j)
leng = len(tru)
if leng <= check:
continue
for k in tru:
z = 1
for d,e in speak[k]:
if d in tru:
if e == 1:
continue
else:
z = 0
else:
if e == 0:
continue
else:
z = 0
if z == 0:
break
else:
check = leng
print(check)
|
[
"control_flow.break.remove",
"control_flow.continue.add"
] | 641,454
| 641,455
|
u346395915
|
python
|
p02837
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)==g[i][j]:
flag=0
break
if flag==0:break
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!=g[i][j]:
flag=0
break
if flag==0:break
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 641,459
| 641,460
|
u265506056
|
python
|
p02837
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i)==1:
for j in range(N):
if g[i][j]!=-1 and (s>>j)!=g[i][j]:
flag=0
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!=g[i][j]:
flag=0
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,461
| 641,462
|
u265506056
|
python
|
p02837
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i)==1:
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!=g[i][j]:
flag=0
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!=g[i][j]:
flag=0
if flag==1:
t=0
x=s
while x>0:
t+=x%2
x//=2
ans=max(ans,t)
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 641,463
| 641,462
|
u265506056
|
python
|
p02837
|
n = int(input())
s =[[] for _ in range(n)]
for i in range(n):
a_tmp = int(input())
for _ in range(a_tmp):
x,y = map(int,input().split())
s[i].append([x,y])
#print(s)
mx = 2**n -1
def hantei(num):
flag=0
bi =[0 for _ in range(n)]
for j in range(n):
bi[j] = (num>>j)%2
for j in range(n):
if((num>>j)%2 == 1):
for x,y in s[j]:
if(y != bi[x-1]):
flag = 1
return flag
return flag
ans = 0
for i in range(mx):
if(hantei(i) == 0):
#print(i)
ans = max(ans,bin(i)[2::].count("1"))
print(ans)
#print(bin(3)[2::].count("1"))
#print(hantei(3))
|
n = int(input())
s =[[] for _ in range(n)]
for i in range(n):
a_tmp = int(input())
for _ in range(a_tmp):
x,y = map(int,input().split())
s[i].append([x,y])
#print(s)
mx = 2**n
def hantei(num):
flag=0
bi =[0 for _ in range(n)]
for j in range(n):
bi[j] = (num>>j)%2
for j in range(n):
if((num>>j)%2 == 1):
for x,y in s[j]:
if(y != bi[x-1]):
flag = 1
return flag
return flag
ans = 0
for i in range(mx):
if(hantei(i) == 0):
#print(i)
ans = max(ans,bin(i)[2::].count("1"))
print(ans)
#print(bin(3)[2::].count("1"))
#print(hantei(3))
|
[
"expression.operation.binary.remove"
] | 641,479
| 641,480
|
u797572808
|
python
|
p02837
|
def main():
N = int(input())
testimony = [[] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x,y = map(int,input().split())
testimony[i].append([x,y])
ans = 0
for i in range(2**N):##証言について、2^N通り
for j in range(N):##N人について検証
flag = True
if (i>>j)&1:##正直者である場合
for x,y in testimony[j]:
if ((i>>x)&1) != y:##嘘をついている
flag = False
break
if not flag:
break
if flag:##全員正直であった場合
tmp = list(bin(i))
ans = max(ans,tmp[2:].count("1"))
print(ans)
if __name__ == "__main__":
main()
|
def main():
N = int(input())
testimony = [[] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x,y = map(int,input().split())
testimony[i].append([x-1,y])##0-indexに直す
ans = 0
for i in range(2**N):##証言について、2^N通り
for j in range(N):##N人について検証
flag = True
if (i>>j)&1:##正直者である場合
for x,y in testimony[j]:
if ((i>>x)&1) != y:##嘘をついている
flag = False
break
if not flag:
break
if flag:##全員正直であった場合
tmp = list(bin(i))
ans = max(ans,tmp[2:].count("1"))
print(ans)
if __name__ == "__main__":
main()
|
[
"expression.operation.binary.add"
] | 641,493
| 641,494
|
u497952650
|
python
|
p02837
|
import sys
input = sys.stdin.readline
N = int(input())
A = []
xy = []
ans = []
sm = 0
for _ in range(N):
temp = int(input())
A.append([temp, sm])
sm += temp
for _ in range(A[-1][0]):
xy.append(list(map(int, input().split())))
for i in range(2**N):
flag = True
binary = bin(i)[2:]
if len(binary) < N:
binary = '0' * (N - len(binary)) + binary
check = [0]*N
for j, digit in enumerate(binary):
if digit == '1':
check[j] = 1
for j, value in enumerate(check):
if value == 1:
for k in range(A[j][0]):
x = xy[A[j][1]+k-1][0] - 1
y = xy[A[j][1]+k-1][1]
if check[x] != y:
flag = False
if flag:
ans.append(check.count(1))
print(max(ans))
|
import sys
input = sys.stdin.readline
N = int(input())
A = []
xy = []
ans = []
sm = 0
for _ in range(N):
temp = int(input())
A.append([temp, sm])
sm += temp
for _ in range(A[-1][0]):
xy.append(list(map(int, input().split())))
for i in range(2**N):
flag = True
binary = bin(i)[2:]
if len(binary) < N:
binary = '0' * (N - len(binary)) + binary
check = [0]*N
for j, digit in enumerate(binary):
if digit == '1':
check[j] = 1
for j, value in enumerate(check):
if value == 1:
for k in range(A[j][0]):
x = xy[A[j][1]+k][0] - 1
y = xy[A[j][1]+k][1]
if check[x] != y:
flag = False
if flag:
ans.append(check.count(1))
print(max(ans))
|
[
"expression.operation.binary.remove"
] | 641,505
| 641,506
|
u047023156
|
python
|
p02837
|
def bitcnt(n):
n=(n&0x55555555)+(n>>1&0x55555555)
n=(n&0x33333333)+(n>>2&0x33333333)
n=(n&0x0f0f0f0f)+(n>>4&0x0f0f0f0f)
n=(n&0x00ff00ff)+(n>>8&0x00ff00ff)
n=(n&0x0000ffff)+(n>>16&0x0000ffff)
return n
N = int(input())
xy = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
x -= 1
xy[i][x] = y
r = 0
for i in range(1<<N):
t = [i>>j&1 for j in range(N)]
ok = True
for j in range(N):
if t[j]:
for k in range(N):
if xy[j][k] == -1:
continue
if xy[j][k] != t[j]:
ok = False
break
if ok:
r = max(r, bitcnt(i))
print(r)
|
def bitcnt(n):
n=(n&0x55555555)+(n>>1&0x55555555)
n=(n&0x33333333)+(n>>2&0x33333333)
n=(n&0x0f0f0f0f)+(n>>4&0x0f0f0f0f)
n=(n&0x00ff00ff)+(n>>8&0x00ff00ff)
n=(n&0x0000ffff)+(n>>16&0x0000ffff)
return n
N = int(input())
xy = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
x -= 1
xy[i][x] = y
r = 0
for i in range(1<<N):
t = [i>>j&1 for j in range(N)]
ok = True
for j in range(N):
if t[j]:
for k in range(N):
if xy[j][k] == -1:
continue
if xy[j][k] != t[k]:
ok = False
break
if ok:
r = max(r, bitcnt(i))
print(r)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,527
| 641,528
|
u804455323
|
python
|
p02837
|
N = int(input())
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
evidences[i].append((x - 1, y))
ans=0
for i in range(N**2):
flag=True
for j in range(N):
if (i>>j)&1==0:
continue
for x,y in evidences[j]:
if (i>>x)&1!=y:
flag=False
break
if not flag:
break
if flag:
ans=max(ans,bin(i)[2:].count('1'))
print(ans)
|
N = int(input())
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
evidences[i].append((x - 1, y))
ans=0
for i in range(2**N):
flag=True
for j in range(N):
if (i>>j)&1==0:
continue
for x,y in evidences[j]:
if (i>>x)&1!=y:
flag=False
break
if not flag:
break
if flag:
ans=max(ans,bin(i)[2:].count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 641,550
| 641,551
|
u970899068
|
python
|
p02837
|
n=int(input())
Y=[]*n
for i in range(n):
Y.append([-1]*n)
for i in range(n):
for j in range(int(input())):
x,y=map(int,input().split())
Y[i][x-1]=y
ans=0
for c in range(2**n):
b=bin(c)[2:]
B=[0]*n
for i in range(len(b)):
B[i]=int(b[i])
a=0
for i in range(n):
if B[i]==1:
for j in range(n):
if B[j]+Y[i][j]==1:
a=1
break
if a>0:
break
if a==0:
ans=max(ans,sum(B))
print(ans)
|
n=int(input())
Y=[]*n
for i in range(n):
Y.append([-1]*n)
for i in range(n):
for j in range(int(input())):
x,y=map(int,input().split())
Y[i][x-1]=y
ans=0
for c in range(2**n):
b=bin(c)[2:]
B=[0]*n
for i in range(len(b)):
B[-i-1]=int(b[-i-1])
a=0
for i in range(n):
if B[i]==1:
for j in range(n):
if B[j]+Y[i][j]==1:
a=1
break
if a>0:
break
if a==0:
ans=max(ans,sum(B))
print(ans)
|
[
"expression.operation.unary.add",
"call.arguments.change"
] | 641,555
| 641,556
|
u774539708
|
python
|
p02837
|
#!/usr/bin/env python3
def put(a, k, v):
if k in a:
if a[k] != v:
return False
else:
a[k] = v
return True
def check(n, t, i):
a = {}
m = 0
for j in range(n):
honest = i >> j & 1
m += honest
if not put(a, j+1, honest):
return 0
for (k, h) in t[j+1].items():
if not put(a, k, h if honest else 1 - h):
return 0
return m
def solve(n, t):
print(max([check(n, t, i) for i in range(1 << n)]))
def main():
t = {}
n = int(input())
for i in range(n):
a = int(input())
t[i+1] = {}
for j in (range(a)):
x, y = map(int, input().split())
t[i+1][x] = y
solve(n, t)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
def put(a, k, v):
if k in a:
if a[k] != v:
return False
else:
a[k] = v
return True
def check(n, t, i):
a = {}
m = 0
for j in range(n):
honest = i >> j & 1
m += honest
if not put(a, j+1, honest):
return 0
if honest:
for (k, h) in t[j+1].items():
if not put(a, k, h if honest else 1 - h):
return 0
return m
def solve(n, t):
print(max([check(n, t, i) for i in range(1 << n)]))
def main():
t = {}
n = int(input())
for i in range(n):
a = int(input())
t[i+1] = {}
for j in (range(a)):
x, y = map(int, input().split())
t[i+1][x] = y
solve(n, t)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.add"
] | 641,563
| 641,564
|
u904608957
|
python
|
p02837
|
n = int(input())
def func(x):
res = []
for i in range(n):
res.append(x%2)
x //= 2
return res
test = {}
for i in range(n):
A = int(input())
test[i+1] = []
for a in range(A):
x,y = map(int,input().split())
test[i].append((x,y))
ans = 0
for i in range(2**n):
people = func(i)
for i in range(n):
if people[i]:
for x,y in test[i+1]:
if people[x-1] == y:
continue
else:
break
else:
continue
break
else:
ans = max(sum(people),ans)
print(ans)
|
n = int(input())
def func(x):
res = []
for i in range(n):
res.append(x%2)
x //= 2
return res
test = {}
for i in range(n):
A = int(input())
test[i+1] = []
for a in range(A):
x,y = map(int,input().split())
test[i+1].append((x,y))
ans = 0
for i in range(2**n):
people = func(i)
for i in range(n):
if people[i]:
for x,y in test[i+1]:
if people[x-1] == y:
continue
else:
break
else:
continue
break
else:
ans = max(sum(people),ans)
print(ans)
|
[
"expression.operation.binary.add"
] | 641,569
| 641,570
|
u103902792
|
python
|
p02837
|
# -*- coding: utf-8 -*-
################ DANGER ################
test = ""
#test = \
"""
3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0
ans 0
"""
"""
3
1
2 1
1
1 1
1
2 0
ans 2
"""
"""
2
1
2 0
1
1 0
ans 1
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
return test.pop()
else:
def input2():
return input()
########################################
n = int(input2())
a = [None] * (n+1)
for i in range(1, n+1):
ai = int(input2())
a[i] = [tuple(map(int, input2().split())) for i in range(ai)]
def bitsearch(bit, *, start=0):
end = 2 ** bit
len0 = len(format(end, "b"))
return [format(i, "b").zfill(len0) for i in range(start, end)]
cand = [0]
for b in bitsearch(n):
lie, i = 0, 1
while (not lie) and i < n+1:
for c in a[i]:
if not (int(b[i]) ^ c[1] ^ int(b[c[0]])):
lie += 1
i += 1
if not lie:
cand.append(b.count("1"))
print(max(cand))
|
# -*- coding: utf-8 -*-
################ DANGER ################
test = ""
#test = \
"""
3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0
ans 0
"""
"""
3
1
2 1
1
1 1
1
2 0
ans 2
"""
"""
2
1
2 0
1
1 0
ans 1
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
return test.pop()
else:
def input2():
return input()
########################################
n = int(input2())
a = [None] * (n+1)
for i in range(1, n+1):
ai = int(input2())
a[i] = [tuple(map(int, input2().split())) for i in range(ai)]
def bitsearch(bit, *, start=0):
end = 2 ** bit
len0 = len(format(end, "b"))
return [format(i, "b").zfill(len0) for i in range(start, end)]
cand = [0]
for b in bitsearch(n):
lie, i = 0, 1
while (not lie) and i < n+1:
for c in a[i]:
if int(b[i]) and c[1] ^ int(b[c[0]]):
lie += 1
i += 1
if not lie:
cand.append(b.count("1"))
print(max(cand))
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 641,583
| 641,584
|
u272075541
|
python
|
p02837
|
n=int(input())
l=[0 for i in range(n)]
for i in range(n):
ka=int(input())
r,w=[],[]
for k in range(ka):
x,y=map(int,input().split())
r.append(x-1) if y else w.append(x-1)
l[i]=(set(r),set(w))
ans=0
for j in range(2**n):
v=format(j,"b").zfill(n)
R,W=set(),set()
RR={i for i in range(n) if v[i]=="1"}
for h in RR:
r,w=l[h]
R|=r
W|=w
WW=set(range(n))-RR
if len(RR&W) or len(WW&R) or len(R&W) :break
else:ans=max(ans,len(RR))
print(ans)
|
n=int(input())
l=[0 for i in range(n)]
for i in range(n):
ka=int(input())
r,w=[],[]
for k in range(ka):
x,y=map(int,input().split())
r.append(x-1) if y else w.append(x-1)
l[i]=(set(r),set(w))
ans=0
for j in range(2**n):
v=format(j,"b").zfill(n)
R,W=set(),set()
RR={t for t in range(n) if v[t]=="1"}
for h in RR:
r,w=l[h]
R|=r
W|=w
WW=set(range(n))-RR
if len(RR&W) or len(WW&R) or len(R&W) :continue
else:ans=max(ans,len(RR))
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 641,589
| 641,590
|
u896741788
|
python
|
p02837
|
def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts in product([0, 1], repeat=n):
if all([ts[i] == y for i in range(n) for x, y in d[i] if ts[i]==1]):
ans = max(ans, sum(ts))
print(ans)
if __name__ == '__main__':
main()
|
def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts in product([0, 1], repeat=n):
if all([ts[x] == y for i in range(n) for x, y in d[i] if ts[i]==1]):
ans = max(ans, sum(ts))
print(ans)
if __name__ == '__main__':
main()
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,591
| 641,592
|
u185034753
|
python
|
p02837
|
def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x, y))
ans = 0
from itertools import product
for ts in product([0, 1], repeat=n):
if all([ts[i] == y for i in range(n) for x, y in d[i] if ts[i]==1]):
ans = max(ans, sum(ts))
print(ans)
if __name__ == '__main__':
main()
|
def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts in product([0, 1], repeat=n):
if all([ts[x] == y for i in range(n) for x, y in d[i] if ts[i]==1]):
ans = max(ans, sum(ts))
print(ans)
if __name__ == '__main__':
main()
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,593
| 641,592
|
u185034753
|
python
|
p02837
|
n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
g[i][x - 1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
k = 0
if (s >> i & 1) == 1:
k += 1
for j in range(n):
if g[i][j] == -1:
continue
if (s >> j & 1) != g[i][j]:
ok = False
if ok:
ans = max(ans, k)
print(ans)
|
n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
g[i][x - 1] = y
ans = 0
for s in range(2**n):
ok = True
k = 0
for i in range(n):
if (s >> i & 1) == 1:
k += 1
for j in range(n):
if g[i][j] == -1:
continue
if (s >> j & 1) != g[i][j]:
ok = False
if ok:
ans = max(ans, k)
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 641,594
| 641,595
|
u276204978
|
python
|
p02837
|
N = int(input())
A = [[-1 for i in range(N)] for i in range(N)]
for i in range(N):
m = int(input())
for i in range(m):
x,y = map(int,input().split())
A[i][x-1] = y
ans = 0
for i in range(1<<N):
honets = [0 for i in range(N)]
for j in range(N):
if (i>>j) & 1:
honets[j] = 1
ok = True
for j in range(N):
if honets[j] == 1:
for k in range(N):
if A[j][k] == -1: continue
if A[j][k] != honets[k]: ok = False
if ok:
ans = max(ans, honets.count(1))
print(ans)
|
N = int(input())
A = [[-1 for i in range(N)] for i in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
A[i][x-1] = y
#print(A)
ans = 0
for i in range(1<<N):
honets = [0 for i in range(N)]
for j in range(N):
if (i>>j) & 1:
honets[j] = 1
ok = True
for j in range(N):
if honets[j] == 1:
for k in range(N):
if A[j][k] == -1: continue
if A[j][k] != honets[k]: ok = False
if ok:
ans = max(ans, honets.count(1))
print(ans)
|
[
"identifier.change"
] | 641,599
| 641,600
|
u626217906
|
python
|
p02837
|
N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in range(N):
# print("j",j)
if (bit>>j) & 1:
honest_cnt += 1
for t in testimony[j]:
if (bit>>t[0])&1 != t[1]:
# print("break")
break
else:
# print("continue")
continue
# print("break")
break
else:
# print("new_ans")
ans = max(ans,honest_cnt)
print(ans)
|
N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
# print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in range(N):
# print("j",j)
if (bit>>j) & 1:
honest_cnt += 1
for t in testimony[j]:
if (bit>>t[0])&1 != t[1]:
# print("break")
break
else:
# print("continue")
continue
# print("break")
break
else:
# print("new_ans")
ans = max(ans,honest_cnt)
print(ans)
|
[
"call.remove"
] | 641,608
| 641,609
|
u996665352
|
python
|
p02837
|
N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
for bit in range(1<<n):
honest_cnt = 0
for j in range(N):
if (bit>>j) & 1:
honest_cnt += 1
for t in testimony[j]:
if (bit>>t[0])&1 != t[1]:
break
else:
continue
break
ans = max(ans,honest_cnt)
print(ans)
|
N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
# print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in range(N):
# print("j",j)
if (bit>>j) & 1:
honest_cnt += 1
for t in testimony[j]:
if (bit>>t[0])&1 != t[1]:
# print("break")
break
else:
# print("continue")
continue
# print("break")
break
else:
# print("new_ans")
ans = max(ans,honest_cnt)
print(ans)
|
[] | 641,610
| 641,609
|
u996665352
|
python
|
p02837
|
import itertools
n=int(input())
g=[[-1 for _ in range(15)] for _ in range(15)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
g[i][x-1]=y
ans=0
for i in range(2**n):
honests = [0 for _ in range(n)]
for j in range(n):
if(i>>j)&1:
honests[j]=1
print(honests)
ok=True
for j in range(n):
if honests[j]:
for k in range(n):
if g[j][k]==-1: continue
if g[j][k]!=honests[k]: ok=False
if ok:
ans=max(ans,honests.count(1))
print(ans)
|
import itertools
n=int(input())
g=[[-1 for _ in range(15)] for _ in range(15)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
g[i][x-1]=y
ans=0
for i in range(2**n):
honests = [0 for _ in range(n)]
for j in range(n):
if(i>>j)&1:
honests[j]=1
ok=True
for j in range(n):
if honests[j]:
for k in range(n):
if g[j][k]==-1: continue
if g[j][k]!=honests[k]: ok=False
if ok:
ans=max(ans,honests.count(1))
print(ans)
|
[
"call.remove"
] | 641,611
| 641,612
|
u032484849
|
python
|
p02837
|
n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if honesty[j] == 1:
for k in range(len(A[j])):
x,y = A[j][k]
if not honesty[x-1] == y:
true = 0
break
if true == 1:
ans = max(ans,sum(honesty))
print(ans)
print(A)
|
n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if honesty[j] == 1:
for k in range(len(A[j])):
x,y = A[j][k]
if not honesty[x-1] == y:
true = 0
break
if true == 1:
ans = max(ans,sum(honesty))
print(ans)
|
[
"call.remove"
] | 641,613
| 641,614
|
u612223903
|
python
|
p02837
|
n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if honesty[j] == 1:
for k in range(len(A[j])):
x,y = A[j][k]
if honesty[x] != y :
true = 0
break
if true == 1:
ans = max(ans,sum(honesty))
print(ans)
|
n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if honesty[j] == 1:
for k in range(len(A[j])):
x,y = A[j][k]
if not honesty[x-1] == y:
true = 0
break
if true == 1:
ans = max(ans,sum(honesty))
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.compare.change"
] | 641,615
| 641,614
|
u612223903
|
python
|
p02837
|
import sys
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
d = defaultdict(list)
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x - 1, y))
ans = 0
for k in range(2**n):
res = 0
j = bin(k)[2:].zfill(n)
for i in range(n):
if j[i] == "0":
continue
flag = 1
for x, y in d[i]:
if int(j[x]) != int(y):
flag = 0
break
res += 1
if flag:
ans = max(ans, res)
print(ans)
|
import sys
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
d = defaultdict(list)
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x - 1, y))
ans = 0
for k in range(2**n):
res = 0
j = bin(k)[2:].zfill(n)
flag = 1
for i in range(n):
if j[i] == "0":
continue
for x, y in d[i]:
if int(j[x]) != int(y):
flag = 0
break
res += 1
if flag:
ans = max(ans, res)
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 641,619
| 641,620
|
u609061751
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for __ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
hito, which = map(int, input().split())
lst[i][hito-1] = which
ans = 0
muri = 0
for i in range(2**n):
kumi = list(format(i, '0'+str(n)+'b'))
temp = 0
for j in range(n):
if muri == 1:
muri = 0
break
elif kumi[j] == '1':
for k in range(n):
if (lst[k][j] == 0 and kumi[k] == '1') or (lst[j][k] == 1 and kumi[k] == '0'):
muri = 1
break
if muri == 0:
temp += 1
if muri == 0:
ans = max(ans, temp)
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for __ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
hito, which = map(int, input().split())
lst[i][hito-1] = which
ans = 0
muri = 0
for i in range(2**n):
kumi = list(format(i, '0'+str(n)+'b'))
temp = 0
muri = 0
for j in range(n):
if muri == 1:
break
elif kumi[j] == '1':
for k in range(n):
if (lst[k][j] == 0 and kumi[k] == '1') or (lst[j][k] == 1 and kumi[k] == '0'):
muri = 1
break
if muri == 0:
temp += 1
if muri == 0:
ans = max(ans, temp)
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 641,629
| 641,630
|
u287132915
|
python
|
p02837
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[j][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,631
| 641,632
|
u784022244
|
python
|
p02837
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[a][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,633
| 641,632
|
u784022244
|
python
|
p02837
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[a][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if i>>j&1==1:
for k in range(N):
if A[j][k]!=-1 and i>>k&1!=A[j][k]:
ok=False
break
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove"
] | 641,634
| 641,632
|
u784022244
|
python
|
p02837
|
N=int(input())
S=[[-1]*N for _ in range(N)]
for _ in range(N):
A=int(input())
for i in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j]!=-1 and (s>>j&1)!=S[i][j]:
ok=False
if ok:
ans=max(ans, bin(s).count("1"))
print(ans)
|
N=int(input())
S=[[-1]*N for _ in range(N)]
for i in range(N):
A=int(input())
for _ in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j]!=-1 and (s>>j&1)!=S[i][j]:
ok=False
if ok:
ans=max(ans, bin(s).count("1"))
print(ans)
|
[
"identifier.change"
] | 641,635
| 641,636
|
u784022244
|
python
|
p02837
|
N=int(input())
S=[[-1]*N for _ in range(N)]
for _ in range(N):
A=int(input())
for i in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s<<i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j]!=-1 and (s>>j&1)!=S[i][j]:
ok=False
if ok:
ans=max(ans, bin(s).count("1"))
print(ans)
|
N=int(input())
S=[[-1]*N for _ in range(N)]
for i in range(N):
A=int(input())
for _ in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j]!=-1 and (s>>j&1)!=S[i][j]:
ok=False
if ok:
ans=max(ans, bin(s).count("1"))
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,638
| 641,636
|
u784022244
|
python
|
p02837
|
n=int(input())
xy=[[]for _ in range(n)]
for i in range(n):
for j in range(int(input())):
xy[i].append(list(map(int,input().split())))
ans=0
for i in range(1,1<<n):
syojiki=[(i&(1<<j)!=0)+0 for j in range(n)]
flag=True
for j in range(n):
for x,y in xy[j]:
if syojiki[x-1]!=y^syojiki[j]^1:flag=False
if flag:
ans=max(ans,syojiki.count(1))
print(ans)
|
n=int(input())
xy=[[]for _ in range(n)]
for i in range(n):
for j in range(int(input())):
xy[i].append(list(map(int,input().split())))
ans=0
for i in range(1,1<<n):
syojiki=[(i&(1<<j)!=0)+0 for j in range(n)]
flag=True
for j in range(n):
for x,y in xy[j]:
if syojiki[x-1]!=y and syojiki[j]==1:flag=False
if flag:
ans=max(ans,syojiki.count(1))
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 641,639
| 641,640
|
u227082700
|
python
|
p02837
|
#標準入力受け取り
N = int(input())
shougen = []
A_lis = []
for _ in range(N):
A = int(input())
A_lis.append(A)
minishougen = []
for j in range(A):
xy = list(map(int, input().split()))
minishougen.append(xy)
shougen.append(minishougen)
#ビットの配列作る
bit_lis = []
for i in range(2 ** N):
mini_bit_lis = []
for j in range(N):
mini_bit_lis.append(i % 2)
i = i // 2
bit_lis.append(mini_bit_lis)
#ビットの配列について全探索を行う
ans = 0
for i in range(2 ** N):
flag = 0
for l in range(N):
if bit_lis[i][l] == 1:
for k in range(A_lis[j]):
if shougen[j][k][1] != bit_lis[i][shougen[j][k][0] - 1]:
flag = 1
break
if flag == 1:
break
if flag == 0:
tmp = sum(bit_lis[i])
if tmp > ans :
ans = tmp
print(ans)
|
#標準入力受け取り
N = int(input())
shougen = []
A_lis = []
for _ in range(N):
A = int(input())
A_lis.append(A)
minishougen = []
for j in range(A):
xy = list(map(int, input().split()))
minishougen.append(xy)
shougen.append(minishougen)
#ビットの配列作る
bit_lis = []
for i in range(2 ** N):
mini_bit_lis = []
for j in range(N):
mini_bit_lis.append(i % 2)
i = i // 2
bit_lis.append(mini_bit_lis)
#ビットの配列について全探索を行う
ans = 0
for i in range(2 ** N):
flag = 0
for l in range(N):
if bit_lis[i][l] == 1:
for k in range(A_lis[l]):
if shougen[l][k][1] != bit_lis[i][shougen[l][k][0] - 1]:
flag = 1
break
if flag == 1:
break
if flag == 0:
tmp = sum(bit_lis[i])
if tmp > ans :
ans = tmp
print(ans)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 641,645
| 641,646
|
u944643608
|
python
|
p02837
|
N=int(input())
X=[]
Y=[]
for n in range(N):
A=int(input())
lx=[]
ly=[]
for m in range(A):
x,y=map(int,input().strip().split())
lx.append(x)
ly.append(y)
X.append(lx)
Y.append(ly)
def judge(l,X,Y):
honest=True
for n in range(N):
if l[n]==1:
for i in range(len(X[n])):
if l[X[n][i]-1]!=Y[n][i]:
honest=False
return honest
ans=0
def dfs(l,N): #honest=1,unkind=0
if len(l)==N:
global ans
if judge(l,X,Y):
ans=max(ans,sum(l))
return
else:
for n in range(2):
l.append(n)
print(l)
dfs(l,N)
l.pop()
dfs([],N)
print(ans)
|
N=int(input())
X=[]
Y=[]
for n in range(N):
A=int(input())
lx=[]
ly=[]
for m in range(A):
x,y=map(int,input().strip().split())
lx.append(x)
ly.append(y)
X.append(lx)
Y.append(ly)
def judge(l,X,Y):
honest=True
for n in range(N):
if l[n]==1:
for i in range(len(X[n])):
if l[X[n][i]-1]!=Y[n][i]:
honest=False
return honest
ans=0
def dfs(l,N): #honest=1,unkind=0
if len(l)==N:
global ans
if judge(l,X,Y):
ans=max(ans,sum(l))
return
else:
for n in range(2):
l.append(n)
dfs(l,N)
l.pop()
dfs([],N)
print(ans)
|
[
"call.remove"
] | 641,647
| 641,648
|
u613920660
|
python
|
p02837
|
n=int(input())
talk=[]
for _ in range(n):
a=int(input())
sei=set([])
uso=set([])
for __ in range(a):
x,y=map(int,input().split())
if y==1:
sei.add(x-1)
else:
uso.add(x-1)
talk.append((sei,uso))
#print(talk)
result=0
for i in range(2**n):
#print(bin(i))
flag=0
s=str(bin(i))[2:].zfill(n)
#print("#####",s)
kari_sei=set([])
kari_uso=set([])
for j in range(n):
if i>>j &1:
kari_sei.add(j)
else:
kari_uso.add(j)
flag=0
for item in kari_sei:
for item2 in talk[item-1][0]:
if item2 not in kari_sei:
flag=1
break
if flag==1:
break
else:
for item2 in talk[item-1][1]:
if item2 not in kari_uso:
flag=1
break
if flag==0:
result=max(result,s.count("1"))
print(result)
|
n=int(input())
talk=[]
for _ in range(n):
a=int(input())
sei=set([])
uso=set([])
for __ in range(a):
x,y=map(int,input().split())
if y==1:
sei.add(x-1)
else:
uso.add(x-1)
talk.append((sei,uso))
#print(talk)
result=0
for i in range(2**n):
flag=0
s=str(bin(i))[2:].zfill(n)
#print("#####",s)
kari_sei=set([])
kari_uso=set([])
for j in range(n):
if i>>j &1:
kari_sei.add(j)
else:
kari_uso.add(j)
flag=0
for item in kari_sei:
for item2 in talk[item][0]:
if item2 not in kari_sei:
flag=1
break
if flag==1:
break
else:
for item2 in talk[item][1]:
if item2 not in kari_uso:
flag=1
break
if flag==0:
result=max(result,s.count("1"))
print(result)
|
[
"expression.operation.binary.remove"
] | 641,649
| 641,650
|
u588794534
|
python
|
p02837
|
from collections import deque
n = int(input())
lists = deque()
A = deque()
ans = 0
for _ in range(n):
a = int(input())
A.append(a)
tmp = [list(map(int, input().split())) for _ in range(a)]
lists.append(tmp)
for bit in range(1<<n):
flag = True
is_honest = [(bit>>i)&1 for i in range(n)]
print(is_honest)
for i in range(n):#i人目の証言を検証する
if is_honest[i] == 0:#i人目が「不親切」ならその人の証言は無視
continue
for k in range(A[i]):#i人目のk個目の証言を検証する
x,y = lists[i][k]
x -= 1
#番号xとyが一致しているかどうか
if is_honest[x] != y:
flag = False
if flag:
ans = max(ans, sum(is_honest))
print(ans)
|
from collections import deque
n = int(input())
lists = deque()
A = deque()
ans = 0
for _ in range(n):
a = int(input())
A.append(a)
tmp = [list(map(int, input().split())) for _ in range(a)]
lists.append(tmp)
for bit in range(1<<n):
flag = True
is_honest = [(bit>>i)&1 for i in range(n)]
for i in range(n):#i人目の証言を検証する
if is_honest[i] == 0:#i人目が「不親切」ならその人の証言は無視
continue
for k in range(A[i]):#i人目のk個目の証言を検証する
x,y = lists[i][k]
x -= 1
#番号xとyが一致しているかどうか
if is_honest[x] != y:
flag = False
if flag:
ans = max(ans, sum(is_honest))
print(ans)
|
[
"call.remove"
] | 641,651
| 641,652
|
u323045245
|
python
|
p02837
|
n = int(input())
A = []
X = []
for i in range(n):
a = int(input())
A.append(a)
lis = []
for j in range(a):
lis.append(list(map(int, input().split())))
X.append(lis)
ans = 0
for i in range(2 ** n):
H_lis = [0 for i in range(n)]
for j in range(n):
if ((i >> j) & 1):
H_lis[j] = 1
flag = True
j = 0
while j < n and flag:
if H_lis[j] == 1:
for k in range(A[k]):
if X[j][k][1] != H_lis[X[j][k][0] - 1]:
flag = False
break
j += 1
if flag:
ans = max(ans, H_lis.count(1))
print(ans)
|
n = int(input())
A = []
X = []
for i in range(n):
a = int(input())
A.append(a)
lis = []
for j in range(a):
lis.append(list(map(int, input().split())))
X.append(lis)
ans = 0
for i in range(2 ** n):
H_lis = [0 for i in range(n)]
for j in range(n):
if ((i >> j) & 1):
H_lis[j] = 1
flag = True
j = 0
while j < n and flag:
if H_lis[j] == 1:
for k in range(A[j]):
if X[j][k][1] != H_lis[X[j][k][0] - 1]:
flag = False
break
j += 1
if flag:
ans = max(ans, H_lis.count(1))
print(ans)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,659
| 641,660
|
u016302627
|
python
|
p02837
|
n = int(input())
def popcount(x):
return bin(x).count('1')
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[x][y] = y
ans = 0
for i in range(1 << n):
d = [0 for _ in range(n)]
for j in range(n):
if i >> j & 1:
d[j] = 1
ok = True
for j in range(n):
if d[j]:
for k in range(n):
if g[j][k] == -1:
continue
if g[j][k] != d[k]:
ok = False
if ok:
ans = max(ans, popcount(i))
print(ans)
|
n = int(input())
def popcount(x):
return bin(x).count('1')
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[i][x] = y
ans = 0
for i in range(1 << n):
d = [0 for _ in range(n)]
for j in range(n):
if i >> j & 1:
d[j] = 1
ok = True
for j in range(n):
if d[j]:
for k in range(n):
if g[j][k] == -1:
continue
if g[j][k] != d[k]:
ok = False
if ok:
ans = max(ans, popcount(i))
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,688
| 641,689
|
u697101155
|
python
|
p02837
|
def main():
N = int(input())
d = defaultdict(list)
for i in range(N):
n = int(input())
for _ in range(n):
d[i].append(list(map(int, input().split())))
max_trust_num = 0
# check all possible combinations of Honest or Unkind.
for i in range(2**N):
trust = True
# assign Honest or Unnkind to each person.
# if person i is Honest, trust_combs[i] = 1
# else, trust_combs[i] = 0
trust_combs = []
for j in range(N):
if (i >> j) & 1:
trust_combs.append(1)
else:
trust_combs.append(0)
# check if the combination of Honest or
# Unkind contradicts the given statements.
for k in range(len(trust_combs)):
if trust_combs[k] == 1:
for l in d[k]:
if not l[1] == trust_combs[l[0]-1]:
trust = False
if trust:
max_trust_num = max(max_trust_num, sum(trust_combs))
print(max_trust_num)
if __name__ == "__main__":
main()
|
from collections import defaultdict
def main():
N = int(input())
d = defaultdict(list)
for i in range(N):
n = int(input())
for _ in range(n):
d[i].append(list(map(int, input().split())))
max_trust_num = 0
# check all possible combinations of Honest or Unkind.
for i in range(2**N):
trust = True
# assign Honest or Unnkind to each person.
# if person i is Honest, trust_combs[i] = 1
# else, trust_combs[i] = 0
trust_combs = []
for j in range(N):
if (i >> j) & 1:
trust_combs.append(1)
else:
trust_combs.append(0)
# check if the combination of Honest or
# Unkind contradicts the given statements.
for k in range(len(trust_combs)):
if trust_combs[k] == 1:
for l in d[k]:
if not l[1] == trust_combs[l[0]-1]:
trust = False
if trust:
max_trust_num = max(max_trust_num, sum(trust_combs))
print(max_trust_num)
if __name__ == "__main__":
main()
|
[] | 641,696
| 641,697
|
u411353821
|
python
|
p02837
|
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
A = []
for i in range(N):
a = []
for j in range(ri()):
x, y = rl()
a.append((x-1, y))
A.append(a)
def check(A, b):
for i, a in enumerate(A):
for x, y in a:
if b[i] == 1:
if b[x] != y:
return False
return True
import itertools
ans = 0
for b in itertools.product([0,1], repeat=N):
if check(A, b):
print(b)
ans = max(ans, sum(b))
print(ans)
|
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
A = []
for i in range(N):
a = []
for j in range(ri()):
x, y = rl()
a.append((x-1, y))
A.append(a)
def check(A, b):
for i, a in enumerate(A):
for x, y in a:
if b[i] == 1:
if b[x] != y:
return False
return True
import itertools
ans = 0
for b in itertools.product([0,1], repeat=N):
if check(A, b):
ans = max(ans, sum(b))
print(ans)
|
[
"call.remove"
] | 641,698
| 641,699
|
u596505843
|
python
|
p02837
|
n = int(input())
honest = []
unkind = []
for _ in range(n):
a = int(input())
ho = []
un = []
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
ho.append(x-1)
else:
un.append(y-1)
honest.append(ho)
unkind.append(un)
# 全探索
ans = []
for i in range(2 ** n):
person = []
for j in range(n):
person.append(i % 2)
i //= 2
flag = False
# honestを判定
for j in range(n):
if person[j] == 1:
for k in honest[j]:
if person[k] == 0:
flag = True
break
if flag:
break
if flag:
continue
# unkindを判定
for j in range(n):
if person[j] == 1:
for k in unkind[j]:
if person[k] == 1:
flag = True
break
if flag:
break
if flag:
continue
ans.append(sum(person))
print(max(ans))
|
n = int(input())
honest = []
unkind = []
for _ in range(n):
a = int(input())
ho = []
un = []
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
ho.append(x-1)
else:
un.append(x-1)
honest.append(ho)
unkind.append(un)
# 全探索
ans = []
for i in range(2 ** n):
person = []
for j in range(n):
person.append(i % 2)
i //= 2
flag = False
# honestを判定
for j in range(n):
if person[j] == 1:
for k in honest[j]:
if person[k] == 0:
flag = True
break
if flag:
break
if flag:
continue
# unkindを判定
for j in range(n):
if person[j] == 1:
for k in unkind[j]:
if person[k] == 1:
flag = True
break
if flag:
break
if flag:
continue
ans.append(sum(person))
print(max(ans))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 641,700
| 641,701
|
u070201429
|
python
|
p02837
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (j >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(ans)
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (i >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,712
| 641,713
|
u955125992
|
python
|
p02837
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (j >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(res)
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (i >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 641,714
| 641,713
|
u955125992
|
python
|
p02837
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1): #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (j >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num %2
num //= 2
ans = max(ans, res)
print(ans)
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (i >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 641,715
| 641,713
|
u955125992
|
python
|
p02837
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1): #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (j >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num %2
num //= 2
ans = max(ans, res)
print(res)
|
n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれば
for k in range(n):
if l[j][k] == -1: continue
if (i >> k & 1) != l[j][k]: Val = False
if Val:
res = 0
num = i
while num > 0:
res += num % 2
num //= 2
ans = max(ans, res)
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 641,716
| 641,713
|
u955125992
|
python
|
p02837
|
n = int(input())
word = []
for i in range(n):
a = int(input())
l = [list(map(int,input().split())) for _ in range(a)]
word.append(l)
print(word)
ans = 0
for i in range(2**n):
flag = 0
count = 0
for j in range(n):
if ((i>>j)&1)==1 and flag==0:
for k,l in word[j]:
if ((i>>(k-1))&1) != l:
flag = 1 ## tell a lie
break
if flag==0:
count = bin(i).count('1')
ans = max(ans,count)
print(ans)
|
n = int(input())
word = []
for i in range(n):
a = int(input())
l = [list(map(int,input().split())) for _ in range(a)]
word.append(l)
ans = 0
for i in range(2**n):
flag = 0
count = 0
for j in range(n):
if ((i>>j)&1)==1 and flag==0:
for k,l in word[j]:
if ((i>>(k-1))&1) != l:
flag = 1 ## tell a lie
break
if flag==0:
count = bin(i).count('1')
ans = max(ans,count)
print(ans)
|
[
"call.remove"
] | 641,749
| 641,750
|
u472696272
|
python
|
p02821
|
from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def get_count(tot):
'''
tot以上を満たす幸福度の握手の個数を数える
'''
ret = 0
for i in range(N):
cnt = bisect_left(A, tot-A[i])
ret += N - cnt
return ret
# 右からの累積和
Asum = A[:]
for i in range(N-2, -1, -1):
Asum[i] += Asum[i+1]
def get_sum(tot):
'''
左端を固定した時の右端の個数分だけ左端を足し、右端の区間和（累積和）も足す。
'''
ret = 0
for i in range(N):
idx = bisect_left(A, tot-A[i])
cnt = N - idx
ret += A[i]*cnt
# print(idx)
if idx == N:
continue
ret += Asum[idx]
# print(f'ret = {ret}')
return ret
# M回握手できる上限を求める
ok = 0
ng = 10**12
while ok + 1 != ng:
md = (ok + ng)//2
if M <= get_count(md):
ok = md
else:
ng = md
# print(ok)
# print(get_sum(ok+1))
# print(M - get_count(ok+1))
# print(Asum)
ans = get_sum(ok+1) + (M - get_count(ok+1))*ok
|
from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def get_count(tot):
'''
tot以上を満たす幸福度の握手の個数を数える
'''
ret = 0
for i in range(N):
cnt = bisect_left(A, tot-A[i])
ret += N - cnt
return ret
# 右からの累積和
Asum = A[:]
for i in range(N-2, -1, -1):
Asum[i] += Asum[i+1]
def get_sum(tot):
'''
左端を固定した時の右端の個数分だけ左端を足し、右端の区間和（累積和）も足す。
'''
ret = 0
for i in range(N):
idx = bisect_left(A, tot-A[i])
cnt = N - idx
ret += A[i]*cnt
# print(idx)
if idx == N:
continue
ret += Asum[idx]
# print(f'ret = {ret}')
return ret
# M回握手できる上限を求める
ok = 0
ng = 10**12
while ok + 1 != ng:
md = (ok + ng)//2
if M <= get_count(md):
ok = md
else:
ng = md
# print(ok)
# print(get_sum(ok+1))
# print(M - get_count(ok+1))
# print(Asum)
ans = get_sum(ok+1) + (M - get_count(ok+1))*ok
print(ans)
|
[
"call.add"
] | 641,847
| 641,848
|
u503228842
|
python
|
p02821
|
def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = map(int, S().split())
A = LI()
A.sort()
def f(n,x): # A[n]+A[i]>=x となる i の最小値
left = -1
right = N
while left + 1 < right:
mid = (left + right) // 2
if A[n] + A[mid] < x:
left = mid
else:
right = mid
return right
low = 2 * A[0]
high = 2 * A[-1] + 1
while low + 1 < high:
mid = (low + high) // 2
if sum(N - f(i,mid) for i in range(N)) >= M:
low = mid
else:
high = mid
a = low # a以上のA[i]+A[j]がM個以上となる最大のa
from itertools import accumulate
B = [0] + list(accumulate(A))
r = 0
ans = 0
for i in range(N): # a+1以上のA[i]+A[j]を足し合わせていく
b = f(i,a+1)
r += N - b
ans += B[N] - B[b]
ans += A[i] * (N - b)
ans += (M - r) * a # A[i]+A[j] == a となるものを足し合わせる
print(ans,a)
if __name__ == '__main__':
resolve()
|
def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = map(int, S().split())
A = LI()
A.sort()
def f(n,x): # A[n]+A[i]>=x となる i の最小値
left = -1
right = N
while left + 1 < right:
mid = (left + right) // 2
if A[n] + A[mid] < x:
left = mid
else:
right = mid
return right
low = 2 * A[0]
high = 2 * A[-1] + 1
while low + 1 < high:
mid = (low + high) // 2
if sum(N - f(i,mid) for i in range(N)) >= M:
low = mid
else:
high = mid
a = low # a以上のA[i]+A[j]がM個以上となる最大のa
from itertools import accumulate
B = [0] + list(accumulate(A))
r = 0
ans = 0
for i in range(N): # a+1以上のA[i]+A[j]を足し合わせていく
b = f(i,a+1)
r += N - b
ans += B[N] - B[b]
ans += A[i] * (N - b)
ans += (M - r) * a # A[i]+A[j] == a となるものを足し合わせる
print(ans)
if __name__ == '__main__':
resolve()
|
[
"call.arguments.change"
] | 641,871
| 641,872
|
u119148115
|
python
|
p02821
|
import bisect
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a_cum = [0 for _ in range(n+1)]
for i in range(n):
a_cum[i+1] = a_cum[i] + a[i]
l, r = 0, 10 ** 6
while r - l > 1:
x = (l + r) // 2
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, x-a[i])
cnt += n - idx
if cnt >= m:
l = x
else:
r = x
ans = 0
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, l-a[i])
cnt += n - idx
ans += a_cum[n] - a_cum[idx]
ans += a[i] * (n - idx)
if cnt > m:
ans -= a[i] * (cnt - m)
print(ans)
|
import bisect
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a_cum = [0 for _ in range(n+1)]
for i in range(n):
a_cum[i+1] = a_cum[i] + a[i]
l, r = 0, 10 ** 6
while r - l > 1:
x = (l + r) // 2
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, x-a[i])
cnt += n - idx
if cnt >= m:
l = x
else:
r = x
ans = 0
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, l-a[i])
cnt += n - idx
ans += a_cum[n] - a_cum[idx]
ans += a[i] * (n - idx)
if cnt > m:
ans -= l * (cnt - m)
print(ans)
|
[
"expression.operation.binary.change"
] | 641,908
| 641,909
|
u139112865
|
python
|
p02821
|
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
import bisect
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
def Binary_Search(A, N, M):
#初期化
left = 0
right = 10 ** 7
ans = 0
#累積和
Asum = [0]
for i in range(N):
Asum.append(Asum[i] + A[-1 - i])
leftj = [INF, INF]
rightj = [0, 0]
#二分探索
while left <= right:
mid = (left + right) // 2
var = 0
happiness = 0
for i in range(N):
ind = bisect.bisect_left(A, mid - A[i])
ind = N - ind
var += ind
happiness += ind * A[i] + Asum[ind]
# print(var, happiness)
if var == M:
return happiness
elif var > M:
leftj = min(leftj, [var, mid])
left = mid + 1
else:
ans = max(ans, happiness)
rightj = max(rightj, [var, mid])
right = mid - 1
ans = ans + (M - rightj[0]) * leftj[1]
return ans
#処理内容
def main():
N, M = getlist()
A = getlist()
A.sort()
ans = Binary_Search(A, N, M)
print(ans)
if __name__ == '__main__':
main()
|
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
import bisect
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
def Binary_Search(A, N, M):
#初期化
left = 0
right = 10 ** 7
ans = 0
#累積和
Asum = [0]
for i in range(N):
Asum.append(Asum[i] + A[-1 - i])
leftj = [INF, INF]
rightj = [0, 0]
#二分探索
while left <= right:
mid = (left + right) // 2
var = 0
happiness = 0
for i in range(N):
ind = bisect.bisect_left(A, mid - A[i])
ind = N - ind
var += ind
happiness += ind * A[i] + Asum[ind]
# print(var, happiness)
if var == M:
return happiness
elif var > M:
leftj = min(leftj, [var, -mid])
left = mid + 1
else:
ans = max(ans, happiness)
rightj = max(rightj, [var, -mid])
right = mid - 1
# print(ans)
# print(leftj)
# print(rightj)
ans = ans + (M - rightj[0]) * (-leftj[1])
return ans
#処理内容
def main():
N, M = getlist()
A = getlist()
A.sort()
ans = Binary_Search(A, N, M)
print(ans)
if __name__ == '__main__':
main()
|
[
"expression.operation.unary.add",
"call.arguments.change"
] | 641,934
| 641,935
|
u627417051
|
python
|
p02821
|
import numpy as np
N,M,*A = map(int, open('0').read().split())
A = np.sort(A)
B = np.cumsum(np.concatenate([[0],A[::-1]]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = np.sum(N-np.searchsorted(A,s-A))
if cnt>=M:
l = s
else:
r = s
ind = np.searchsorted(A,r-A)
M -= np.sum(N-ind)
ans = np.sum(B[N-ind]+A*(N-ind))+M*l
print(ans)
|
import numpy as np
N,M,*A = map(int, open(0).read().split())
A = np.sort(A)
B = np.cumsum(np.concatenate([[0],A[::-1]]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = np.sum(N-np.searchsorted(A,s-A))
if cnt>=M:
l = s
else:
r = s
ind = np.searchsorted(A,r-A)
M -= np.sum(N-ind)
ans = np.sum(B[N-ind]+A*(N-ind))+M*l
print(ans)
|
[
"call.arguments.change"
] | 641,988
| 641,989
|
u476604182
|
python
|
p02821
|
from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open('0').read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i = bisect_left(A,r-c)
M -= N-i
if i<N:
ans += B[N-1-i]+c*(N-i)
ans += M*l
print(ans)
|
from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open(0).read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i = bisect_left(A,r-c)
M -= N-i
if i<N:
ans += B[N-1-i]+c*(N-i)
ans += M*l
print(ans)
|
[
"call.arguments.change",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 641,990
| 641,991
|
u476604182
|
python
|
p02821
|
from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open('0').read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i = bisect_left(A,r-c)
M -= N-i
if i<N:
ans += B[N-1-i]+c*(N-i)
ans += M*l
print(ans)
|
from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open(0).read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i = bisect_left(A,r-c)
M -= N-i
if i<N:
ans += B[N-1-i]+c*(N-i)
ans += M*l
print(ans)
|
[
"call.arguments.change"
] | 641,990
| 641,992
|
u476604182
|
python
|
p02821
|
N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
else:
r = n
C = [0]
for i in range(N):
C += [C[-1]+B[i]]
ans = 0
j = 0
m = 0
flag = False
for i in range(N):
while j<N:
if A[i]+B[j]>l:
print(i,j)
ans += C[-1]-C[j]+A[i]*(N-j)
m += N-j
break
j += 1
ans += (M-m)*l
print(ans)
|
N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
else:
r = n
C = [0]
for i in range(N):
C += [C[-1]+B[i]]
ans = 0
j = 0
m = 0
flag = False
for i in range(N):
while j<N:
if A[i]+B[j]>l:
ans += C[-1]-C[j]+A[i]*(N-j)
m += N-j
break
j += 1
ans += (M-m)*l
print(ans)
|
[
"call.remove"
] | 641,993
| 641,994
|
u476604182
|
python
|
p02821
|
N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
else:
r = n
C = [0]
for i in range(N):
C += [C[-1]+B[i]]
ans = 0
j = 0
m = 0
flag = False
for i in range(N):
while j<N:
if A[i]+B[j]>l:
ans += C[-1]-C[j]+A[i]*(N-j)
m += N-j
j += 1
ans += (M-m)*l
print(ans)
|
N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
else:
r = n
C = [0]
for i in range(N):
C += [C[-1]+B[i]]
ans = 0
j = 0
m = 0
flag = False
for i in range(N):
while j<N:
if A[i]+B[j]>l:
ans += C[-1]-C[j]+A[i]*(N-j)
m += N-j
break
j += 1
ans += (M-m)*l
print(ans)
|
[
"control_flow.break.add"
] | 641,995
| 641,994
|
u476604182
|
python
|
p02837
|
n = int(input())
a = [[-1for _ in range(n)]for _ in range(n)]
ans = 0
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
a[i][x-1] = y
for i in range(2**n):
#bit全探索
#d:正直者と仮定してる人
d = []
p = len(bin(i))
q = bin(i)
for j in range(p-2):
q = bin(i>>j)
if int(q[len(q)-1]) == 1:
d.append(j)
print(d)
res = True
for j in d:
for k in range(n):
#jさんがkさんの事を正直者だと思ってた時
if a[j][k] == 1:
if k not in d:
res = False
#jさんがkさんのことを不親切な人と思ってた時
elif a[j][k] == 0:
if k in d:
res = False
if res:
ans = max(ans,len(d))
print(ans)
|
n = int(input())
a = [[-1for _ in range(n)]for _ in range(n)]
ans = 0
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
a[i][x-1] = y
for i in range(2**n):
#bit全探索
#d:正直者と仮定してる人
d = []
p = len(bin(i))
q = bin(i)
for j in range(p-2):
q = bin(i>>j)
if int(q[len(q)-1]) == 1:
d.append(j)
#print(d)
res = True
for j in d:
for k in range(n):
#jさんがkさんの事を正直者だと思ってた時
if a[j][k] == 1:
if k not in d:
res = False
#jさんがkさんのことを不親切な人と思ってた時
elif a[j][k] == 0:
if k in d:
res = False
if res:
ans = max(ans,len(d))
print(ans)
|
[
"call.remove"
] | 642,100
| 642,101
|
u061071198
|
python
|
p02837
|
from itertools import product
N = int(input())
c = product(range(2), repeat=N)
d = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
d[i].append((x, y))
ans = 0
for l in c:
o = [None]*N
is_conflict = False
for i, j in enumerate(l):
if j==0:continue
for x, y in d[i]:
if (o[x-1]!=None and o[x-1]!=y) or l[x-1]!=y:
is_conflict = True
break
o[x-1] = y
if is_conflict == True:
break
else:
ans = mas(ans, sum(l))
print(ans)
|
from itertools import product
N = int(input())
c = product(range(2), repeat=N)
d = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
d[i].append((x, y))
ans = 0
for l in c:
o = [None]*N
is_conflict = False
for i, j in enumerate(l):
if j==0:continue
for x, y in d[i]:
if (o[x-1]!=None and o[x-1]!=y) or l[x-1]!=y:
is_conflict = True
break
o[x-1] = y
if is_conflict == True:
break
else:
ans = max(ans, sum(l))
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 642,102
| 642,103
|
u690536347
|
python
|
p02837
|
n = int(input())
List = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
num_evidence = int(input())
for j in range(num_evidence):
darega, doushita = map(int,input().split())
List[i][darega - 1] = doushita * 2 - 1
# print(List)
def is_inconsistent(all_evidence, honest_or_unkind):
for i in range(n):
if honest_or_unkind[i] == 1:
for j in range(n):
if honest_or_unkind[j] * all_evidence[i][j] == -1:
return True
return False
max_honest = 0
for i in range(n**2 - 1):
temp = format(i, '0'+str(n)+'b')
honest_or_unkind = [int(temp[i]) * 2 - 1 for i in range(n)]
# print(honest_or_unkind)
# print(is_inconsistent(List, honest_or_unkind))
if not is_inconsistent(List, honest_or_unkind):
max_honest = max(max_honest, honest_or_unkind.count(1))
print(max_honest)
|
n = int(input())
List = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
num_evidence = int(input())
for j in range(num_evidence):
darega, doushita = map(int,input().split())
List[i][darega - 1] = doushita * 2 - 1
def is_inconsistent(all_evidence, honest_or_unkind):
for i in range(n):
if honest_or_unkind[i] == 1:
for j in range(n):
if honest_or_unkind[j] * all_evidence[i][j] == -1:
return True
return False
max_honest = 0
for i in range(2**n):
temp = format(i, '0'+str(n)+'b')
honest_or_unkind = [int(temp[i]) * 2 - 1 for i in range(n)]
if not is_inconsistent(List, honest_or_unkind):
max_honest = max(max_honest, honest_or_unkind.count(1))
print(max_honest)
|
[
"expression.operation.binary.remove"
] | 642,119
| 642,120
|
u930177016
|
python
|
p02837
|
N = int(input())
D = [[-1]*N for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
D[i][x-1] = y
ans = 0
for i in range(2*N+1):
T = []
n = i
for j in range(N):
T.append(n%2)
n//=2
res = 1
for j in range(N):
if T[j]==1:
for k in range(N):
if D[j][k]!=-1 and D[j][k]!=T[k]:res=0
if res:ans = max(ans,T.count(1))
print(ans)
|
N = int(input())
D = [[-1]*N for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
D[i][x-1] = y
ans = 0
for i in range(2**N):
T = []
n = i
for j in range(N):
T.append(n%2)
n//=2
res = 1
for j in range(N):
if T[j]==1:
for k in range(N):
if D[j][k]!=-1 and D[j][k]!=T[k]:res=0
if res:ans = max(ans,T.count(1))
print(ans)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 642,144
| 642,143
|
u350997995
|
python
|
p02837
|
from collections import deque
N = int(input())
Tlist = deque([])
for i in range(N):
list = []
n = int(input())
if n != 0:
for i in range(n): #因数注意！
o = input()
m = o.split()
p = [int(j) for j in m] #1列の数列をリスト化
list.append(p)
Tlist.append(list)
max = 0
for i in range(2**N):
p = format(i,'0'+str(N)+'b')
print(p)
ALL = True
for j, value in enumerate(p):
if value == '0':
pass
else:
if len(Tlist[j]) == 0:
pass
else:
for k in Tlist[j]:
if p[k[0]-1] == str(k[1]):
pass
else:
ALL = False
if ALL:
pass
else:
break
else:
new = p.count('1')
if new > max:
max = new
print(max)
|
from collections import deque
N = int(input())
Tlist = deque([])
for i in range(N):
list = []
n = int(input())
if n != 0:
for i in range(n): #因数注意！
o = input()
m = o.split()
p = [int(j) for j in m] #1列の数列をリスト化
list.append(p)
Tlist.append(list)
max = 0
for i in range(2**N):
p = format(i,'0'+str(N)+'b')
ALL = True
for j, value in enumerate(p):
if value == '0':
pass
else:
if len(Tlist[j]) == 0:
pass
else:
for k in Tlist[j]:
if p[k[0]-1] == str(k[1]):
pass
else:
ALL = False
if ALL:
pass
else:
break
else:
new = p.count('1')
if new > max:
max = new
print(max)
|
[
"call.remove"
] | 642,157
| 642,158
|
u982944976
|
python
|
p02837
|
N = int(input())
ary = [[-1] * N for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
ary[i][x - 1] = y
print(ary)
ret = 0
for a in range(2 ** N):
flg = True
for i in range(N):
if (a >> i & 1) == 1:
for j in range(N):
if ary[i][j] == -1:
continue
if (a >> j & 1) != ary[i][j]:
flg = False
break
if flg:
n = sum([a >> i & 1 for i in range(N)])
ret = max(ret, n)
print(ret)
|
N = int(input())
ary = [[-1] * N for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
ary[i][x - 1] = y
ret = 0
for a in range(2 ** N):
flg = True
for i in range(N):
if (a >> i & 1) == 1:
for j in range(N):
if ary[i][j] == -1:
continue
if (a >> j & 1) != ary[i][j]:
flg = False
break
if flg:
n = sum([a >> i & 1 for i in range(N)])
ret = max(ret, n)
print(ret)
|
[
"call.remove"
] | 642,163
| 642,164
|
u987170100
|
python
|
p02837
|
from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]
for n in range(N):
A = int(input())
for a in range(A):
lis = list(map(int, input().split()))
evidence[n].append(lis)
for n in range(1 << N):
bits = [(n >> i) & 1 for i in range(N)]
boolean = True
for i in range(N):
if (n >> i) & 1 == 0:
continue
for x, y in evidence[i]:
if bits[x-1] == y:
continue
flag = False
if flag:
ans = max(ans, sum(bits))
print(ans)
|
from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]
for n in range(N):
A = int(input())
for a in range(A):
lis = list(map(int, input().split()))
evidence[n].append(lis)
for n in range(1 << N):
bits = [(n >> i) & 1 for i in range(N)]
flag = True
boolean = True
for i in range(N):
if (n >> i) & 1 == 0:
continue
for x, y in evidence[i]:
if bits[x-1] == y:
continue
flag = False
if flag:
ans = max(ans, sum(bits))
print(ans)
|
[
"assignment.add"
] | 642,178
| 642,179
|
u196697332
|
python
|
p02837
|
n = int(input())
xys = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
xys[i].append((x-1, y))
ans = 0
for i in range(1<<n):
ok = True
for j in range(n):
# if jth person may be honest, verify testimony of him.
if (i>>j) & 1 == 1:
for xy in xys[j]:
x, y = xy
if (i>>x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
ans = max(ans, bin(x).count('1'))
print(ans)
|
n = int(input())
xys = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
xys[i].append((x-1, y))
ans = 0
for i in range(1<<n):
ok = True
for j in range(n):
# if jth person may be honest, verify testimony of him.
if (i>>j) & 1 == 1:
for xy in xys[j]:
x, y = xy
if (i>>x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
ans = max(ans, bin(i).count('1'))
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 642,180
| 642,181
|
u382423941
|
python
|
p02837
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(input())
mtx = []
for i in range(n):
a = int(input())
l = []
for j in range(a):
x,y = map(int, input().split())
l.append([x, y])
mtx.append(l)
def counter(sample):
if sample == 0:
return 0
else:
return (sample >> 1) + (sample & 1) #末尾が１なら１をたす
count = 0
for sample in range(2**n):
judge = True
for i in range(n):
if not sample & (1 << i):
continue
else:
for j in mtx[i]:
if ((sample >> (j[0] - 1)) & 1) ^ j[1]:
judge = False
break
if not judge:
break
if judge:
count = max(count, counter(sample))
print(count)
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(input())
mtx = []
for i in range(n):
a = int(input())
l = []
for j in range(a):
x,y = map(int, input().split())
l.append([x, y])
mtx.append(l)
def counter(sample):
if sample == 0:
return 0
else:
return counter(sample >> 1) + (sample & 1) #末尾が１なら１をたす
count = 0
for sample in range(2**n):
judge = True
for i in range(n):
if not sample & (1 << i):
continue
else:
for j in mtx[i]:
if ((sample >> (j[0] - 1)) & 1) ^ j[1]:
judge = False
break
if not judge:
break
if judge:
count = max(count, counter(sample))
print(count)
|
[
"call.add",
"function.return_value.change"
] | 642,209
| 642,210
|
u130492706
|
python
|
p02837
|
N = int(input())
g = [[-1]*N for i in range(N)] #何も証言していないのを-1。i番目の人がj番目の人を正直ものといっているか、不親切といっているか、なにもいってないか。
for i in range(N):
A = int(input())
for i in range(A):
a,x = map(int, input().split())
a -= 1
g[i][a] = x
ans = 0
for i in range(1 << N):
d=[0]*N
for j in range(N):
if (i>>j & 1):
d[j] = 1
ok = True
for j in range(N):
if d[j]: #正直者だと割り当てをした人を見る
for k in range(N):
if g[j][k] == -1: continue
if g[j][k] != d[k]: ok = False #jの人の証言が、実際の割り当てとあっているかどうかを判断
if ok:
ans = max(ans, bin(i).count("1"))
print(ans)
|
N = int(input())
g = [[-1]*N for i in range(N)] #何も証言していないのを-1。i番目の人がj番目の人を正直ものといっているか、不親切といっているか、なにもいってないか。
for i in range(N):
A = int(input())
for j in range(A):
a,x = map(int, input().split())
a -= 1
g[i][a] = x
ans = 0
for i in range(1 << N):
d=[0]*N
for j in range(N):
if (i>>j & 1):
d[j] = 1
ok = True
for j in range(N):
if d[j]: #正直者だと割り当てをした人を見る
for k in range(N):
if g[j][k] == -1: continue
if g[j][k] != d[k]: ok = False #jの人の証言が、実際の割り当てとあっているかどうかを判断
if ok:
ans = max(ans, bin(i).count("1"))
print(ans)
|
[
"identifier.change"
] | 642,220
| 642,221
|
u836939578
|
python
|
p02837
|
N = int(input())
data = []
for _ in range(N):
A = int(input())
items = []
for __ in range(A):
x, y = map(int, input().split())
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in range(2**N >> 1):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best)
|
N = int(input())
data = []
for _ in range(N):
A = int(input())
items = []
for __ in range(A):
x, y = map(int, input().split())
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in range(2**N):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best)
|
[
"expression.operation.binary.remove"
] | 642,243
| 642,244
|
u684305751
|
python
|
p02837
|
import sys
def main():
N = int(input())
statement = [[] for i in range(N)]
for i in range(N):
message = int(input())
for j in range(message):
num, tmp = map(int, input().split())
if tmp == 1:
TF = True
else:
TF = False
statement[i].append((num, TF))
ans = 0
for i in range(1 << (N-1)):
status = [False] * 15
tmp_ans = 0
for j, c in enumerate(format(i, '015b')[::-1]):
if c == '1':
status[j] = True
tmp_ans += 1
if tmp_ans <= ans:
continue
flag = True
for j, person in enumerate(statement):
if not status[j]:
continue
for state in person:
if status[state[0]-1] != state[1]:
flag = False
break
if not flag:
break
if flag:
ans = max(ans, tmp_ans)
print(ans)
if __name__ == '__main__':
main()
|
import sys
def main():
N = int(input())
statement = [[] for i in range(N)]
for i in range(N):
message = int(input())
for j in range(message):
num, tmp = map(int, input().split())
if tmp == 1:
TF = True
else:
TF = False
statement[i].append((num, TF))
ans = 0
for i in range(1 << N):
status = [False] * 15
tmp_ans = 0
for j, c in enumerate(format(i, '015b')[::-1]):
if c == '1':
status[j] = True
tmp_ans += 1
if tmp_ans <= ans:
continue
flag = True
for j, person in enumerate(statement):
if not status[j]:
continue
for state in person:
if status[state[0]-1] != state[1]:
flag = False
break
if not flag:
break
if flag:
ans = max(ans, tmp_ans)
print(ans)
if __name__ == '__main__':
main()
|
[
"call.arguments.change"
] | 642,251
| 642,252
|
u237362582
|
python
|
p02837
|
# -*- coding: utf-8 -*-
from itertools import combinations
n = int(input())
al = []
for _ in range(n):
a = int(input())
xy = [list(map(int, input().split())) for _ in range(a)]
al.append(xy)
res = 0
for i in range(1,n+1):
for c in combinations(range(n), i):
flag = True
for X in c:
for x,y in al[X-1]:
if y==1:
if x not in c:
flag = False
else:
if x in c:
flag = False
if flag:
res = i
break
print(res)
|
# -*- coding: utf-8 -*-
from itertools import combinations
n = int(input())
al = []
for _ in range(n):
a = int(input())
xy = [list(map(int, input().split())) for _ in range(a)]
al.append(xy)
res = 0
for i in range(1,n+1):
for c in combinations(range(n), i):
flag = True
for X in c:
for x,y in al[X]:
if y==1:
if x-1 not in c:
flag = False
else:
if x-1 in c:
flag = False
if flag:
res = i
break
print(res)
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,253
| 642,254
|
u620868411
|
python
|
p02837
|
N = int(input())
A = [] #どこからどこまでがiさんの証言かN×2の配列
tes = []#証言を入れていく
pro_sta = []#過程の状態
tes_count = 0
suc_flag = 1 #矛盾が生じてなければ1
max_honest = 0
# 入力受け取り
for i in range(N):
a = int(input())
A.append([tes_count,tes_count + a])
tes_count += a
for k in range(a):
x,y = list(map(int,input().split()))
tes.append([x,y])
t = (2 ** N -1)
for p in range(t):
pro_sta = []
suc_flag = 1
t_str = str(format(p,"0"+str(N)+"b"))
for q in range(N):
pro_sta.append(t_str[q])
for q in range(N):
if pro_sta[q] == "1":
for r in range(A[q][0],A[q][1]):
if tes[r][1] != int(pro_sta[tes[r][0] - 1]):
suc_flag = 0
if suc_flag == 1:
honest_count = pro_sta.count("1")
max_honest = max(max_honest,honest_count)
print(max_honest)
|
N = int(input())
A = [] #どこからどこまでがiさんの証言かN×2の配列
tes = []#証言を入れていく
pro_sta = []#過程の状態
tes_count = 0
suc_flag = 1 #矛盾が生じてなければ1
max_honest = 0
# 入力受け取り
for i in range(N):
a = int(input())
A.append([tes_count,tes_count + a])
tes_count += a
for k in range(a):
x,y = list(map(int,input().split()))
tes.append([x,y])
t = (2 ** N)
for p in range(t):
pro_sta = []
suc_flag = 1
t_str = str(format(p,"0"+str(N)+"b"))
for q in range(N):
pro_sta.append(t_str[q])
for q in range(N):
if pro_sta[q] == "1":
for r in range(A[q][0],A[q][1]):
if tes[r][1] != int(pro_sta[tes[r][0] - 1]):
suc_flag = 0
if suc_flag == 1:
honest_count = pro_sta.count("1")
max_honest = max(max_honest,honest_count)
print(max_honest)
|
[
"expression.operation.binary.remove"
] | 642,264
| 642,265
|
u190909444
|
python
|
p02837
|
n=int(input())
X=[]
Y=[]
A=[0]*n
for i in range(n):
A[i]=int(input())
a=A[i]
x=[0]*a
y=[0]*a
for j in range(a):
x[j],y[j]=[int(s) for s in input().split()]
X.append(x)
Y.append(y)
s=0
for i in range(2**n):
c=0
d=0
B=[0]*n
for j in range(n):
if((i >> j) & 1):
c=c+1
B[j]=1
for k in range(n):
if B[k]==1:
for j in range(A[k]):
if Y[k][j]!=B[X[k][j]-1]:
d=-1
break
if d<0:
break
if s<c:
s=c
print(s)
|
n=int(input())
X=[]
Y=[]
A=[0]*n
for i in range(n):
A[i]=int(input())
a=A[i]
x=[0]*a
y=[0]*a
for j in range(a):
x[j],y[j]=[int(s) for s in input().split()]
X.append(x)
Y.append(y)
s=0
for i in range(2**n):
c=0
d=0
B=[0]*n
for j in range(n):
if((i >> j) & 1):
c=c+1
B[j]=1
for k in range(n):
if B[k]==1:
for j in range(A[k]):
if Y[k][j]!=B[X[k][j]-1]:
d=-1
break
if d<0:
break
if s<c and d==0:
s=c
print(s)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,278
| 642,279
|
u151305655
|
python
|
p02837
|
n=int(input())
a=[[] for i in range(n)]
for i in range(n):
c=int(input())
for j in range(c):
x,y = map(int, input().split())
a[i].append([x,y])
from itertools import permutations, combinations,combinations_with_replacement,product
ans3 = 0
for ans in product([0,1],repeat=n):
flag = True
for i, check in enumerate(a):
if ans[i]==0:
continue
for x, y in check:
if y^ans[i] != ans[x-1]:
flag = False
break
if flag:
ans3=max(sum(ans), ans3)
print(ans3)
|
n=int(input())
a=[[] for i in range(n)]
for i in range(n):
c=int(input())
for j in range(c):
x,y = map(int, input().split())
a[i].append([x,y])
from itertools import permutations, combinations,combinations_with_replacement,product
ans3 = 0
for ans in product([0,1],repeat=n):
flag = True
for i, check in enumerate(a):
if ans[i]==0:
continue
for x, y in check:
if y != ans[x-1]:
flag = False
break
if flag:
ans3=max(sum(ans), ans3)
print(ans3)
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 642,282
| 642,283
|
u064408584
|
python
|
p02837
|
n = int(input())
a = []
xy = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
x,y = map(int,input().split())
xy[i].append([x-1,y])
print(xy)
ans = 0
for i in range(1<<(n)):
memo = []
cnt = 0
for j in range(n):
if ((i>>j)&1):
memo.append(1)
cnt += 1
else:
memo.append(0)
cntn = True
for j in range(n):
if memo[j] == 0:
continue
for k in range(a[j]):
prs = xy[j][k][0]
if memo[prs] != xy[j][k][1]:
cntn = False
if not(cntn):
continue
ans = max(ans,cnt)
print(ans)
|
n = int(input())
a = []
xy = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
x,y = map(int,input().split())
xy[i].append([x-1,y])
ans = 0
for i in range(1<<(n)):
memo = []
cnt = 0
for j in range(n):
if ((i>>j)&1):
memo.append(1)
cnt += 1
else:
memo.append(0)
cntn = True
for j in range(n):
if memo[j] == 0:
continue
for k in range(a[j]):
prs = xy[j][k][0]
if memo[prs] != xy[j][k][1]:
cntn = False
if not(cntn):
continue
ans = max(ans,cnt)
print(ans)
|
[
"call.remove"
] | 642,296
| 642,297
|
u626468554
|
python
|
p02837
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
L = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
L[i][x-1] = y
ans = 0
for i in range(2**(N)):
if len(str(bin(i))[2:]) < N:
K = ["0"] * (N-len(str(bin(i))[2:])) + list(str(bin(i))[2:])
else:
K = list(str(bin(i))[2:])
for j in range(N):
flag = 1
if K[j] == "0":
continue
for l in range(N):
if L[j][l] == -1:
continue
elif L[j][l] == 0:
if K[l] == "1":
flag = 0
break
elif L[j][l] == 1:
if K[l] == "0":
flag = 0
break
if flag == 0:
break
if j == N-1:
ans = max(ans, K.count("1"))
print(ans)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
L = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
L[i][x-1] = y
ans = 0
for i in range(2**(N)):
if len(str(bin(i))[2:]) < N:
K = ["0"] * (N-len(str(bin(i))[2:])) + list(str(bin(i))[2:])
else:
K = list(str(bin(i))[2:])
for j in range(N):
flag = 1
if K[j] == "0":
pass
else:
for l in range(N):
if L[j][l] == -1:
continue
elif L[j][l] == 0:
if K[l] == "1":
flag = 0
break
elif L[j][l] == 1:
if K[l] == "0":
flag = 0
break
if flag == 0:
break
if j == N-1:
ans = max(ans, K.count("1"))
print(ans)
|
[
"control_flow.continue.remove",
"control_flow.pass.add"
] | 642,333
| 642,334
|
u741397536
|
python
|
p02837
|
N = int(input())
L = []
candidates = [list(bin(i)[2:].zfill(N)) for i in range(2**N - 1)]
for i in range(N):
A = int(input())
said = [list(map(int,input().split())) for i in range(A)]
L.append(said)
ans = 0
for pattern in candidates:
tmp = 0
flag = 1
for j in range(N): #pattern内全て
if pattern[j] == "1":
for said in L[j]:
if pattern[said[0] - 1] != str(said[1]):
flag = 0
else:
pass
if flag == 1:
ans = max(ans, pattern.count("1"))
print(ans)
|
N = int(input())
L = []
candidates = [list(bin(i)[2:].zfill(N)) for i in range(2**N)]
for i in range(N):
A = int(input())
said = [list(map(int,input().split())) for i in range(A)]
L.append(said)
ans = 0
for pattern in candidates:
tmp = 0
flag = 1
for j in range(N): #pattern内全て
if pattern[j] == "1":
for said in L[j]:
if pattern[said[0] - 1] != str(said[1]):
flag = 0
else:
pass
if flag == 1:
ans = max(ans, pattern.count("1"))
print(ans)
|
[
"expression.operation.binary.remove"
] | 642,340
| 642,341
|
u729627789
|
python
|
p02837
|
import copy
N = int(input())
X = []
for i in range(N):
A = int(input())
X.append([])
for _ in range(A):
X[i].append(list(map(int, input().split())))
print(X)
def rec(condition, i):
if i==N:
return condition.count(1)
_X = X[i]
_condition = copy.copy(condition)
through_condition = copy.copy(condition)
through_condition[i] = 0
if condition[i]==0:
return rec(copy.copy(through_condition), i+1)
for x in _X:
if _condition[ x[0]-1 ] == -1:
_condition[ x[0]-1 ] = x[1]
elif _condition[ x[0]-1 ] != x[1]:
return 0 if _condition[i]==1 else rec(copy.copy(through_condition), i+1)
_condition[i] = 1
return max(rec(copy.copy(through_condition), i+1), rec(copy.copy(_condition), i+1))
print( rec([-1 for _ in range(N)], 0) )
|
import copy
N = int(input())
X = []
for i in range(N):
A = int(input())
X.append([])
for _ in range(A):
X[i].append(list(map(int, input().split())))
def rec(condition, i):
if i==N:
return condition.count(1)
_X = X[i]
_condition = copy.copy(condition)
through_condition = copy.copy(condition)
through_condition[i] = 0
if condition[i]==0:
return rec(copy.copy(through_condition), i+1)
for x in _X:
if _condition[ x[0]-1 ] == -1:
_condition[ x[0]-1 ] = x[1]
elif _condition[ x[0]-1 ] != x[1]:
return 0 if _condition[i]==1 else rec(copy.copy(through_condition), i+1)
_condition[i] = 1
return max(rec(copy.copy(through_condition), i+1), rec(copy.copy(_condition), i+1))
print( rec([-1 for _ in range(N)], 0) )
|
[
"call.remove"
] | 642,344
| 642,345
|
u077075933
|
python
|
p02837
|
def main():
# input
n = int(input())
li = []
for i in range(n):
a = int(input())
dic = {}
for j in range(a):
x, y = map(int, input().split())
dic[x] = y
li.append(dic)
print(li)
# calc
ans = 0
flag = False
for num in range(1, 2**n):
num = bin(num)[2:].rjust(n, '0')
for i in range(len(li)):
if num[i] == '1':
for j, key in enumerate(li[i]):
if num[key-1] != str(li[i][key]):
flag = True
break
if flag:
flag = False
break
else:
# print(num, ans)
ans = max(num.count('1'), ans)
print(ans)
if __name__ == '__main__':
main()
|
def main():
# input
n = int(input())
li = []
for i in range(n):
a = int(input())
dic = {}
for j in range(a):
x, y = map(int, input().split())
dic[x] = y
li.append(dic)
# print(li)
# calc
ans = 0
flag = False
for num in range(1, 2**n):
num = bin(num)[2:].rjust(n, '0')
for i in range(len(li)):
if num[i] == '1':
for j, key in enumerate(li[i]):
if num[key-1] != str(li[i][key]):
flag = True
break
if flag:
flag = False
break
else:
# print(num, ans)
ans = max(num.count('1'), ans)
print(ans)
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 642,359
| 642,360
|
u086716588
|
python
|
p02837
|
N = int(input())
A = [0] * N
data = [[] for _ in range(N)]
for i in range(N):
A[i] = int(input())
for j in range(A[i]):
new = list(map(int,input().split()))
new[0] -= 1
data[i].append(new)
m = -1
for n in range(2**N):
nn = n
cur = [0] * N
for i in range(N):
cur[i] = nn % 2
nn = nn // 2
s = sum(cur)
if s < m:
break
det = 1
for i in range(N):
if cur[i] == 0:
continue
for j in range(A[i]):
if data[i][j][1] != cur[data[i][j][0]]:
det = 0
break
if det == 0:
break
if det == 1:
m = s
#print(cur,s,det)
print(m)
|
N = int(input())
A = [0] * N
data = [[] for _ in range(N)]
for i in range(N):
A[i] = int(input())
for j in range(A[i]):
new = list(map(int,input().split()))
new[0] -= 1
data[i].append(new)
m = -1
for n in range(2**N):
nn = n
cur = [0] * N
for i in range(N):
cur[i] = nn % 2
nn = nn // 2
s = sum(cur)
if s <= m:
continue
det = 1
for i in range(N):
if cur[i] == 0:
continue
for j in range(A[i]):
if data[i][j][1] != cur[data[i][j][0]]:
det = 0
break
if det == 0:
break
if det == 1:
m = s
#print(cur,s,det)
#print(data)
print(m)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 642,363
| 642,364
|
u512007680
|
python
|
p02837
|
import copy
N = int(input())
A = []
xy=[]
for i in range(N):
A.append(int(input()))
xy.append([])
for j in range(A[-1]):
xy[-1].append([int(x) for x in input().split()])
#print(xy)
tr = [[]]
for i in range(N):
tr[0].append(-1)
#print(tr)
for i in range(len(xy)):
for j in xy[i]:
this_tr = []
for k in tr:
if j[1] == 1:
if k[j[0]-1] != 0 and k[i] != 0:
#print("A")
this_k = copy.deepcopy(k)
this_k[j[0]-1] = 1
this_k[i] = 1
this_tr.append(this_k)
else:
if k[j[0]-1] != 1 and k[i] != 0:
#print("B")
this_k = copy.deepcopy(k)
this_k[j[0]-1] = 0
this_k[i] = 1
this_tr.append(this_k)
if k[i] != 1:
#print("C")
this_k = copy.deepcopy(k)
this_k[i] = 0
this_tr.append(this_k)
tr = copy.deepcopy(this_tr)
#print(tr)
#print(tr)
max_c = 0
for i in tr:
count = 0
for j in i:
if j == 1:
count += 1
max_c = max(max_c ,count)
print(max_c)
|
import copy
N = int(input())
A = []
xy=[]
for i in range(N):
A.append(int(input()))
xy.append([])
for j in range(A[-1]):
xy[-1].append([int(x) for x in input().split()])
#print(xy)
tr = [[]]
for i in range(N):
tr[0].append(-1)
#print(tr)
for i in range(len(xy)):
for j in xy[i]:
this_tr = []
for k in tr:
if j[1] == 1:
if k[j[0]-1] != 0 and k[i] != 0:
#print("A")
this_k = copy.deepcopy(k)
this_k[j[0]-1] = 1
this_k[i] = 1
this_tr.append(this_k)
else:
if k[j[0]-1] != 1 and k[i] != 0:
#print("B")
this_k = copy.deepcopy(k)
this_k[j[0]-1] = 0
this_k[i] = 1
this_tr.append(this_k)
if k[i] != 1:
#print("C")
this_k = copy.deepcopy(k)
this_k[i] = 0
this_tr.append(this_k)
tr = copy.deepcopy(this_tr)
#print(tr)
#print(tr)
max_c = 0
for i in tr:
count = 0
for j in i:
if j == 1 or j == -1:
count += 1
max_c = max(max_c ,count)
print(max_c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,371
| 642,372
|
u917363866
|
python
|
p02837
|
def check_valid(flag):
for i, m in mentions.items():
if not (flag & (1 << i)):
continue
for j, honest in m.items():
if honest and flag & (1 << j):
continue
if not honest and not (flag & (1 << j)):
continue
return False
return True
n = int(input())
mentions = {}
for i in range(1, n + 1):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if i not in mentions:
mentions[i] = {x: y}
else:
mentions[i][x] = y
res = 0
for i in range(1 << n):
if check_valid(i):
temp = 0
for j in range(1, n + 1):
if i & (1 << j):
temp += 1
res = max(res, temp)
print(res)
|
def check_valid(flag):
for i, m in mentions.items():
if not (flag & (1 << i)):
continue
for j, honest in m.items():
if honest and flag & (1 << j):
continue
if not honest and not (flag & (1 << j)):
continue
return False
return True
n = int(input())
mentions = {}
for i in range(1, n + 1):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if i not in mentions:
mentions[i] = {x: y}
else:
mentions[i][x] = y
res = 0
for i in range(1, 1 << n + 1):
if check_valid(i):
temp = 0
for j in range(1, n + 1):
if i & (1 << j):
temp += 1
res = max(res, temp)
print(res)
|
[
"call.arguments.add"
] | 642,373
| 642,374
|
u170839742
|
python
|
p02837
|
import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
# S = input().rstrip()
mS = [[] for _ in [0,]*(N+1)]
for i in range(N):
Ai = int(input())
for j in range(Ai):
x, y = map(int, input().split())
mS[i+1].append((x,y))
# T1, T2 = map(int,input().split())
# A1, A2 = map(int,input().split())
# B1, B2 = map(int,input().split())
# vA = list(map(int, input().split()))
res = 0
# print(mS)
M = 1<<N
for m in range(M):
vS = []
vH = [-1]*(N+1)
cnt = 0
d = 0
while m:
if m&1:
vS.extend(mS[cnt+1])
vH[cnt+1] = 1
cnt += 1
d += 1
m >>= 1
ok_in_xy = True
while vS:
x,y = vS.pop()
if vH[x] == -1:
vH[x] = y
if y:
vS.extend(mS[x])
elif vH[x] != y:
ok_in_xy = False
break
if ok_in_xy:
res = max(res, cnt)
print(res)
main()
|
import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
# S = input().rstrip()
mS = [[] for _ in [0,]*(N+1)]
for i in range(N):
Ai = int(input())
for j in range(Ai):
x, y = map(int, input().split())
mS[i+1].append((x,y))
# T1, T2 = map(int,input().split())
# A1, A2 = map(int,input().split())
# B1, B2 = map(int,input().split())
# vA = list(map(int, input().split()))
res = 0
# print(mS)
M = 1<<N
for m in range(M):
vS = []
vH = [-1]*(N+1)
cnt = 0
d = 0
while m:
if m&1:
vS.extend(mS[d+1])
vH[d+1] = 1
cnt += 1
d += 1
m >>= 1
ok_in_xy = True
while vS:
x,y = vS.pop()
if vH[x] == -1:
vH[x] = y
if y:
vS.extend(mS[x])
elif vH[x] != y:
ok_in_xy = False
break
if ok_in_xy:
res = max(res, cnt)
print(res)
main()
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 642,377
| 642,378
|
u557168336
|
python
|
p02837
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
n = onem()
on = []
Ma = 0
for i in range(n):
kkk = []
p = onem()
for j in range(p):
kkk.append(l())
on.append(kkk)
for i in range(2**n-1):
ppp = '{:015b}'.format(i)
ppp = list(ppp[15-n:])
ppp.reverse()
su = 0
for r in range(n):
if ppp[r] == "1":
su += 1
f = False
for j in range(n):
if ppp[j] == "1":
for k in range(len(on[j])):
a,b = on[j][k]
a -= 1
if b ^ int(ppp[a]):
f = True
break
if not f:
Ma = max(Ma,su)
print(Ma)
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
n = onem()
on = []
Ma = 0
for i in range(n):
kkk = []
p = onem()
for j in range(p):
kkk.append(l())
on.append(kkk)
for i in range(2**n):
ppp = '{:015b}'.format(i)
ppp = list(ppp[15-n:])
ppp.reverse()
su = 0
for r in range(n):
if ppp[r] == "1":
su += 1
f = False
for j in range(n):
if ppp[j] == "1":
for k in range(len(on[j])):
a,b = on[j][k]
a -= 1
if b ^ int(ppp[a]):
f = True
break
if not f:
Ma = max(Ma,su)
print(Ma)
|
[
"expression.operation.binary.remove"
] | 642,391
| 642,392
|
u807772568
|
python
|
p02837
|
n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
for _ in range(int(input())):
x,y = map(int,input().split())
q[i][x-1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
if (s>>i&1) == 1:
for j in range(n):
if g[i][j] == -1:continue
if (s>>j&1) != g[i][j]:ok = False
if ok:
t = str(bin(x)).count("1")
ans = max(ans,t)
print(ans)
|
n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
for _ in range(int(input())):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
if (s>>i&1) == 1:
for j in range(n):
if g[i][j] == -1:continue
if (s>>j&1) != g[i][j]:ok = False
if ok:
t = str(bin(s)).count("1")
ans = max(ans,t)
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 642,422
| 642,423
|
u580093517
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.