제출 #1223998

#제출 시각아이디문제언어결과실행 시간메모리
1223998TrumlingSphinx's Riddle (IOI24_sphinx)C++20
24 / 100
32 ms656 KiB
//Trumling © //Αφόδευε υψηλά και ηγνάντει #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define F first #define S second #define enter cout<<'\n'; #define INF 99999999999999999 #define MOD 1000000007 #define all(x) x.begin(),x.end() #include "sphinx.h" vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) { vector<int>G(N,0); for(int i=0;i<N;i++) { vector<int> E(N, N); E[i]=-1; for(int j=0;(1<<j)<N;j++) { ll idx=0; ll count=1; for(int jj=0;jj<N;jj++) if(jj&(1<<j)) { if(idx==i) idx++; E[idx++]=jj; count++; } if(count<N) count++; ll x=perform_experiment(E); // cout<<i<<' '<<j<<' '<<count<<','<<x<<'\n'; if(x==count-1) G[i]+=(1<<j); idx=0; for(int jj=0;jj<N;jj++) if(jj&(1<<j)) { if(idx==i) idx++; E[idx++]=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...