oj.uz

Submission #220035

# Submission time Handle Problem Language Result Execution time Memory
220035 2020-04-06T20:51:34 Z UserIsUndefined Combo (IOI18_combo) C++14
5 / 100
 1 ms 232 KB 
/**
 *    author:  Mohamad Milhem
 *    created: 2020-04-06-22.53.40
**/

#include <bits/stdc++.h>
#include <stdio.h>
#include "combo.h"

using namespace std;
typedef long long ll;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define MOD ll(1000000007)
#define debug(x) cout << '[' << #x << " is: " << x << "] " <<endl;
#define decimalpoint cout << std::fixed << setprecision(5)






std::string guess_sequence(int N) {
    string First = "ABXY";
    int indx = -1;

    for (int i = 0 ; i < 3 ; i++){
        string here = "";
        here+=First[i];
        if (press(here) > 0){indx = i ; break;}
    }
    if (indx == -1)indx = 3;

    vector<char> rest;
    for (int i = 0 ; i < 4 ; i++){
        if (i != indx)rest.push_back(First[i]);
    }

    string now = "" ;
    now+=First[indx];


    for (int i = 0 ; i < N - 2; i++){
        string q = "";
        string first = now + rest[1];
        string second1 = now + rest[2] + rest[0] + now + rest[2] + rest[1] + now + rest[2] + rest[2];
        q+=first;
        q+=second1;
        int ans = press(q);
        int in = ans-now.size();
        now+= rest[in];
    }

    string here1 = now + rest[0];
    string here2 = now + rest[1];

    if (press(here1) == N)now+= rest[0];
    else if (press(here2) == N)now+= rest[1];
    else now+=rest[2];


  return now;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 0 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 1 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 232 KB Output is correct
23 Correct 0 ms 200 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 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 0 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Wrong Answer: wrong guess.
2 Halted 0 ms 0 KB -