Submission #1246270

#TimeUsernameProblemLanguageResultExecution timeMemory
1246270CyberCowSphinx's Riddle (IOI24_sphinx)C++20
10 / 100
41 ms1184 KiB
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> v[300];

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
  vector<int> G(N, 0);
  vector<int> E(N, N);
  for (int i = 0; i < X.size(); i++)
  {
    v[X[i]].push_back(Y[i]);
    v[Y[i]].push_back(X[i]);
  }
  for (int i = 0; i < N; i++)
  {
    E[i] = 0;
    E[v[i][0]] = 0;
    int x = perform_experiment(E);
    for (int j = 0; j < N; j++)
    {
      E[i] = -1;
      E[v[i][0]] = j;
      int y = perform_experiment(E);
      if(x == y)
      {
        G[i] = j;
        break;;
      }
    }
    E[i] = N;
    E[v[i][0]] = N;
  }
  return G;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...