제출 #1247013

#제출 시각아이디문제언어결과실행 시간메모리
12470132008스핑크스 (IOI24_sphinx)C++20
0 / 100
0 ms412 KiB
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
  vector<int> E(N, -1);
  vector<int> colors; colors.push_back(0);
  vector<int> sphinx(N, N);
  vector<int> limit(N-1,3); limit[0]=2; limit[N-2]=2;
  for (int i=0; i<N-1; i++) {
    E=sphinx; E[i]=(-1); E[i+1]=(-1);
    if (perform_experiment(E)==limit[i]) {
      colors.push_back(colors[i]);
    } else {
      colors.push_back(colors[i]+1);
    }
  }
  return colors;
}
#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...