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

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
#include <iostream>
#include <cmath>
using namespace std;
void find_solution(long N) {
    for (long d = 1; d * d <= N; ++d) {
        if (N % d == 0) {
            long k = N / d;
            long a = 3;
            long b = 3 * d;
            long c = d * d - k;
            long discriminant = b * b - 4 * a * c;
            if (discriminant >= 0) {
                long sqrt_disc = (long)sqrt(discriminant);
                if (sqrt_disc * sqrt_disc == discriminant) {
                    long y1 = (-b + sqrt_disc) / (2 * a);
                    long y2 = (-b - sqrt_disc) / (2 * a);
                    for (long y : {y1, y2}) {
                        if (y > 0) {
                            long x = y + d;
                            if (x > 0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <cmath>
using namespace std;

void find_solution(long N) {
    for (long d = 1; d * d <= N; ++d) {
        if (N % d == 0) {
            long k = N / d;
            long a = 3;
            long b = 3 * d;
            long c = d * d - k;
            long discriminant = b * b - 4 * a * c;
            if (discriminant >= 0) {
                long sqrt_disc = (long)sqrt(discriminant);
                if (sqrt_disc * sqrt_disc == discriminant) {
                    long y1 = (-b + sqrt_disc) / (2 * a);
                    long y2 = (-b - sqrt_disc) / (2 * a);
                    for (long y : {y1, y2}) {
                        if (y > 0) {
                            long x = y + d;
                            if (x > 0) {
                                cout << x << " " << y << endl;
                                return;
                            }
                        }
                    }
                }
            }
        }
    }
    cout << -1 << endl;
}

int main() {
    long N;
    cin >> N;
    find_solution(N);
    return 0;
}

Submission Info

Submission Time	2025-03-15 21:38:08
Task	D - Cubes
User	practicejoi
Language	C++ 20 (gcc 12.2)
Score	0
Code Size	1130 Byte
Status	TLE
Exec Time	2211 ms
Memory	3680 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 425

Status

× 3

AC	× 28
TLE	× 7

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	1 ms	3556 KiB
00_sample_01.txt	AC	1 ms	3524 KiB
00_sample_02.txt	AC	2 ms	3520 KiB
01_test_00.txt	AC	1480 ms	3416 KiB
01_test_01.txt	TLE	2207 ms	3316 KiB
01_test_02.txt	AC	4 ms	3480 KiB
01_test_03.txt	AC	4 ms	3552 KiB
01_test_04.txt	AC	3 ms	3524 KiB
01_test_05.txt	AC	1 ms	3612 KiB
01_test_06.txt	AC	2 ms	3460 KiB
01_test_07.txt	AC	1 ms	3476 KiB
01_test_08.txt	AC	4 ms	3532 KiB
01_test_09.txt	AC	1953 ms	3456 KiB
01_test_10.txt	TLE	2211 ms	3356 KiB
01_test_11.txt	AC	2 ms	3608 KiB
01_test_12.txt	AC	3 ms	3528 KiB
01_test_13.txt	AC	2 ms	3540 KiB
01_test_14.txt	AC	2 ms	3604 KiB
01_test_15.txt	TLE	2207 ms	3328 KiB
01_test_16.txt	AC	1 ms	3460 KiB
01_test_17.txt	AC	1 ms	3420 KiB
01_test_18.txt	AC	1 ms	3540 KiB
01_test_19.txt	AC	1 ms	3540 KiB
01_test_20.txt	TLE	2207 ms	3228 KiB
01_test_21.txt	TLE	2210 ms	3336 KiB
01_test_22.txt	TLE	2207 ms	3236 KiB
01_test_23.txt	TLE	2207 ms	3116 KiB
01_test_24.txt	AC	1 ms	3608 KiB
01_test_25.txt	AC	1 ms	3460 KiB
01_test_26.txt	AC	1 ms	3460 KiB
01_test_27.txt	AC	1 ms	3428 KiB
01_test_28.txt	AC	1 ms	3456 KiB
01_test_29.txt	AC	1 ms	3548 KiB
01_test_30.txt	AC	1 ms	3504 KiB
01_test_31.txt	AC	2 ms	3680 KiB