/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 13ms 3.02 MiB
#2 Time Exceeded ≥1099ms ≥3.234 MiB
#3 Time Exceeded ≥1089ms ≥3.395 MiB

Code

def getGroupSum(p):
    return p*(p+3)//2

def groupBinSearch(k, l=None, r=None):
    if l is None:
        l = 1
    if r is None:
        r = k
    
    if r - l <= 1:
        return l
    mid = (r + l) // 2
    midSum = getGroupSum(mid)
    if midSum == k:
        return mid
    if midSum > k:
        return groupBinSearch(k, l, mid)
    return groupBinSearch(k, mid, k)

def kthChar(k):
    group = groupBinSearch(k)
    groupSum = getGroupSum(group)
    return 'b' if groupSum == k else 'a'

t = int(input())
for _ in range(t):
    k = int(input())
    print(kthChar(k))

Information

Submit By
Type
Submission
Problem
P1223 C. Infinity Sequence
Contest
Happy New Year 2026
Language
Python 3 (Python 3.12.3)
Submit At
2026-01-06 15:43:59
Judged At
2026-01-06 15:43:59
Judged By
Score
0
Total Time
≥1099ms
Peak Memory
≥3.395 MiB