Submission #1237791

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237791		inesfi	Sphinx's Riddle (IOI24_sphinx)	C++20	24 / 100	32 ms	908 KiB

sphinx

#include "sphinx.h"
#include<bits/stdc++.h>
using namespace std;

// int x = perform_experiment(E);

vector<int> init;

vector<int> find_colours(int n,vector<int> deb,vector<int> fin) {
    for (int i=0;i<n;i++){
        init.push_back(n);
    }
    vector<int> rep={};
    for (int i=0;i<n;i++){
        //cout<<i<<endl;
        int g=0,d=n-1;
        while (g<d){
            //cout<<g<<" "<<d<<endl;
            int mil=(g+d+1)/2;
            vector<int> quest=init;
            quest[i]=-1;
            int icoul=g;
            int indice=0;
            while (icoul<mil){
                if (indice==i){
                    indice++;
                }
                else {
                    quest[indice]=icoul;
                    indice++;
                    icoul++;
                }
            }
            int nbcompo=mil-g+1;
            if (n==2){
                nbcompo=1;
            }
            if (perform_experiment(quest)==nbcompo){
                d=mil-1;
            }
            else {
                g=mil;
            }
        }
        //cout<<g<<endl;
        rep.push_back(g);
    }
    return rep;
}

• Subtask 0: 0 / 0
• Subtask 1: 3 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 33
• Subtask 4: 21 / 21
• Subtask 5: 0 / 36