Submission #1299145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1299145		alexiah	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	1 ms	332 KiB

sphinx

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

vector<int> find_colours(int n, vector<int> x, vector<int> y) {
  int m = x.size();
  vector<pair<int , int>> ord(m);
  vector<int> e(m , -1) , ans(n, -1) , idx;
  unordered_set <int >aux;
  for(int i = 0; i < m; i++){
    ord[i].first = x[i]; ord[i].second = y[i];
  }
  sort(ord.begin() , ord.end());
  for(auto v : ord){
    aux.insert(v.first); aux.insert(v.second);
  }
  for(auto v : aux){
    idx.push_back(v);
  }
  int ini = perform_experiment(e);
  int v = 0;
  ans[0] = v;
  for(int i = 0; i < n-1; i++){
    for(int j = 0; j < n; j++) e[j] = -1;
    e[idx[i]] = 0; e[idx[i+1]] = 0;
    int act = perform_experiment(e);
    if(act < ini) {v++; ans[i+1] = v;}
    else ans[i+1] = ans[i];
  }
  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