제출 #1246297

#제출 시각아이디문제언어결과실행 시간메모리
1246297CyberCow스핑크스 (IOI24_sphinx)C++20
18 / 100
4 ms416 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, -1);
  for (int i = 0; i < X.size(); i++)
  {
    v[X[i]].push_back(Y[i]);
    v[Y[i]].push_back(X[i]);
  }
  int x = perform_experiment(E);
  int color = 0;
  for (int i = 0; i < N; i++)
  {
    E[i] = N;
    int y = perform_experiment(E);
    if(i == 0)
    {
      if(x == y)
      {
        G[0] = color;
        color++;
      }
      else
      {
        G[0] = color;
      }
    }
    else
    {
      if(x == y)
      {
        G[i] = color;
      }
      else
      {
        G[i] = color;
        color++;
      }
    }
    x = y;
  }
  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...