oj.uz

Submission #936781

# Submission time Handle Problem Language Result Execution time Memory
936781 2024-03-02T17:19:21 Z Essa2006 Combo (IOI18_combo) C++14
100 / 100
 13 ms 2148 KB 
// C++ includes used for precompiling -*- C++ -*-

// Copyright (C) 2003-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file stdc++.h
 *  This is an implementation file for a precompiled header.
 */

// 17.4.1.2 Headers

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
//#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <iostream>
#include <fstream>
#endif

#include "combo.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)


string guess_sequence(int n) {
    string p = "";

    if (press("AB")) {
        if (press("A")) {
            p.push_back('A');
        }
        else {
            p.push_back('B');
        }
    }
    else {
        if (press("X")) {
            p.push_back('X');
        }
        else {
            p.push_back('Y');
        }
    }
    string c = "";

    if (p.front() != 'A') {
        c.push_back('A');
    }
    if (p.front() != 'B') {
        c.push_back('B');
    }
    if (p.front() != 'X') {
        c.push_back('X');
    }
    if (p.front() != 'Y') {
        c.push_back('Y');
    }

    for (int i = 2; i < n; i++) {
        string g = "";
        g += p + c[0] + c[0];
        g += p + c[0] + c[1];
        g += p + c[0] + c[2];
        g += p + c[1];
        int cur = press(g);

        if (cur == i + 1) {
            p.push_back(c[0]);
        }
        else if (cur == i) {
            p.push_back(c[1]);
        }
        else {
            p.push_back(c[2]);
        }
    }
    
    if (n == 1) {
        return p;
    }

    if (press(p + c[0]) == n) {
        p.push_back(c[0]);
    }
    else if(press(p + c[1]) == n) {
        p.push_back(c[1]);
    }
    else {
        p.push_back(c[2]);
    }

    return p;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 500 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 12 ms 1404 KB Output is correct
18 Correct 11 ms 1300 KB Output is correct
19 Correct 12 ms 1488 KB Output is correct
20 Correct 12 ms 1292 KB Output is correct
21 Correct 12 ms 1656 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 432 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 440 KB Output is correct
29 Correct 1 ms 440 KB Output is correct
30 Correct 1 ms 700 KB Output is correct
31 Correct 2 ms 692 KB Output is correct
32 Correct 12 ms 1176 KB Output is correct
33 Correct 11 ms 1280 KB Output is correct
34 Correct 13 ms 1392 KB Output is correct
35 Correct 10 ms 1248 KB Output is correct
36 Correct 11 ms 1628 KB Output is correct
37 Correct 11 ms 1200 KB Output is correct
38 Correct 10 ms 1064 KB Output is correct
39 Correct 12 ms 1364 KB Output is correct
40 Correct 11 ms 1520 KB Output is correct
41 Correct 11 ms 1244 KB Output is correct
42 Correct 11 ms 1268 KB Output is correct
43 Correct 12 ms 1276 KB Output is correct
44 Correct 11 ms 960 KB Output is correct
45 Correct 11 ms 1164 KB Output is correct
46 Correct 12 ms 1384 KB Output is correct
47 Correct 11 ms 1228 KB Output is correct
48 Correct 10 ms 992 KB Output is correct
49 Correct 11 ms 956 KB Output is correct
50 Correct 12 ms 1744 KB Output is correct
51 Correct 12 ms 1636 KB Output is correct
52 Correct 11 ms 1116 KB Output is correct
53 Correct 11 ms 972 KB Output is correct
54 Correct 12 ms 1616 KB Output is correct
55 Correct 11 ms 1448 KB Output is correct
56 Correct 12 ms 1364 KB Output is correct
57 Correct 12 ms 1208 KB Output is correct
58 Correct 11 ms 2148 KB Output is correct
59 Correct 12 ms 1648 KB Output is correct
60 Correct 10 ms 1256 KB Output is correct
61 Correct 12 ms 1332 KB Output is correct
62 Correct 10 ms 1212 KB Output is correct
63 Correct 11 ms 1244 KB Output is correct
64 Correct 12 ms 976 KB Output is correct
65 Correct 10 ms 752 KB Output is correct
66 Correct 11 ms 1000 KB Output is correct
67 Correct 12 ms 1372 KB Output is correct
68 Correct 11 ms 1036 KB Output is correct
69 Correct 11 ms 1152 KB Output is correct
70 Correct 13 ms 1952 KB Output is correct
71 Correct 12 ms 1400 KB Output is correct
72 Correct 11 ms 1252 KB Output is correct
73 Correct 11 ms 1612 KB Output is correct
74 Correct 12 ms 1668 KB Output is correct
75 Correct 11 ms 1352 KB Output is correct
76 Correct 12 ms 1684 KB Output is correct
77 Correct 11 ms 1496 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 0 ms 436 KB Output is correct
87 Correct 1 ms 436 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 432 KB Output is correct
97 Correct 1 ms 436 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Correct 1 ms 444 KB Output is correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 1 ms 600 KB Output is correct
102 Correct 1 ms 440 KB Output is correct
103 Correct 1 ms 432 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 1 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 0 ms 344 KB Output is correct
120 Correct 0 ms 436 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 0 ms 436 KB Output is correct
123 Correct 1 ms 432 KB Output is correct