제출 #113523

#제출 시각아이디문제언어결과실행 시간메모리
113523E869120커다란 상품 (IOI17_prize)C++14
20 / 100
114 ms2204 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int A[200009]; vector<int> find_next(vector<int> R) { int maxn = 0; for (int i = 0; i < 12; i++) { vector<int> P = ask(R[rand() % R.size()]); maxn = max(maxn, P[0] + P[1]); } int cx = 0; vector<int> T; while (cx < R.size()) { vector<int> P = ask(R[cx]); if (P[0] + P[1] != maxn) { T.push_back(R[cx]); cx++; continue; } if (cx + 1 == (int)R.size()) break; int cl = cx, cr = R.size(), cm, maxn = -1; for (int i = 0; i < 18; i++) { cm = (cl + cr) / 2; vector<int> Q = ask(R[cm]); if (P == Q) { cl = cm; maxn = max(maxn, cm); } else { cr = cm; } } if (maxn == (int)R.size() - 1) break; T.push_back(R[maxn + 1]); cx = maxn + 2; } //for (int i = 0; i < T.size(); i++) cout << T[i] << ", "; cout << endl; return T; } int find_best(int n) { vector<int> E; for (int i = 0; i < n; i++) E.push_back(i); while (E.size() >= 2) E = find_next(E); return E[0]; }

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

prize.cpp: In function 'std::vector<int> find_next(std::vector<int>)':
prize.cpp:15:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (cx < R.size()) {
         ~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...