oj.uz

답안 #746489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
746489 2023-05-22T14:09:12 Z pls33 콤보 (IOI18_combo) C++17
100 / 100
 34 ms 716 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#pragma region dalykai
template <typename F>
void _debug(F f)
{
    f();
}

#ifndef _AAAAAAAAA
#define debug(x)
#else
#define debug(x) _debug(x)
#endif
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;
using f80 = long double;
#pragma endregion

#ifndef _AAAAAAAAA
#include "combo.h"
#else
std::string guess_sequence(int N);
int press(std::string p);
#endif

void guess_separator(string s, char &c)
{
    if (s.size() == 1)
    {
        c = s[0];
        return;
    }

    string l = s.substr(0, s.size() / 2);
    string r = s.substr(s.size() / 2, s.size() / 2);

    if (press(l))
    {
        guess_separator(l, c);
    }
    else
    {
        guess_separator(r, c);
    }
}

std::string guess_sequence(int N)
{
    char separator = 0;
    string button = "ABXY";
    guess_separator(button, separator);

    button.erase(find(button.begin(), button.end(), separator));

    string result;
    result += separator;

    for (int i = 2; i < N; i++)
    {
        // trys zuikiai vienu suviu?
        string guess = result + button[0] + button[0];
        guess += result + button[0] + button[1];
        guess += result + button[0] + button[2];
        guess += result + button[1];

        int answer = press(guess);
        if (answer == i + 1)
        {
            result += button[0];
        }
        else if (answer == i)
        {
            result += button[1];
        }
        else
        {
            result += button[2];
        }
    }

    if (result.size() < N)
    {
        vector<string> q(2);
        q[0] = result + button[0];
        q[1] = result + button[1];
        if (press(q[0] + q[1]) == N)
        {
            if (press(q[0]) == N)
            {
                result += button[0];
            }
            else
            {
                result += button[1];
            }
        }
        else
        {
            result += button[2];
        }
    }

    return result;
}

#ifdef _AAAAAAAAA

namespace
{

    constexpr int MAX_N = 2000;
    constexpr int MAX_NUM_MOVES = 8000;

    int N;
    std::string S;

    int num_moves;

    void wrong_answer(const char *MSG)
    {
        printf("Wrong Answer: %s\n", MSG);
        exit(0);
    }

} // namespace

int press(std::string p)
{
    if (++num_moves > MAX_NUM_MOVES)
    {
        wrong_answer("too many moves");
    }
    int len = (int)p.length();
    if (len > 4 * N)
    {
        wrong_answer("invalid press");
    }
    for (int i = 0; i < len; ++i)
    {
        if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y')
        {
            wrong_answer("invalid press");
        }
    }
    int coins = 0;
    for (int i = 0, j = 0; i < len; ++i)
    {
        if (j < N && S[j] == p[i])
        {
            ++j;
        }
        else if (S[0] == p[i])
        {
            j = 1;
        }
        else
        {
            j = 0;
        }
        coins = std::max(coins, j);
    }
    return coins;
}

int main()
{
    freopen("combo.in", "r", stdin);
    char buffer[MAX_N + 1];
    if (scanf("%s", buffer) != 1)
    {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    S = buffer;
    N = (int)S.length();

    num_moves = 0;
    std::string answer = guess_sequence(N);
    if (answer != S)
    {
        wrong_answer("wrong guess");
        exit(0);
    }
    printf("Accepted: %d\n", num_moves);
    return 0;
}

#endif

Compilation message

combo.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    8 | #pragma region dalykai
      | 
combo.cpp:43: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   43 | #pragma endregion
      | 
combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:107:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |     if (result.size() < N)
      |         ~~~~~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 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 1 ms 208 KB Output is correct
26 Correct 0 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 0 ms 208 KB Output is correct
30 Correct 1 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 1 ms 208 KB Output is correct
36 Correct 1 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 1 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 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 1 ms 208 KB Output is correct
17 Correct 22 ms 544 KB Output is correct
18 Correct 18 ms 456 KB Output is correct
19 Correct 27 ms 456 KB Output is correct
20 Correct 33 ms 500 KB Output is correct
21 Correct 23 ms 384 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 20 ms 524 KB Output is correct
33 Correct 27 ms 616 KB Output is correct
34 Correct 13 ms 468 KB Output is correct
35 Correct 26 ms 464 KB Output is correct
36 Correct 25 ms 388 KB Output is correct
37 Correct 20 ms 476 KB Output is correct
38 Correct 28 ms 492 KB Output is correct
39 Correct 26 ms 500 KB Output is correct
40 Correct 24 ms 448 KB Output is correct
41 Correct 29 ms 480 KB Output is correct
42 Correct 31 ms 616 KB Output is correct
43 Correct 23 ms 440 KB Output is correct
44 Correct 25 ms 716 KB Output is correct
45 Correct 25 ms 384 KB Output is correct
46 Correct 28 ms 488 KB Output is correct
47 Correct 19 ms 484 KB Output is correct
48 Correct 31 ms 500 KB Output is correct
49 Correct 30 ms 384 KB Output is correct
50 Correct 25 ms 476 KB Output is correct
51 Correct 22 ms 500 KB Output is correct
52 Correct 31 ms 536 KB Output is correct
53 Correct 19 ms 452 KB Output is correct
54 Correct 29 ms 388 KB Output is correct
55 Correct 29 ms 392 KB Output is correct
56 Correct 32 ms 384 KB Output is correct
57 Correct 24 ms 392 KB Output is correct
58 Correct 26 ms 544 KB Output is correct
59 Correct 34 ms 444 KB Output is correct
60 Correct 31 ms 460 KB Output is correct
61 Correct 15 ms 388 KB Output is correct
62 Correct 27 ms 384 KB Output is correct
63 Correct 23 ms 388 KB Output is correct
64 Correct 32 ms 384 KB Output is correct
65 Correct 31 ms 384 KB Output is correct
66 Correct 21 ms 384 KB Output is correct
67 Correct 23 ms 388 KB Output is correct
68 Correct 23 ms 384 KB Output is correct
69 Correct 28 ms 392 KB Output is correct
70 Correct 28 ms 392 KB Output is correct
71 Correct 27 ms 384 KB Output is correct
72 Correct 24 ms 384 KB Output is correct
73 Correct 19 ms 388 KB Output is correct
74 Correct 28 ms 388 KB Output is correct
75 Correct 31 ms 392 KB Output is correct
76 Correct 28 ms 392 KB Output is correct
77 Correct 29 ms 384 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 1 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 304 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 208 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 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 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 300 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 308 KB Output is correct
101 Correct 1 ms 300 KB Output is correct
102 Correct 1 ms 296 KB Output is correct
103 Correct 1 ms 208 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 296 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 0 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 1 ms 208 KB Output is correct
114 Correct 0 ms 208 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 300 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 220 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 2 ms 208 KB Output is correct