제출 #424707

#제출 시각아이디문제언어결과실행 시간메모리
424707saleh커다란 상품 (IOI17_prize)C++17
컴파일 에러
0 ms0 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 200 * 1000 + 23; /* int m, a[MAXN]; vector<int> ask(int x) { vector<int> v; v.push_back(0); for (int i = 0; i < x; i++) if (a[i] < a[x]) v.back()++; v.push_back(0); for (int i = x; i < m; i++) if (a[i] < a[x]) v.back()++; return v; }*/ vector<int> vec[MAXN]; bitset<MAXN> mark; int look = 0, javab = -1, n, sum[MAXN]; set<int> lft; vector<int> osk(int x) { if (mark[x]) return vec[x]; mark[x] = true; lft.erase(x); if (q++ > 10 * 1000) exit(8); return vec[x] = ask(x); } bool go() { int dw = 0, up = n, l = 0, r = 0; while (up - dw > 1) { int mid = (dw + up) >> 1; if (mark[mid] && vec[mid][0] + vec[mid][1] < look) {//opt if tle auto tmp = lft.lower_bound(mid); if (*tmp >= up) tmp--; mid = *tmp; } vector<int> v = osk(mid); // cout << mid << ' ' << v[0] << ' ' << v[1] << endl; if (v[0] + v[1] == 0) return javab = mid, true; if (v[0] + v[1] < look) return false; if (look < v[0] + v[1]) { look = v[0] + v[1]; for (int i = 1; i <= n; i++) if (mark[i] && i != mid) sum[i] = sum[i - 1] + 1; else sum[i] = sum[i - 1]; } int ll = v[0] - l - (sum[mid] - sum[dw]), rr = v[1] - r - (sum[up] - sum[mid]); // cout << '\\' << ll << ' ' << rr << endl; if (ll < rr) dw = mid; else up = mid; } vector<int> v = osk(dw); if (v[0] + v[1] == 0) return javab = dw, true; if (v[0] + v[1] < look) return false; if (look < v[0] + v[1]) { look = v[0] + v[1]; for (int i = 1; i <= n; i++) if (mark[i] && i != dw) sum[i] = sum[i - 1] + 1; else sum[i] = sum[i - 1]; } } int find_best(int N) { n = N; for (int i = 0; i < n; i++) lft.insert(i); while (!go()); return javab; } /* int main() { int m; cin >> m; for (int i = 0; i < m; i++) cin >> a[i]; cout << find_best(m); return 0; }*/

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

prize.cpp: In function 'std::vector<int> osk(int)':
prize.cpp:37:6: error: 'q' was not declared in this scope
   37 |  if (q++ > 10 * 1000) exit(8);
      |      ^
prize.cpp: In function 'bool go()':
prize.cpp:62:25: warning: control reaches end of non-void function [-Wreturn-type]
   62 |   vector<int> v = osk(dw);
      |                         ^