Submission #1223998

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

sphinx

//Trumling ©
//Αφόδευε υψηλά και ηγνάντει 
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#include "sphinx.h"

vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
  vector<int>G(N,0);
  for(int i=0;i<N;i++)
  {
    vector<int> E(N, N);
    E[i]=-1;

    for(int j=0;(1<<j)<N;j++)
    {
      ll idx=0;
      ll count=1;
      for(int jj=0;jj<N;jj++)
        if(jj&(1<<j))
        {
         if(idx==i)
            idx++;

          E[idx++]=jj;
          count++;
        }
      if(count<N)
        count++;
      ll x=perform_experiment(E);
     // cout<<i<<' '<<j<<' '<<count<<','<<x<<'\n';
      if(x==count-1)
        G[i]+=(1<<j);
      idx=0;
      for(int jj=0;jj<N;jj++)
        if(jj&(1<<j))
        {
         if(idx==i)
            idx++;

          E[idx++]=N;
        }
    }
  }
  return  G;
}

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