제출 #1237789

#제출 시각아이디문제언어결과실행 시간메모리
1237789inesfi스핑크스 (IOI24_sphinx)C++20
12 / 100
31 ms908 KiB
#include "sphinx.h" #include<bits/stdc++.h> using namespace std; // int x = perform_experiment(E); vector<int> init; vector<int> find_colours(int n,vector<int> deb,vector<int> fin) { for (int i=0;i<n;i++){ init.push_back(n); } vector<int> rep={}; for (int i=0;i<n;i++){ //cout<<i<<endl; int g=0,d=n-1; while (g<d){ //cout<<g<<" "<<d<<endl; int mil=(g+d+1)/2; vector<int> quest=init; quest[i]=-1; int icoul=g; int indice=0; while (icoul<mil){ if (indice==i){ indice++; } else { quest[indice]=icoul; indice++; icoul++; } } int nbcompo=mil-g+1; if (perform_experiment(quest)==nbcompo){ d=mil-1; } else { g=mil; } } //cout<<g<<endl; rep.push_back(g); } return rep; }
#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...