Submission #936750

#	Time	Username	Problem	Language	Result	Execution time	Memory
936750		Essa2006	콤보 (IOI18_combo)	C++14	0 / 100	0 ms	344 KiB

combo

// 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 = 1; i < n; i++) {
        int cur = press(p + c[0] + c[0] + p + c[0] + c[1] + p + c[0] + c[2] + p + c[1]);

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

//    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: 0 / 5
• Subtask 2: 0 / 95