oj.uz

답안 #704845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704845 2023-03-03T05:26:11 Z ngano_upat_na 콤보 (IOI18_combo) C++17
100 / 100
 34 ms 952 KB 
#include "bits/stdc++.h"
#include "combo.h"
using namespace std;

string guess_sequence(int N) {
    string ans;
    char start = 'Y';
      
    
    int a = press("AB");
    if (a >= 1) {
        a = press("B");
        if (a == 1) {
            start = 'B';
        }
        else {
            start = 'A';
        }   
    }   
    else {
        a = press("X");
        if (a == 1) {
            start = 'X';
        }   
        else {
            start = 'Y';
        }   
    }
    
    if (N == 1) {
        ans.push_back(start);
        return ans;
    }   
    
    if (start == 'A') {
        ans = "A";
        
        for (int i=1; i<N-1; i++) {
            string A = ans + "B";
            string B = ans + "XB";
            string C = ans + "XY";
            string D = ans + "XX";
            
            A = A + B + C + D;
            a = press(A);
            
            if (a == i) {
                ans = ans + "Y";
            }   
            if (a == i+1) {
                ans = ans + "B";
            }   
            if (a >= i+2) {
                ans = ans + "X";
            }   
        }   
        string X = ans + "X";
        string Y = ans + "Y";
        string add = X + Y;
        a = press(add);
        
        if (a == N) {
            a = press(X);
            if (a == N) {
                ans = X;
            }   
            else {
                ans = Y;
            }   
        }   
        else {
            ans = ans + "B";
        }   
    } 
 
    else if (start == 'B') {
        ans = "B";
        
        for (int i=1; i<N-1; i++) {
            string A = ans + "A";
            string B = ans + "XA";
            string C = ans + "XY";
            string D = ans + "XX";
            
            A = A + B + C + D;
            a = press(A);
            
            if (a == i) {
                ans = ans + "Y";
            }   
            if (a == i+1) {
                ans = ans + "A";
            }   
            if (a >= i+2) {
                ans = ans + "X";
            }   
        }   
        string X = ans + "X";
        string Y = ans + "Y";
        string add = X + Y;
        a = press(add);
        
        if (a == N) {
            a = press(X);
            if (a == N) {
                ans = X;
            }   
            else {
                ans = Y;
            }   
        }   
        else {
            ans = ans + "A";
        }   
    } 
    
    
    else if (start == 'X') {
        ans = "X";
        
        for (int i=1; i<N-1; i++) {
            string A = ans + "B";
            string B = ans + "AB";
            string C = ans + "AY";
            string D = ans + "AA";
            
            A = A + B + C + D;
            a = press(A);
            
            if (a == i) {
                ans = ans + "Y";
            }   
            if (a == i+1) {
                ans = ans + "B";
            }   
            if (a >= i+2) {
                ans = ans + "A";
            }   
        }   
        string X = ans + "A";
        string Y = ans + "Y";
        string add = X + Y;
        a = press(add);
        
        if (a == N) {
            a = press(X);
            if (a == N) {
                ans = X;
            }   
            else {
                ans = Y;
            }   
        }   
        else {
            ans = ans + "B";
        }   
    } 
    
    
    else if (start == 'Y') {
        ans = "Y";
        
        for (int i=1; i<N-1; i++) {
            string A = ans + "B";
            string B = ans + "XB";
            string C = ans + "XA";
            string D = ans + "XX";
            
            A = A + B + C + D;
            a = press(A);
            
            if (a == i) {
                ans = ans + "A";
            }   
            if (a == i+1) {
                ans = ans + "B";
            }   
            if (a >= i+2) {
                ans = ans + "X";
            }   
        }   
        string X = ans + "X";
        string Y = ans + "A";
        string add = X + Y;
        a = press(add);
        
        if (a == N) {
            a = press(X);
            if (a == N) {
                ans = X;
            }   
            else {
                ans = Y;
            }   
        }   
        else {
            ans = ans + "B";
        }   
    } 
    
    return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 24 ms 612 KB Output is correct
18 Correct 28 ms 576 KB Output is correct
19 Correct 29 ms 528 KB Output is correct
20 Correct 26 ms 756 KB Output is correct
21 Correct 28 ms 636 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 20 ms 816 KB Output is correct
33 Correct 25 ms 624 KB Output is correct
34 Correct 23 ms 736 KB Output is correct
35 Correct 24 ms 712 KB Output is correct
36 Correct 16 ms 552 KB Output is correct
37 Correct 19 ms 548 KB Output is correct
38 Correct 28 ms 604 KB Output is correct
39 Correct 24 ms 608 KB Output is correct
40 Correct 23 ms 656 KB Output is correct
41 Correct 25 ms 572 KB Output is correct
42 Correct 29 ms 536 KB Output is correct
43 Correct 24 ms 608 KB Output is correct
44 Correct 22 ms 532 KB Output is correct
45 Correct 27 ms 616 KB Output is correct
46 Correct 27 ms 596 KB Output is correct
47 Correct 25 ms 612 KB Output is correct
48 Correct 24 ms 528 KB Output is correct
49 Correct 27 ms 696 KB Output is correct
50 Correct 20 ms 528 KB Output is correct
51 Correct 34 ms 536 KB Output is correct
52 Correct 21 ms 588 KB Output is correct
53 Correct 23 ms 612 KB Output is correct
54 Correct 33 ms 532 KB Output is correct
55 Correct 23 ms 552 KB Output is correct
56 Correct 28 ms 528 KB Output is correct
57 Correct 24 ms 532 KB Output is correct
58 Correct 25 ms 592 KB Output is correct
59 Correct 26 ms 636 KB Output is correct
60 Correct 29 ms 668 KB Output is correct
61 Correct 22 ms 608 KB Output is correct
62 Correct 26 ms 684 KB Output is correct
63 Correct 25 ms 576 KB Output is correct
64 Correct 24 ms 648 KB Output is correct
65 Correct 23 ms 528 KB Output is correct
66 Correct 32 ms 540 KB Output is correct
67 Correct 23 ms 776 KB Output is correct
68 Correct 26 ms 620 KB Output is correct
69 Correct 29 ms 616 KB Output is correct
70 Correct 30 ms 632 KB Output is correct
71 Correct 28 ms 536 KB Output is correct
72 Correct 29 ms 548 KB Output is correct
73 Correct 24 ms 540 KB Output is correct
74 Correct 29 ms 536 KB Output is correct
75 Correct 25 ms 532 KB Output is correct
76 Correct 26 ms 952 KB Output is correct
77 Correct 27 ms 532 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 304 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 300 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 1 ms 208 KB Output is correct
111 Correct 1 ms 208 KB Output is correct
112 Correct 1 ms 208 KB Output is correct
113 Correct 0 ms 208 KB Output is correct
114 Correct 1 ms 252 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct