제출 #1099895

#제출 시각아이디문제언어결과실행 시간메모리
1099895model_code스핑크스 (IOI24_sphinx)C++17
36 / 100
68 ms344 KiB
// correct/GA_subtask3.cpp #include "sphinx.h" using namespace std; struct interval { int start, end, count; }; int query_interval(int N, int f, int r, int start, int end) { vector<int> v(N, f); vector<interval> iv; int count = 1; for (int j = start; j < end; j++) { if (j % 2 == r) { v[j] = -1; count += j == N - 1 ? 1 : 2; } } return (count - perform_experiment(v) + 1) / 2; } std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) { int M = X.size(); vector<int> res(N); for (int i = 0; i < N; i++) { vector<int> v(N, i); v[0] = -1; if (perform_experiment(v) == 1) { res[0] = i; break; } } for (int r = 0; r < 2; r++) { for (int i = 0; i < N; i++) { vector<interval> intervals; intervals.push_back({1, N, query_interval(N, i, r, 1, N)}); while (intervals.size()) { interval iv = intervals.back(); intervals.pop_back(); if (iv.count == 0) continue; if ((iv.start + r + 3) / 2 == (iv.end + r + 1) / 2) { res[(iv.start + r + 1) / 2 * 2 - r] = i; } else { int mid = (iv.start + iv.end) / 2; int count = query_interval(N, i, r, iv.start, mid); intervals.push_back({iv.start, mid, count}); intervals.push_back({mid, iv.end, iv.count - count}); } } } } return res; }

컴파일 시 표준 에러 (stderr) 메시지

sphinx.cpp: In function 'std::vector<int> find_colours(int, std::vector<int>, std::vector<int>)':
sphinx.cpp:25:7: warning: unused variable 'M' [-Wunused-variable]
   25 |   int M = X.size();
      |       ^
#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...