Submission #1237455

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237455		speedcode	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	0 ms	412 KiB

sphinx

#include<bits/stdc++.h>
using namespace std;
#define Algerian ios::sync_with_stdio(false);
#define OI cin.tie(0);
typedef long long ll;
#include "sphinx.h"

int Solve(int N, int node, vector<int> &ans){
    vector<int> E(N,N);
    E[node]=-1; E[node+1]=-1;
    int exp = perform_experiment(E);
    if(node==0 || node == N-2){
        if(exp==2) return ans[node];
        else return ans[node]+1;
    }
    else{
        if(exp==3) return ans[node];
        else return ans[node]+1;
    }
}


vector<int> find_colours(int N, vector<int> X, vector<int> Y){
     vector<int> ans(N,0);
     for (int i = 0; i < N-1; ++i){
        ans[i] = Solve(N,i,ans);
     }
     return ans;
}

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