제출 #1194692

#제출 시각아이디문제언어결과실행 시간메모리
1194692TahirAliyev스핑크스 (IOI24_sphinx)C++20
0 / 100
0 ms412 KiB
#include "sphinx.h" #include <bits/stdc++.h> using namespace std; #define pii pair<int, int> int n; vector<int> ans; int ask(int l, int r, int x){ vector<int> v(n); for(int i = 0; i < n; i++){ if(i & 1) v[i] = x; else v[i] = n; } for(int i = l; i <= r; i++){ if(!(i & 1)) v[i] = -1; } return perform_experiment(v); } void rec(int l, int r, int x){ if(l == r){ ans[l] = x; return; } int mid = (l + r) / 2; if(ask(l, mid, x) != n){ rec(l, mid, x); } if(ask(mid + 1, r, x) != n){ rec(mid + 1, r, x); } } vector<int> find_colours(int N, vector<int> X, vector<int> Y){ n = N; ans.resize(n); for(int i = 0; i < N; i++){ rec(0, n - 1, i); } return ans; }
#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...