QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#98594#2923. Code GuessingBnKhalidAC ✓2ms3488kbC++201.6kb2023-04-19 08:08:392023-04-19 08:08:40

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-19 08:08:40]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3488kb
  • [2023-04-19 08:08:39]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define el << "\n"
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define mod(num, md) (num % md + md) % md
#define all(arr) (arr).begin(), (arr).end()
#define rall(arr) (arr).rbegin(), (arr).rend()
#define debug(var) cout << (#var) << " = " << var el
#define cn(arr) for (auto& ele : arr) cin >> ele
#define co(arr) for (auto ele : arr) cout << ele << ' '; cout el
#define x_X(n) ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), cout << fixed << setprecision(n)
constexpr ll N = (ll)1e6, md = (ll)1e9 + 7, oo = (ll)1e18,
dx[] = { -1, -1, -1,  0, 0,  1, 1, 1 },
dy[] = { -1,  0,  1, -1, 1, -1, 0, 1 };

void run() {
    int a, b; cin >> a >> b;
    string s; cin >> s;
    if (b < a) swap(a, b);
    if (b - a == 3 && s[0] == 'A' && s[3] == 'A')
        cout << a + 1 << ' ' << a + 2;
    else if (b - a == 6 && s[1] == 'A' && s[2] == 'A')
        cout << 1 << ' ' << 9;
    else if (a == 3 && s[2] == 'A' && s[3] == 'A')
        cout << 1 << ' ' << 2;
    else if (b == 7 && s[0] == 'A' && s[1] == 'A')
        cout << 8 << ' ' << 9;
    else if (b - a == 2 && a == 2 && s[1] == 'A' && s[3] == 'A')
        cout << 1 << ' ' << 3;
    else if (b - a == 2 && a == 6 && s[0] == 'A' && s[2] == 'A')
        cout << 7 << ' ' << 9;
    else
        cout << -1;
}

int main() {
    x_X(10);
#ifndef ONLINE_JUDGE
    freopen("txt/input.in", "rt", stdin);
    // freopen("txt/output.out", "w", stdout);
#endif
    int t = 1;
    // cin >> t;
    while (t--) run();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3372kb

input:

3 4
BBAA

output:

1 2

result:

ok single line: '1 2'

Test #2:

score: 0
Accepted
time: 2ms
memory: 3400kb

input:

3 7
BBAA

output:

1 2

result:

ok single line: '1 2'

Test #3:

score: 0
Accepted
time: 1ms
memory: 3440kb

input:

3 9
BBAA

output:

1 2

result:

ok single line: '1 2'

Test #4:

score: 0
Accepted
time: 1ms
memory: 3400kb

input:

5 6
BBAA

output:

-1

result:

ok single line: '-1'

Test #5:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

6 7
AABB

output:

8 9

result:

ok single line: '8 9'

Test #6:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

3 7
AABB

output:

8 9

result:

ok single line: '8 9'

Test #7:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

1 7
AABB

output:

8 9

result:

ok single line: '8 9'

Test #8:

score: 0
Accepted
time: 2ms
memory: 3432kb

input:

4 5
AABB

output:

-1

result:

ok single line: '-1'

Test #9:

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

input:

1 4
ABBA

output:

2 3

result:

ok single line: '2 3'

Test #10:

score: 0
Accepted
time: 1ms
memory: 3384kb

input:

3 6
ABBA

output:

4 5

result:

ok single line: '4 5'

Test #11:

score: 0
Accepted
time: 2ms
memory: 3444kb

input:

4 7
ABBA

output:

5 6

result:

ok single line: '5 6'

Test #12:

score: 0
Accepted
time: 1ms
memory: 3444kb

input:

5 9
ABBA

output:

-1

result:

ok single line: '-1'

Test #13:

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

input:

1 5
ABBA

output:

-1

result:

ok single line: '-1'

Test #14:

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

input:

2 7
ABBA

output:

-1

result:

ok single line: '-1'

Test #15:

score: 0
Accepted
time: 1ms
memory: 3396kb

input:

1 9
ABBA

output:

-1

result:

ok single line: '-1'

Test #16:

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

input:

2 8
BAAB

output:

1 9

result:

ok single line: '1 9'

Test #17:

score: 0
Accepted
time: 1ms
memory: 3388kb

input:

3 8
BAAB

output:

-1

result:

ok single line: '-1'

Test #18:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

2 6
BAAB

output:

-1

result:

ok single line: '-1'

Test #19:

score: 0
Accepted
time: 2ms
memory: 3488kb

input:

4 5
BAAB

output:

-1

result:

ok single line: '-1'

Test #20:

score: 0
Accepted
time: 2ms
memory: 3400kb

input:

6 8
ABAB

output:

7 9

result:

ok single line: '7 9'

Test #21:

score: 0
Accepted
time: 2ms
memory: 3376kb

input:

4 8
ABAB

output:

-1

result:

ok single line: '-1'

Test #22:

score: 0
Accepted
time: 2ms
memory: 3444kb

input:

3 7
ABAB

output:

-1

result:

ok single line: '-1'

Test #23:

score: 0
Accepted
time: 1ms
memory: 3384kb

input:

5 7
ABAB

output:

-1

result:

ok single line: '-1'

Test #24:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

1 3
ABAB

output:

-1

result:

ok single line: '-1'

Test #25:

score: 0
Accepted
time: 2ms
memory: 3380kb

input:

2 4
BABA

output:

1 3

result:

ok single line: '1 3'

Test #26:

score: 0
Accepted
time: 2ms
memory: 3384kb

input:

2 5
BABA

output:

-1

result:

ok single line: '-1'

Test #27:

score: 0
Accepted
time: 2ms
memory: 3388kb

input:

3 5
BABA

output:

-1

result:

ok single line: '-1'

Test #28:

score: 0
Accepted
time: 2ms
memory: 3380kb

input:

7 9
BABA

output:

-1

result:

ok single line: '-1'

Test #29:

score: 0
Accepted
time: 2ms
memory: 3440kb

input:

6 9
ABBA

output:

7 8

result:

ok single line: '7 8'

Test #30:

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

input:

2 5
BAAB

output:

-1

result:

ok single line: '-1'