oj.uz

Submission #936779

# Submission time Handle Problem Language Result Execution time Memory
936779 2024-03-02T17:17:56 Z Essa2006 Combo (IOI18_combo) C++14
100 / 100
 18 ms 1740 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 pp;

    if (press("AB")) {
        if (press("A")) {
            pp = "A";
        }
        else {
            pp = "B";
        }
    }
    else {
        if (press("X")) {
            pp = "X";
        }
        else {
            pp = "Y";
        }
    }

    string c = "";

    if (pp.front() != 'A') {
        c += "A";
    }
    if (pp.front() != 'B') {
        c += "B";
    }
    if (pp.front() != 'X') {
        c += "X";
    }
    if (pp.front() != 'Y') {
        c += "Y";
    }

    bool done = 0;
    for (int i = 2; i < n; i++) {
        int cur = press(pp + c[0] + c[0] + pp + c[0] + c[1] + pp + c[0] + c[2] + pp + c[1]);
        if (cur == i + 1) {
            pp += c[0];
        }
        else if (cur == i) {
            pp += c[1];
        }
        else {
            pp += c[2];
        }
        
        done = 1;
    }

    if (n == 1) {
        return pp;
    }

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

    return pp;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:166:10: warning: variable 'done' set but not used [-Wunused-but-set-variable]
  166 |     bool done = 0;
      |          ^~~~

Subtask #1
5.0 / 5.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 1 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 1 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 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 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 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 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 340 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 340 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 1 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 11 ms 1176 KB Output is correct
18 Correct 10 ms 1252 KB Output is correct
19 Correct 10 ms 1208 KB Output is correct
20 Correct 10 ms 1480 KB Output is correct
21 Correct 10 ms 924 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 0 ms 432 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 1 ms 456 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 692 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 10 ms 1536 KB Output is correct
33 Correct 10 ms 1492 KB Output is correct
34 Correct 11 ms 1484 KB Output is correct
35 Correct 9 ms 1288 KB Output is correct
36 Correct 11 ms 1728 KB Output is correct
37 Correct 10 ms 968 KB Output is correct
38 Correct 9 ms 1188 KB Output is correct
39 Correct 10 ms 1316 KB Output is correct
40 Correct 9 ms 1020 KB Output is correct
41 Correct 11 ms 1524 KB Output is correct
42 Correct 10 ms 1004 KB Output is correct
43 Correct 10 ms 1336 KB Output is correct
44 Correct 10 ms 968 KB Output is correct
45 Correct 9 ms 1216 KB Output is correct
46 Correct 10 ms 1004 KB Output is correct
47 Correct 10 ms 1084 KB Output is correct
48 Correct 10 ms 1124 KB Output is correct
49 Correct 10 ms 800 KB Output is correct
50 Correct 10 ms 948 KB Output is correct
51 Correct 10 ms 1600 KB Output is correct
52 Correct 9 ms 1280 KB Output is correct
53 Correct 10 ms 1720 KB Output is correct
54 Correct 11 ms 1472 KB Output is correct
55 Correct 9 ms 1024 KB Output is correct
56 Correct 10 ms 904 KB Output is correct
57 Correct 10 ms 972 KB Output is correct
58 Correct 13 ms 1472 KB Output is correct
59 Correct 18 ms 984 KB Output is correct
60 Correct 10 ms 1192 KB Output is correct
61 Correct 11 ms 1188 KB Output is correct
62 Correct 11 ms 1400 KB Output is correct
63 Correct 11 ms 1024 KB Output is correct
64 Correct 12 ms 1488 KB Output is correct
65 Correct 13 ms 1288 KB Output is correct
66 Correct 12 ms 1220 KB Output is correct
67 Correct 12 ms 1656 KB Output is correct
68 Correct 12 ms 1740 KB Output is correct
69 Correct 10 ms 1012 KB Output is correct
70 Correct 11 ms 1416 KB Output is correct
71 Correct 10 ms 940 KB Output is correct
72 Correct 10 ms 1588 KB Output is correct
73 Correct 11 ms 1420 KB Output is correct
74 Correct 13 ms 1092 KB Output is correct
75 Correct 11 ms 1396 KB Output is correct
76 Correct 11 ms 1224 KB Output is correct
77 Correct 10 ms 1228 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 0 ms 356 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 596 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 440 KB Output is correct
85 Correct 1 ms 432 KB Output is correct
86 Correct 1 ms 432 KB Output is correct
87 Correct 1 ms 440 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 0 ms 436 KB Output is correct
95 Correct 0 ms 432 KB Output is correct
96 Correct 0 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 0 ms 432 KB Output is correct
100 Correct 0 ms 436 KB Output is correct
101 Correct 1 ms 600 KB Output is correct
102 Correct 1 ms 436 KB Output is correct
103 Correct 0 ms 432 KB Output is correct
104 Correct 0 ms 432 KB Output is correct
105 Correct 0 ms 436 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 0 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 1 ms 344 KB Output is correct
115 Correct 1 ms 344 KB Output is correct
116 Correct 0 ms 596 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 1 ms 600 KB Output is correct
119 Correct 0 ms 436 KB Output is correct
120 Correct 1 ms 440 KB Output is correct
121 Correct 1 ms 440 KB Output is correct
122 Correct 1 ms 432 KB Output is correct
123 Correct 1 ms 436 KB Output is correct