oj.uz

답안 #321044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
321044 2020-11-10T17:34:48 Z gustason 콤보 (IOI18_combo) C++14
5 / 100
 1 ms 272 KB 
#include<bits/stdc++.h>
#include "combo.h"

using namespace std;

string guess_sequence(int N) {
    string S = "", q;
    int x;

    if (press("AB") >= 1) {
        if (press("A") == 1) {
            S += 'A';
        } else {
            S += 'B';
        }
    } else {
        if (press("X") == 1) {
            S += 'X';
        } else {
            S += 'Y';
        }
    }

    int sz = 1;
    for(int i = 1; i < N-1; i++, sz++) {
        if (S[0] == 'A') {
            q = S + "B" + S + "XB" + S + "XX" + S + "XY";
            x = press(q);
            if (x == sz) {
                S += "Y";
            } else if (x == sz + 1) {
                S += "B";
            } else {
                S += "X";
            }
        } else if (S[0] == 'B') {
            q = S + "A" + S + "XA" + S + "XX" + S + "XY";
            x = press(q);
            if (x == sz) {
                S += "Y";
            } else if (x == sz + 1) {
                S += "A";
            } else {
                S += "X";
            }
        } else if (S[0] == 'X') {
            q = S + "A" + S + "BA" + S + "BB" + S + "BY";
            x = press(q);
            if (x == sz) {
                S += "Y";
            } else if (x == sz + 1) {
                S += "A";
            } else {
                S += "B";
            }
        } else {
            q = S + "A" + S + "XA" + S + "XB" + S + "XX";
            x = press(q);
            if (x == sz) {
                S += "B";
            } else if (x == sz + 1) {
                S += "A";
            } else {
                S += "X";
            }
        }
    }

    if (S[0] != 'A') {
        q = S + "A";
        x = press(q);
        if (x == N) return q;
    }
    if (S[0] != 'B') {
        q = S + "B";
        x = press(q);
        if (x == N) return q;
    }
    if (S[0] != 'X') {
        if (S[0] == 'Y') {
            S += 'X';
            return S;
        }
        q = S + "X";
        x = press(q);
        if (x == N) return q;
    }
    S += "Y";
    return S;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 272 KB Output is correct
16 Correct 0 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 200 KB Wrong Answer: wrong guess.
2 Halted 0 ms 0 KB -