(cache)Submission #63830137 - 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 #63830137

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 find_solution(N):
    max_d = int(math.isqrt(N)) + 1
    for d in range(1, max_d):
        if N % d != 0:
            continue
        k = N // d
        a = 3
        b = 3 * d
        c = d * d - k
        discriminant = b * b - 4 * a * c
        if discriminant < 0:
            continue
        sqrt_disc = math.isqrt(discriminant)
        if sqrt_disc * sqrt_disc != discriminant:
            continue
        for sign in [1, -1]:
            y = (-b + sign * sqrt_disc) // (2 * a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import math


def find_solution(N):
    max_d = int(math.isqrt(N)) + 1
    for d in range(1, max_d):
        if N % d != 0:
            continue
        k = N // d
        a = 3
        b = 3 * d
        c = d * d - k
        discriminant = b * b - 4 * a * c

        if discriminant < 0:
            continue
        sqrt_disc = math.isqrt(discriminant)
        if sqrt_disc * sqrt_disc != discriminant:
            continue
        for sign in [1, -1]:
            y = (-b + sign * sqrt_disc) // (2 * a)
            if y > 0:
                x = y + d
                if x > 0:
                    print(x, y)
                    return
    print(-1)


n = int(input())
find_solution(n)

Submission Info

Submission Time	2025-03-15 22:16:35
Task	D - Cubes
User	practicejoi
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	718 Byte
Status	TLE
Exec Time	2211 ms
Memory	80824 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	76228 KiB
00_sample_01.txt	AC	54 ms	76632 KiB
00_sample_02.txt	AC	57 ms	80508 KiB
01_test_00.txt	AC	1538 ms	80696 KiB
01_test_01.txt	TLE	2211 ms	80156 KiB
01_test_02.txt	AC	59 ms	80736 KiB
01_test_03.txt	AC	60 ms	80552 KiB
01_test_04.txt	AC	58 ms	80756 KiB
01_test_05.txt	AC	56 ms	80580 KiB
01_test_06.txt	AC	57 ms	80372 KiB
01_test_07.txt	AC	57 ms	80824 KiB
01_test_08.txt	AC	59 ms	80564 KiB
01_test_09.txt	TLE	2012 ms	80236 KiB
01_test_10.txt	TLE	2211 ms	80292 KiB
01_test_11.txt	AC	57 ms	80508 KiB
01_test_12.txt	AC	58 ms	80372 KiB
01_test_13.txt	AC	58 ms	80604 KiB
01_test_14.txt	AC	57 ms	80400 KiB
01_test_15.txt	AC	55 ms	76560 KiB
01_test_16.txt	AC	55 ms	76376 KiB
01_test_17.txt	AC	55 ms	76356 KiB
01_test_18.txt	AC	55 ms	76620 KiB
01_test_19.txt	AC	55 ms	76640 KiB
01_test_20.txt	AC	54 ms	76424 KiB
01_test_21.txt	TLE	2211 ms	80244 KiB
01_test_22.txt	TLE	2211 ms	80480 KiB
01_test_23.txt	TLE	2211 ms	80480 KiB
01_test_24.txt	AC	55 ms	76376 KiB
01_test_25.txt	AC	55 ms	76664 KiB
01_test_26.txt	AC	55 ms	76320 KiB
01_test_27.txt	AC	54 ms	76624 KiB
01_test_28.txt	AC	55 ms	76452 KiB
01_test_29.txt	AC	55 ms	76344 KiB
01_test_30.txt	AC	56 ms	80400 KiB
01_test_31.txt	AC	57 ms	80504 KiB