제출 #789179

#제출 시각아이디문제언어결과실행 시간메모리
789179enerelt14커다란 상품 (IOI17_prize)C++14
컴파일 에러
0 ms0 KiB
#include "prize.h" #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <climits> #include <cmath> #include <complex> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <vector> using namespace std; #define pb push_back const int B = 472; int val; vector<int> find(int l, int r){ vector<int> ans; if (l > r)return {}; vector<int> x = ask(r); if (x[0] + x[1] != val){ ans = find(l, r - 1); ans.pb(r); return ans; } int tl = l, tr = r; while (tl != tr){ int mid = (tl + tr) / 2; vector<int> y = ask(mid); if (y[0] + y[1] != val){ tl = mid + 1; continue; } if (y[1] != x[1])tl = mid + 1; else tr = mid; } if (l == tr)return {}; else{ ans = find(l, tr - 2); ans.pb(tr - 1); return ans; } } int find_best(int n){ vector<int> non_lolipop, x; for (int i = 0; i < B; i++){ x = ask(i); val = max(val, x[0] + x[1]); } for (int i = 0; i < n; i += B){ non_lolipop += find(i, min(n - 1, i + B - 1)); } for (int i = 0; i < non_lolipop.size(); i++){ x = ask(non_lolipop[i]); if (x[0] + x[1] == 0)return non_lolipop[i]; } }

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:61:15: error: no match for 'operator+=' (operand types are 'std::vector<int>' and 'std::vector<int>')
   61 |   non_lolipop += find(i, min(n - 1, i + B - 1));
      |   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
prize.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for (int i = 0; i < non_lolipop.size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~~~~~
prize.cpp:55:14: warning: control reaches end of non-void function [-Wreturn-type]
   55 |  vector<int> non_lolipop, x;
      |              ^~~~~~~~~~~