(cache)Submission #63844329 - OMRON Corporation Programming Contest 2025 (AtCoder Beginner Contest 397)

Contest Duration: 2025-03-15(Sat) 21:00 - 2025-03-15(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #63844329

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import math
def is_square(n):
    if n < 0:
        return False
    sqrt_n = math.isqrt(n)
    return sqrt_n * sqrt_n == n
def find_solution(N):
    max_d = math.isqrt(N) + 1
    for d in range(1, max_d):
        if N % d != 0:
            continue  
        k = N // d
        discriminant = -3 * d * d + 12 * k
        if discriminant < 0:
            continue 
        if not is_square(discriminant):
            continue 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import math


def is_square(n):
    if n < 0:
        return False
    sqrt_n = math.isqrt(n)
    return sqrt_n * sqrt_n == n


def find_solution(N):
    max_d = math.isqrt(N) + 1
    for d in range(1, max_d):
        if N % d != 0:
            continue  
        k = N // d
        discriminant = -3 * d * d + 12 * k
        if discriminant < 0:
            continue 
        if not is_square(discriminant):
            continue 
        sqrt_disc = math.isqrt(discriminant)
        for sign in [1, -1]:
            numerator = -3 * d + sign * sqrt_disc
            if numerator <= 0:
                continue 
            if numerator % 6 != 0:
                continue  
            y = numerator // 6
            x = y + d
            if x > 0:
                return (x, y)
    return None


N = int(input())
solution = find_solution(N)
if solution:
    print(solution[0], solution[1])
else:
    print(-1)

Submission Info

Submission Time	2025-03-15 22:38:24
Task	D - Cubes
User	practicejoi
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	950 Byte
Status	TLE
Exec Time	2211 ms
Memory	80732 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 425

Status

× 3

AC	× 29
TLE	× 6

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	54 ms	76668 KiB
00_sample_01.txt	AC	54 ms	76604 KiB
00_sample_02.txt	AC	56 ms	80580 KiB
01_test_00.txt	AC	1535 ms	80732 KiB
01_test_01.txt	TLE	2211 ms	80500 KiB
01_test_02.txt	AC	58 ms	80708 KiB
01_test_03.txt	AC	58 ms	80720 KiB
01_test_04.txt	AC	57 ms	80432 KiB
01_test_05.txt	AC	55 ms	80636 KiB
01_test_06.txt	AC	57 ms	80492 KiB
01_test_07.txt	AC	55 ms	80416 KiB
01_test_08.txt	AC	58 ms	80504 KiB
01_test_09.txt	TLE	2009 ms	80404 KiB
01_test_10.txt	TLE	2211 ms	80352 KiB
01_test_11.txt	AC	56 ms	80520 KiB
01_test_12.txt	AC	58 ms	80664 KiB
01_test_13.txt	AC	57 ms	80484 KiB
01_test_14.txt	AC	57 ms	80408 KiB
01_test_15.txt	AC	54 ms	76484 KiB
01_test_16.txt	AC	54 ms	76436 KiB
01_test_17.txt	AC	54 ms	76488 KiB
01_test_18.txt	AC	54 ms	76672 KiB
01_test_19.txt	AC	54 ms	76832 KiB
01_test_20.txt	AC	54 ms	76516 KiB
01_test_21.txt	TLE	2211 ms	80540 KiB
01_test_22.txt	TLE	2211 ms	80456 KiB
01_test_23.txt	TLE	2211 ms	80352 KiB
01_test_24.txt	AC	54 ms	76764 KiB
01_test_25.txt	AC	53 ms	76512 KiB
01_test_26.txt	AC	54 ms	76716 KiB
01_test_27.txt	AC	55 ms	76476 KiB
01_test_28.txt	AC	54 ms	76876 KiB
01_test_29.txt	AC	55 ms	76484 KiB
01_test_30.txt	AC	57 ms	80464 KiB
01_test_31.txt	AC	57 ms	80632 KiB