oj.uz

Submission #251595

# Submission time Handle Problem Language Result Execution time Memory
251595 2020-07-21T21:59:03 Z Bruteforceman Popcount (COCI19_popcount) Python 3
0 / 110
 34 ms 3436 KB 
import math
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
def value(a) :
    ans = 0
    for i in range(len(a)):
        if a[i] == 1:
            ans += 1 << i
    return str(ans)
a = [(i, i) for i in range(n)]
sz = 1
result = []
while len(a) > 0: 
    s = [0] * n
    t = [0] * n
    b = []
    for i in range(1, len(a), 2):
        for j in range(a[i - 1][0], a[i - 1][1] + 1):
            s[j] = 1
        for j in range(a[i][0], a[i][1] + 1):
            t[j] = 1
        b.append((a[i - 1][0], a[i][1]))
    exp = '((A&' + value(s) + ')+((A&' + value(t) + ')>>' + str(sz) + '))'
    if len(a) % 2 == 1:
        s = [0] * n
        t = [0] * n
        for j in range(a[-1][0], a[-1][1] + 1):
            s[j] = 1
        for j in range(a[-1][1] + 1, n):
            t[j] = 1
        extra = '((A&' + value(s) + ')+((A&' + value(t) + ')>>' + str(sz) + '))'
        exp = '(' + exp + '|' + extra + ')'
    result.append('A=' + exp)
    a = b[:]
    sz *= 2
if len(result) > k:
    result = result[:k]        
print(len(result))
print('\n'.join(result))

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3428 KB Accepted.
2 Correct 20 ms 3436 KB Accepted.
3 Correct 22 ms 3436 KB Accepted.
4 Incorrect 20 ms 3436 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 3428 KB Wrong answer.

Subtask #3
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3428 KB Accepted.
2 Incorrect 22 ms 3436 KB Wrong answer.
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 3436 KB Wrong answer.
2 Halted 0 ms 0 KB -