oj.uz

Submission #170672

# Submission time Handle Problem Language Result Execution time Memory
170672 2019-12-26T03:09:50 Z liwi Combo (IOI18_combo) C++11
100 / 100
 62 ms 476 KB 
#include "combo.h"

#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;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef gp_hash_table<int, null_type,hash<int>, equal_to<int>, direct_mask_range_hashing<int>, linear_probe_fn<>,
    hash_standard_resize_policy<hash_exponential_size_policy<>, hash_load_check_resize_trigger<true>,true>> hash_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-9
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(chrono::steady_clock::now().time_since_epoch().count());

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

//string word = "ABX";
vector<char> v = {'A','B','X','Y'};

//int press(string p){
//    cout<<p<<endl;
//    int res = 0;
//    for(int i=0; i<word.size(); i++){
//        string sub = word.substr(0,i+1);
//        if(p.find(sub) != string::npos)
//            res = i+1;
//    }
//    return res;
//}

inline string solve1(){
    for(int i=0; i<3; i++){
        int a = press(string(1,v[i]));
        if(a == 1) return string(1,v[i]);
    }
    return string(1,v.back());
}

string guess_sequence(int len){
    if(len == 1) return solve1();
    string ret = "";
    int f = press(string(1,v[0])+v[1]);
    if(f){
        f = press(string(1,v[0]));
        if(f) ret+=v[0];
        else ret+=v[1];
    }else{
        f = press(string(1,v[2]));
        if(f) ret+=v[2];
        else ret+=v[3];
    }
    v.erase(find(all(v),ret[0]));
    for(int i=2; i<len; i++){
        int a = press(ret+v[0]+ret+v[1]+v[0]+ret+v[1]+v[1]+ret+v[1]+v[2]);
        if(a == i-1) ret+=v[2];
        else if(a == i) ret+=v[0];
        else ret+=v[1];
    }
    for(int i=0; i<2; i++){
        int a = press(ret+v[i]);
        if(a == len){
            ret+=v[i];
            break;
        }
    }
    if(ret.size() != len) ret+=v.back();
    return ret;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:98:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   98 |     if(ret.size() != len) ret+=v.back();
      |        ~~~~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 204 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 1 ms 208 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 47 ms 360 KB Output is correct
18 Correct 39 ms 460 KB Output is correct
19 Correct 45 ms 348 KB Output is correct
20 Correct 30 ms 348 KB Output is correct
21 Correct 35 ms 348 KB Output is correct
22 Correct 3 ms 200 KB Output is correct
23 Correct 2 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 2 ms 200 KB Output is correct
26 Correct 3 ms 268 KB Output is correct
27 Correct 4 ms 312 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 5 ms 316 KB Output is correct
30 Correct 6 ms 328 KB Output is correct
31 Correct 3 ms 292 KB Output is correct
32 Correct 42 ms 432 KB Output is correct
33 Correct 35 ms 436 KB Output is correct
34 Correct 39 ms 376 KB Output is correct
35 Correct 46 ms 344 KB Output is correct
36 Correct 44 ms 344 KB Output is correct
37 Correct 18 ms 348 KB Output is correct
38 Correct 30 ms 344 KB Output is correct
39 Correct 46 ms 348 KB Output is correct
40 Correct 35 ms 340 KB Output is correct
41 Correct 32 ms 344 KB Output is correct
42 Correct 43 ms 352 KB Output is correct
43 Correct 21 ms 344 KB Output is correct
44 Correct 28 ms 476 KB Output is correct
45 Correct 34 ms 348 KB Output is correct
46 Correct 42 ms 348 KB Output is correct
47 Correct 27 ms 348 KB Output is correct
48 Correct 31 ms 348 KB Output is correct
49 Correct 26 ms 344 KB Output is correct
50 Correct 40 ms 348 KB Output is correct
51 Correct 35 ms 428 KB Output is correct
52 Correct 33 ms 404 KB Output is correct
53 Correct 42 ms 432 KB Output is correct
54 Correct 44 ms 448 KB Output is correct
55 Correct 44 ms 344 KB Output is correct
56 Correct 27 ms 352 KB Output is correct
57 Correct 62 ms 348 KB Output is correct
58 Correct 53 ms 404 KB Output is correct
59 Correct 35 ms 464 KB Output is correct
60 Correct 37 ms 436 KB Output is correct
61 Correct 45 ms 456 KB Output is correct
62 Correct 23 ms 352 KB Output is correct
63 Correct 41 ms 424 KB Output is correct
64 Correct 56 ms 344 KB Output is correct
65 Correct 44 ms 348 KB Output is correct
66 Correct 40 ms 348 KB Output is correct
67 Correct 24 ms 460 KB Output is correct
68 Correct 43 ms 460 KB Output is correct
69 Correct 40 ms 460 KB Output is correct
70 Correct 50 ms 364 KB Output is correct
71 Correct 43 ms 344 KB Output is correct
72 Correct 31 ms 348 KB Output is correct
73 Correct 33 ms 352 KB Output is correct
74 Correct 30 ms 408 KB Output is correct
75 Correct 28 ms 388 KB Output is correct
76 Correct 31 ms 416 KB Output is correct
77 Correct 40 ms 360 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 288 KB Output is correct
83 Correct 2 ms 200 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 2 ms 200 KB Output is correct
86 Correct 2 ms 200 KB Output is correct
87 Correct 2 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 1 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 2 ms 200 KB Output is correct
92 Correct 2 ms 200 KB Output is correct
93 Correct 2 ms 200 KB Output is correct
94 Correct 2 ms 200 KB Output is correct
95 Correct 4 ms 292 KB Output is correct
96 Correct 2 ms 200 KB Output is correct
97 Correct 3 ms 200 KB Output is correct
98 Correct 2 ms 200 KB Output is correct
99 Correct 3 ms 292 KB Output is correct
100 Correct 1 ms 296 KB Output is correct
101 Correct 2 ms 200 KB Output is correct
102 Correct 2 ms 200 KB Output is correct
103 Correct 2 ms 200 KB Output is correct
104 Correct 2 ms 200 KB Output is correct
105 Correct 2 ms 200 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 1 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 200 KB Output is correct
110 Correct 1 ms 200 KB Output is correct
111 Correct 1 ms 200 KB Output is correct
112 Correct 1 ms 200 KB Output is correct
113 Correct 2 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Correct 3 ms 200 KB Output is correct
116 Correct 2 ms 200 KB Output is correct
117 Correct 2 ms 200 KB Output is correct
118 Correct 2 ms 300 KB Output is correct
119 Correct 2 ms 204 KB Output is correct
120 Correct 2 ms 212 KB Output is correct
121 Correct 2 ms 212 KB Output is correct
122 Correct 2 ms 212 KB Output is correct
123 Correct 2 ms 312 KB Output is correct