QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#608720#1900. Octopus Gamergnerdplayer#WA 0ms3864kbC++201.0kb2024-10-04 01:37:332024-10-04 01:37:34

Judging History

你现在查看的是最新测评结果

  • [2024-10-04 01:37:34]
  • 评测
  • 测评结果：WA
  • 用时：0ms
  • 内存：3864kb
查看
  • [2024-10-04 01:37:33]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        i64 x, y;
        cin >> x >> y;

        vector<pair<int, i64>> ans;

        while (x != 0 && y != 0) {
            if (abs(x) > abs(y)) {
                i64 k = x / y;
                int s = k > 0 ? 1 : -1;
                if (abs(x - k * y) > abs(x - (k + s) * y)) {
                    k += s;
                }
                ans.emplace_back(1, -k);
                x -= k * y;
            } else {
                i64 k = y / x;
                int s = k > 0 ? 1 : -1;
                if (abs(y - k * x) > abs(y - (k + s) * y)) {
                    k++;
                }
                ans.emplace_back(2, -k);
                y -= k * x;
            }
        }

        cout << ans.size() << '\n';
        for (auto [a, b] : ans) {
            cout << a << ' ' << b << '\n';
        }
    };
    
    solve();
    
    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3520kb

input:

-3 9

output:

1
2 3

result:

ok heap reached 0 count in less than 50 steps

Test #2:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

-27 57

output:

2
2 2
1 9

result:

ok heap reached 0 count in less than 50 steps

Test #3:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

56 15

output:

4
1 -4
2 3
1 1
2 3

result:

ok heap reached 0 count in less than 50 steps

Test #4:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

6 -2

output:

1
1 3

result:

ok heap reached 0 count in less than 50 steps

Test #5:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

-84 57

output:

3
1 1
2 2
1 9

result:

ok heap reached 0 count in less than 50 steps

Test #6:

score: 0
Accepted
time: 0ms
memory: 3832kb

input:

-648 -315

output:

3
1 -2
2 -17
1 -2

result:

ok heap reached 0 count in less than 50 steps

Test #7:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

4418 -527

output:

8
1 8
2 2
1 2
2 -2
1 -1
2 -3
1 -1
2 -8

result:

ok heap reached 0 count in less than 50 steps

Test #8:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

55796 83094

output:

9
2 -1
1 -2
2 -22
1 -1
2 -2
1 -1
2 -36
1 -1
2 -3

result:

ok heap reached 0 count in less than 50 steps

Test #9:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

581706 382159

output:

11
1 -2
2 2
1 11
2 -4
1 -2
2 2
1 1
2 3
1 7
2 -4
1 -7

result:

ok heap reached 0 count in less than 50 steps

Test #10:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

-1570717 -5452307

output:

14
2 -3
1 -2
2 -8
1 -5
2 -2
1 -1
2 -9
1 -2
2 -2
1 -2
2 2
1 4
2 -2
1 -3

result:

ok heap reached 0 count in less than 50 steps

Test #11:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

35296299 62120456

output:

12
2 -1
1 -1
2 -3
1 -6
2 -54
1 -2
2 2
1 10
2 5
1 3
2 -10
1 -5

result:

ok heap reached 0 count in less than 50 steps

Test #12:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

133453354 276321715

output:

15
2 -2
1 -14
2 -5
1 -1
2 -2
1 -1
2 -2
1 -3
2 -2
1 -2
2 2
1 19
2 -5
1 -7
2 -7

result:

ok heap reached 0 count in less than 50 steps

Test #13:

score: 0
Accepted
time: 0ms
memory: 3520kb

input:

4087302427 739712346

output:

18
1 -6
2 2
1 9
2 3
1 2
2 2
1 2
2 -5
1 -1
2 -5
1 -3
2 2
1 15
2 -22
1 -1
2 -2
1 -1
2 -3

result:

ok heap reached 0 count in less than 50 steps

Test #14:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

30857859855 -36651946276

output:

16
2 1
1 5
2 3
1 14
2 3
1 8
2 33
1 7
2 2
1 1
2 3
1 1
2 13
1 2
2 -3
1 -21

result:

ok heap reached 0 count in less than 50 steps

Test #15:

score: 0
Accepted
time: 0ms
memory: 3520kb

input:

290684430189 -337396975722

output:

19
2 1
1 6
2 4
1 2
2 19
1 1
2 2
1 2
2 -2
1 -6
2 2
1 2
2 -11
1 -3
2 -3
1 -3
2 -2
1 -2
2 5

result:

ok heap reached 0 count in less than 50 steps

Test #16:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

4018564636210 2812471427308

output:

21
1 -1
2 -2
1 -3
2 -76
1 -2
2 -2
1 -2
2 50
1 2
2 -2
1 -1
2 -2
1 -1
2 -7
1 -1
2 -3
1 -4
2 4
1 1
2 116
1 3

result:

ok heap reached 0 count in less than 50 steps

Test #17:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

46017810015419 -48982225298334

output:

24
2 1
1 16
2 -2
1 -10
2 -5
1 -2
2 -7
1 -2
2 -3
1 -2
2 -3
1 -7
2 -2
1 -1
2 -7
1 -4
2 4
1 8
2 -2
1 -5
2 3
1 1
2 15
1 2

result:

ok heap reached 0 count in less than 50 steps

Test #18:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

-791828028554116 -417054265497197

output:

24
1 -2
2 9
1 1
2 6
1 3
2 -6
1 -4
2 -3
1 -1
2 -9
1 -1
2 -105
1 -1
2 -26
1 -1
2 -7
1 -5
2 43
1 3
2 4
1 1
2 3
1 2
2 2

result:

ok heap reached 0 count in less than 50 steps

Test #19:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

9958409834380717 -5355316404922545

output:

30
1 2
2 -7
1 -8
2 -2
1 -2
2 2
1 2
2 13
1 1
2 10
1 2
2 -16
1 -1
2 -9
1 -1
2 -9
1 -1
2 -3
1 -4
2 3
1 1
2 3
1 2
2 -13
1 -1
2 -31
1 -1
2 -4
1 -2
2 3

result:

ok heap reached 0 count in less than 50 steps

Test #20:

score: 0
Accepted
time: 0ms
memory: 3520kb

input:

73118300939404300 -89660288210986608

output:

28
2 1
1 4
2 2
1 3
2 -2
1 -1
2 -2
1 -2
2 -18
1 -8
2 2
1 2
2 -5
1 -23
2 3
1 1
2 47
1 7
2 -61
1 -1
2 -4
1 -1
2 -2
1 -5
2 -2
1 -1
2 -3
1 -5

result:

ok heap reached 0 count in less than 50 steps

Test #21:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

-698819961200024568 438960282374739748

output:

32
1 2
2 -2
1 -2
2 -4
1 -2
2 3
1 5
2 2
1 5
2 -2
1 -3
2 -3
1 -2
2 -11
1 -3
2 4
1 2
2 4
1 2
2 24
1 5
2 -3
1 -2
2 -6
1 -1
2 -3
1 -1
2 -4
1 -1
2 -11
1 -6
2 8

result:

ok heap reached 0 count in less than 50 steps

Test #22:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

1 3

output:

1
2 -3

result:

ok heap reached 0 count in less than 50 steps

Test #23:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

-89 144

output:

7
2 1
1 2
2 -2
1 -2
2 2
1 2
2 -3

result:

ok heap reached 0 count in less than 50 steps

Test #24:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

10946 -17711

output:

14
2 1
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2

result:

ok heap reached 0 count in less than 50 steps

Test #25:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

2178309 1346269

output:

20
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -3

result:

ok heap reached 0 count in less than 50 steps

Test #26:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

-1346269 679891637638612258

output:

11
2 505019158606
1 1
2 16
1 1
2 16
1 1
2 16
1 1
2 16
1 1
2 12

result:

ok heap reached 0 count in less than 50 steps

Test #27:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

365435296162 225851433717

output:

37
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2

result:

ok heap reached 0 count in less than 50 steps

Test #28:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

225851433717 -679891637638612258

output:

4
2 3010349
1 3010349
2 -9378
1 -8

result:

ok heap reached 0 count in less than 50 steps

Test #29:

score: -100
Wrong Answer
time: 0ms
memory: 3580kb

input:

23416728348467685 14472334024676221

output:

52
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -2
1 -2
2 2
1 2
2 -3

result:

wrong answer used more than 50 steps
English 繁體中文 简体中文

Server Time: 2024-12-02 10:33:45 | OpenSource Project